/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:45:24,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:45:24,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:45:24,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:45:24,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:45:24,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:45:24,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:45:24,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:45:24,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:45:24,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:45:24,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:45:24,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:45:24,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:45:24,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:45:24,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:45:24,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:45:24,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:45:24,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:45:24,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:45:24,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:45:24,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:45:24,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:45:24,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:45:24,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:45:24,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:45:24,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:45:24,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:45:24,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:45:24,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:45:24,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:45:24,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:45:24,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:45:24,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:45:24,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:45:24,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:45:24,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:45:24,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:45:24,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:45:24,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:45:24,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:45:24,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:45:24,703 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:45:24,731 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:45:24,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:45:24,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:45:24,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:45:24,734 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:45:24,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:45:24,735 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:45:24,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:45:24,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:45:24,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:45:24,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:45:24,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:45:24,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:45:24,737 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:45:24,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:45:24,737 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:45:24,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:45:24,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:45:24,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:45:24,737 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:45:24,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:45:24,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:45:24,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:45:24,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:45:24,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:45:24,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:45:24,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:45:24,739 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:45:24,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:45:25,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:45:25,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:45:25,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:45:25,051 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:45:25,052 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:45:25,053 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2022-12-06 07:45:26,162 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:45:26,380 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:45:26,382 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2022-12-06 07:45:26,389 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec2fc7fa/a8221a57b8be43858b7a2fb381677d68/FLAG56622514e [2022-12-06 07:45:26,407 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec2fc7fa/a8221a57b8be43858b7a2fb381677d68 [2022-12-06 07:45:26,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:45:26,414 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:45:26,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:45:26,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:45:26,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:45:26,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:45:26" (1/1) ... [2022-12-06 07:45:26,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1779663c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:45:26, skipping insertion in model container [2022-12-06 07:45:26,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:45:26" (1/1) ... [2022-12-06 07:45:26,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:45:26,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:45:26,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:45:26,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:45:26,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:45:26,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:45:26,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:45:26,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:45:26,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:45:26,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:45:26,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:45:26,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:45:26,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:45:26,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:45:26,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:45:26,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:45:26,650 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2591,2604] [2022-12-06 07:45:26,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:45:26,668 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:45:26,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:45:26,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:45:26,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:45:26,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:45:26,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:45:26,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:45:26,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:45:26,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:45:26,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:45:26,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:45:26,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:45:26,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:45:26,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:45:26,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:45:26,703 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2591,2604] [2022-12-06 07:45:26,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:45:26,718 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:45:26,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:45:26 WrapperNode [2022-12-06 07:45:26,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:45:26,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:45:26,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:45:26,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:45:26,729 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:45:26" (1/1) ... [2022-12-06 07:45:26,742 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:45:26" (1/1) ... [2022-12-06 07:45:26,766 INFO L138 Inliner]: procedures = 22, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2022-12-06 07:45:26,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:45:26,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:45:26,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:45:26,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:45:26,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:45:26" (1/1) ... [2022-12-06 07:45:26,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:45:26" (1/1) ... [2022-12-06 07:45:26,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:45:26" (1/1) ... [2022-12-06 07:45:26,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:45:26" (1/1) ... [2022-12-06 07:45:26,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:45:26" (1/1) ... [2022-12-06 07:45:26,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:45:26" (1/1) ... [2022-12-06 07:45:26,799 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:45:26" (1/1) ... [2022-12-06 07:45:26,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:45:26" (1/1) ... [2022-12-06 07:45:26,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:45:26,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:45:26,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:45:26,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:45:26,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:45:26" (1/1) ... [2022-12-06 07:45:26,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:45:26,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:26,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:45:26,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:45:26,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:45:26,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:45:26,875 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:45:26,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:45:26,875 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:45:26,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:45:26,875 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:45:26,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:45:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:45:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:45:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:45:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:45:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:45:26,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:45:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:45:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:45:26,877 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:45:26,962 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:45:26,964 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:45:27,118 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:45:27,178 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:45:27,178 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 07:45:27,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:45:27 BoogieIcfgContainer [2022-12-06 07:45:27,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:45:27,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:45:27,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:45:27,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:45:27,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:45:26" (1/3) ... [2022-12-06 07:45:27,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb47378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:45:27, skipping insertion in model container [2022-12-06 07:45:27,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:45:26" (2/3) ... [2022-12-06 07:45:27,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb47378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:45:27, skipping insertion in model container [2022-12-06 07:45:27,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:45:27" (3/3) ... [2022-12-06 07:45:27,198 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2022-12-06 07:45:27,222 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:45:27,222 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:45:27,222 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:45:27,306 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:45:27,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 92 transitions, 208 flow [2022-12-06 07:45:27,403 INFO L130 PetriNetUnfolder]: 7/89 cut-off events. [2022-12-06 07:45:27,403 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:45:27,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 89 events. 7/89 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-12-06 07:45:27,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 92 transitions, 208 flow [2022-12-06 07:45:27,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 79 transitions, 176 flow [2022-12-06 07:45:27,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:27,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 79 transitions, 176 flow [2022-12-06 07:45:27,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 79 transitions, 176 flow [2022-12-06 07:45:27,465 INFO L130 PetriNetUnfolder]: 7/79 cut-off events. [2022-12-06 07:45:27,466 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:45:27,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 79 events. 7/79 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-12-06 07:45:27,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 79 transitions, 176 flow [2022-12-06 07:45:27,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 860 [2022-12-06 07:45:30,128 INFO L203 LiptonReduction]: Total number of compositions: 56 [2022-12-06 07:45:30,141 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:45:30,146 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61191ebe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:45:30,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:45:30,151 INFO L130 PetriNetUnfolder]: 3/22 cut-off events. [2022-12-06 07:45:30,152 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:45:30,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:30,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:30,153 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:30,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash 550202111, now seen corresponding path program 1 times [2022-12-06 07:45:30,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:30,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092405772] [2022-12-06 07:45:30,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:30,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:30,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:30,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092405772] [2022-12-06 07:45:30,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092405772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:30,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:30,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:45:30,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680695909] [2022-12-06 07:45:30,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:30,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:45:30,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:30,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:45:30,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:45:30,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-06 07:45:30,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:30,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:30,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-06 07:45:30,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:30,925 INFO L130 PetriNetUnfolder]: 271/426 cut-off events. [2022-12-06 07:45:30,926 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-06 07:45:30,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 426 events. 271/426 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1527 event pairs, 37 based on Foata normal form. 1/279 useless extension candidates. Maximal degree in co-relation 671. Up to 309 conditions per place. [2022-12-06 07:45:30,934 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 30 selfloop transitions, 4 changer transitions 1/39 dead transitions. [2022-12-06 07:45:30,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 181 flow [2022-12-06 07:45:30,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:45:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:45:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 07:45:30,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6956521739130435 [2022-12-06 07:45:30,946 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 64 flow. Second operand 3 states and 48 transitions. [2022-12-06 07:45:30,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 181 flow [2022-12-06 07:45:30,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 39 transitions, 159 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:45:30,953 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 78 flow [2022-12-06 07:45:30,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=27, PETRI_TRANSITIONS=26} [2022-12-06 07:45:30,960 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 07:45:30,961 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:30,961 INFO L89 Accepts]: Start accepts. Operand has 27 places, 26 transitions, 78 flow [2022-12-06 07:45:30,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:30,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:30,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 26 transitions, 78 flow [2022-12-06 07:45:30,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 78 flow [2022-12-06 07:45:30,983 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([269] thread2EXIT-->L101-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} AuxVars[] AssignedVars[][22], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 16#L101-2true, 98#true]) [2022-12-06 07:45:30,984 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2022-12-06 07:45:30,984 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-06 07:45:30,984 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 07:45:30,984 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2022-12-06 07:45:30,987 INFO L130 PetriNetUnfolder]: 22/63 cut-off events. [2022-12-06 07:45:30,987 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:45:30,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 63 events. 22/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 143 event pairs, 1 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 67. Up to 26 conditions per place. [2022-12-06 07:45:30,988 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 26 transitions, 78 flow [2022-12-06 07:45:30,988 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 07:45:30,992 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:30,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 07:45:30,994 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 26 transitions, 78 flow [2022-12-06 07:45:30,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:30,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:30,995 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:30,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:45:30,998 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:30,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:30,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1335524592, now seen corresponding path program 1 times [2022-12-06 07:45:30,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:30,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416409817] [2022-12-06 07:45:30,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:30,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:31,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:31,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416409817] [2022-12-06 07:45:31,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416409817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:31,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:31,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:31,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472678135] [2022-12-06 07:45:31,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:31,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:45:31,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:31,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:45:31,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:31,276 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:45:31,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:31,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:31,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:45:31,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:31,493 INFO L130 PetriNetUnfolder]: 459/707 cut-off events. [2022-12-06 07:45:31,493 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2022-12-06 07:45:31,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 707 events. 459/707 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2554 event pairs, 40 based on Foata normal form. 40/747 useless extension candidates. Maximal degree in co-relation 353. Up to 277 conditions per place. [2022-12-06 07:45:31,497 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 72 selfloop transitions, 12 changer transitions 0/84 dead transitions. [2022-12-06 07:45:31,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 84 transitions, 395 flow [2022-12-06 07:45:31,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:45:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:45:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-06 07:45:31,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2022-12-06 07:45:31,500 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 78 flow. Second operand 7 states and 84 transitions. [2022-12-06 07:45:31,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 84 transitions, 395 flow [2022-12-06 07:45:31,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 84 transitions, 387 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:45:31,502 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 154 flow [2022-12-06 07:45:31,503 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2022-12-06 07:45:31,503 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2022-12-06 07:45:31,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:31,503 INFO L89 Accepts]: Start accepts. Operand has 36 places, 35 transitions, 154 flow [2022-12-06 07:45:31,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:31,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:31,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 35 transitions, 154 flow [2022-12-06 07:45:31,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions, 154 flow [2022-12-06 07:45:31,515 INFO L130 PetriNetUnfolder]: 35/108 cut-off events. [2022-12-06 07:45:31,515 INFO L131 PetriNetUnfolder]: For 30/34 co-relation queries the response was YES. [2022-12-06 07:45:31,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 108 events. 35/108 cut-off events. For 30/34 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 397 event pairs, 2 based on Foata normal form. 2/106 useless extension candidates. Maximal degree in co-relation 175. Up to 41 conditions per place. [2022-12-06 07:45:31,516 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 35 transitions, 154 flow [2022-12-06 07:45:31,516 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 07:45:31,600 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [240] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_1 (ite (= 0 (ite (< 0 (mod v_~N~0_1 4294967296)) 1 0)) 0 1)) InVars {~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_1, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] and [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] [2022-12-06 07:45:31,689 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [240] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_1 (ite (= 0 (ite (< 0 (mod v_~N~0_1 4294967296)) 1 0)) 0 1)) InVars {~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_1, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 07:45:31,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [240] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_1 (ite (= 0 (ite (< 0 (mod v_~N~0_1 4294967296)) 1 0)) 0 1)) InVars {~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_1, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 07:45:31,804 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [240] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_1 (ite (= 0 (ite (< 0 (mod v_~N~0_1 4294967296)) 1 0)) 0 1)) InVars {~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_1, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:45:31,845 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:45:31,846 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 343 [2022-12-06 07:45:31,846 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 162 flow [2022-12-06 07:45:31,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:31,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:31,846 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:31,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:45:31,847 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:31,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:31,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1519269174, now seen corresponding path program 1 times [2022-12-06 07:45:31,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:31,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46485789] [2022-12-06 07:45:31,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:31,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:32,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:32,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46485789] [2022-12-06 07:45:32,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46485789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:32,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:32,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:45:32,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521962] [2022-12-06 07:45:32,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:32,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:32,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:32,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:32,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:32,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:45:32,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:32,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:32,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:45:32,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:32,186 INFO L130 PetriNetUnfolder]: 520/784 cut-off events. [2022-12-06 07:45:32,186 INFO L131 PetriNetUnfolder]: For 724/724 co-relation queries the response was YES. [2022-12-06 07:45:32,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 784 events. 520/784 cut-off events. For 724/724 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2883 event pairs, 65 based on Foata normal form. 16/800 useless extension candidates. Maximal degree in co-relation 2163. Up to 526 conditions per place. [2022-12-06 07:45:32,191 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 49 selfloop transitions, 8 changer transitions 3/60 dead transitions. [2022-12-06 07:45:32,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 60 transitions, 359 flow [2022-12-06 07:45:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:45:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:45:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 07:45:32,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5086206896551724 [2022-12-06 07:45:32,194 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 162 flow. Second operand 4 states and 59 transitions. [2022-12-06 07:45:32,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 60 transitions, 359 flow [2022-12-06 07:45:32,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 60 transitions, 345 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 07:45:32,200 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 173 flow [2022-12-06 07:45:32,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2022-12-06 07:45:32,201 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2022-12-06 07:45:32,201 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:32,201 INFO L89 Accepts]: Start accepts. Operand has 37 places, 34 transitions, 173 flow [2022-12-06 07:45:32,203 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:32,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:32,206 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 34 transitions, 173 flow [2022-12-06 07:45:32,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 173 flow [2022-12-06 07:45:32,220 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([269] thread2EXIT-->L101-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} AuxVars[] AssignedVars[][30], [Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 105#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 42#L83true, 114#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 16#L101-2true, 102#true, Black: 104#(= ~N~0 ~L~0)]) [2022-12-06 07:45:32,220 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2022-12-06 07:45:32,220 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2022-12-06 07:45:32,220 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-06 07:45:32,220 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 07:45:32,225 INFO L130 PetriNetUnfolder]: 45/121 cut-off events. [2022-12-06 07:45:32,225 INFO L131 PetriNetUnfolder]: For 60/69 co-relation queries the response was YES. [2022-12-06 07:45:32,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 121 events. 45/121 cut-off events. For 60/69 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 427 event pairs, 3 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 218. Up to 51 conditions per place. [2022-12-06 07:45:32,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 34 transitions, 173 flow [2022-12-06 07:45:32,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 07:45:32,234 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:32,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 07:45:32,235 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 173 flow [2022-12-06 07:45:32,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:32,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:32,236 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:32,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:45:32,236 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:32,236 INFO L85 PathProgramCache]: Analyzing trace with hash -864847907, now seen corresponding path program 1 times [2022-12-06 07:45:32,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:32,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549226122] [2022-12-06 07:45:32,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:32,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:32,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:32,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549226122] [2022-12-06 07:45:32,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549226122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:32,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:32,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:45:32,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203592978] [2022-12-06 07:45:32,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:32,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:32,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:32,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:32,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:32,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:45:32,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:32,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:32,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:45:32,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:32,567 INFO L130 PetriNetUnfolder]: 654/978 cut-off events. [2022-12-06 07:45:32,567 INFO L131 PetriNetUnfolder]: For 1019/1019 co-relation queries the response was YES. [2022-12-06 07:45:32,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2970 conditions, 978 events. 654/978 cut-off events. For 1019/1019 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3712 event pairs, 135 based on Foata normal form. 42/1014 useless extension candidates. Maximal degree in co-relation 2018. Up to 630 conditions per place. [2022-12-06 07:45:32,575 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 53 selfloop transitions, 8 changer transitions 3/64 dead transitions. [2022-12-06 07:45:32,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 64 transitions, 394 flow [2022-12-06 07:45:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:45:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:45:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 07:45:32,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5258620689655172 [2022-12-06 07:45:32,577 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 173 flow. Second operand 4 states and 61 transitions. [2022-12-06 07:45:32,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 64 transitions, 394 flow [2022-12-06 07:45:32,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 64 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:32,583 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 188 flow [2022-12-06 07:45:32,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2022-12-06 07:45:32,584 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2022-12-06 07:45:32,584 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:32,584 INFO L89 Accepts]: Start accepts. Operand has 39 places, 35 transitions, 188 flow [2022-12-06 07:45:32,585 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:32,585 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:32,585 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 35 transitions, 188 flow [2022-12-06 07:45:32,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 188 flow [2022-12-06 07:45:32,601 INFO L130 PetriNetUnfolder]: 47/132 cut-off events. [2022-12-06 07:45:32,601 INFO L131 PetriNetUnfolder]: For 88/105 co-relation queries the response was YES. [2022-12-06 07:45:32,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 132 events. 47/132 cut-off events. For 88/105 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 506 event pairs, 4 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 258. Up to 54 conditions per place. [2022-12-06 07:45:32,603 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 35 transitions, 188 flow [2022-12-06 07:45:32,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 07:45:32,606 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:32,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 07:45:32,607 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 188 flow [2022-12-06 07:45:32,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:32,608 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:32,608 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:32,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:45:32,608 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:32,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:32,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1207173731, now seen corresponding path program 1 times [2022-12-06 07:45:32,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:32,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954626875] [2022-12-06 07:45:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:32,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:32,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:32,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954626875] [2022-12-06 07:45:32,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954626875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:32,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:32,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:45:32,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013062977] [2022-12-06 07:45:32,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:32,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:32,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:32,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:32,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:32,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:45:32,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:32,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:32,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:45:32,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:32,973 INFO L130 PetriNetUnfolder]: 678/1058 cut-off events. [2022-12-06 07:45:32,973 INFO L131 PetriNetUnfolder]: For 1651/1651 co-relation queries the response was YES. [2022-12-06 07:45:32,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3340 conditions, 1058 events. 678/1058 cut-off events. For 1651/1651 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4266 event pairs, 328 based on Foata normal form. 20/1072 useless extension candidates. Maximal degree in co-relation 2226. Up to 865 conditions per place. [2022-12-06 07:45:32,981 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 51 selfloop transitions, 2 changer transitions 7/60 dead transitions. [2022-12-06 07:45:32,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 379 flow [2022-12-06 07:45:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:45:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:45:32,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 07:45:32,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2022-12-06 07:45:32,982 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 188 flow. Second operand 4 states and 56 transitions. [2022-12-06 07:45:32,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 379 flow [2022-12-06 07:45:32,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:32,986 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 191 flow [2022-12-06 07:45:32,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2022-12-06 07:45:32,987 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2022-12-06 07:45:32,987 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:32,987 INFO L89 Accepts]: Start accepts. Operand has 42 places, 36 transitions, 191 flow [2022-12-06 07:45:32,988 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:32,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:32,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 191 flow [2022-12-06 07:45:32,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 191 flow [2022-12-06 07:45:33,000 INFO L130 PetriNetUnfolder]: 46/143 cut-off events. [2022-12-06 07:45:33,001 INFO L131 PetriNetUnfolder]: For 108/125 co-relation queries the response was YES. [2022-12-06 07:45:33,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 143 events. 46/143 cut-off events. For 108/125 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 585 event pairs, 5 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 313. Up to 56 conditions per place. [2022-12-06 07:45:33,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 191 flow [2022-12-06 07:45:33,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 07:45:33,004 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:33,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 07:45:33,004 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 191 flow [2022-12-06 07:45:33,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:33,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:33,005 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:33,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:45:33,005 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:33,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:33,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1673894509, now seen corresponding path program 2 times [2022-12-06 07:45:33,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:33,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444691772] [2022-12-06 07:45:33,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:33,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:33,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:33,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444691772] [2022-12-06 07:45:33,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444691772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:33,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:33,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:45:33,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539895814] [2022-12-06 07:45:33,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:33,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:33,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:33,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:33,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:33,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:45:33,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:33,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:33,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:45:33,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:33,411 INFO L130 PetriNetUnfolder]: 820/1235 cut-off events. [2022-12-06 07:45:33,412 INFO L131 PetriNetUnfolder]: For 2143/2143 co-relation queries the response was YES. [2022-12-06 07:45:33,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4148 conditions, 1235 events. 820/1235 cut-off events. For 2143/2143 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5058 event pairs, 200 based on Foata normal form. 10/1239 useless extension candidates. Maximal degree in co-relation 3938. Up to 714 conditions per place. [2022-12-06 07:45:33,420 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 49 selfloop transitions, 8 changer transitions 13/70 dead transitions. [2022-12-06 07:45:33,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 70 transitions, 483 flow [2022-12-06 07:45:33,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:45:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:45:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 07:45:33,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2022-12-06 07:45:33,422 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 191 flow. Second operand 4 states and 62 transitions. [2022-12-06 07:45:33,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 70 transitions, 483 flow [2022-12-06 07:45:33,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 70 transitions, 473 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:33,430 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 217 flow [2022-12-06 07:45:33,430 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-12-06 07:45:33,430 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2022-12-06 07:45:33,431 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:33,431 INFO L89 Accepts]: Start accepts. Operand has 43 places, 36 transitions, 217 flow [2022-12-06 07:45:33,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:33,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:33,432 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 36 transitions, 217 flow [2022-12-06 07:45:33,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 217 flow [2022-12-06 07:45:33,447 INFO L130 PetriNetUnfolder]: 61/163 cut-off events. [2022-12-06 07:45:33,447 INFO L131 PetriNetUnfolder]: For 142/171 co-relation queries the response was YES. [2022-12-06 07:45:33,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 163 events. 61/163 cut-off events. For 142/171 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 671 event pairs, 5 based on Foata normal form. 6/162 useless extension candidates. Maximal degree in co-relation 416. Up to 73 conditions per place. [2022-12-06 07:45:33,449 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 217 flow [2022-12-06 07:45:33,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 07:45:33,454 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:33,455 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 07:45:33,455 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 217 flow [2022-12-06 07:45:33,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:33,455 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:33,455 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:33,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:45:33,456 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:33,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:33,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1214448801, now seen corresponding path program 1 times [2022-12-06 07:45:33,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:33,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239200210] [2022-12-06 07:45:33,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:33,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:33,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:33,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239200210] [2022-12-06 07:45:33,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239200210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:33,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:33,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:45:33,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212427037] [2022-12-06 07:45:33,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:33,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:33,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:33,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:33,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:33,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:45:33,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:33,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:33,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:45:33,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:33,837 INFO L130 PetriNetUnfolder]: 960/1410 cut-off events. [2022-12-06 07:45:33,837 INFO L131 PetriNetUnfolder]: For 2778/2778 co-relation queries the response was YES. [2022-12-06 07:45:33,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5062 conditions, 1410 events. 960/1410 cut-off events. For 2778/2778 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5827 event pairs, 168 based on Foata normal form. 18/1422 useless extension candidates. Maximal degree in co-relation 3673. Up to 676 conditions per place. [2022-12-06 07:45:33,849 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 66 selfloop transitions, 17 changer transitions 0/83 dead transitions. [2022-12-06 07:45:33,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 83 transitions, 608 flow [2022-12-06 07:45:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 07:45:33,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2022-12-06 07:45:33,850 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 217 flow. Second operand 5 states and 73 transitions. [2022-12-06 07:45:33,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 83 transitions, 608 flow [2022-12-06 07:45:33,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 83 transitions, 592 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:33,857 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 306 flow [2022-12-06 07:45:33,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2022-12-06 07:45:33,858 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2022-12-06 07:45:33,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:33,858 INFO L89 Accepts]: Start accepts. Operand has 45 places, 44 transitions, 306 flow [2022-12-06 07:45:33,859 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:33,859 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:33,859 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 44 transitions, 306 flow [2022-12-06 07:45:33,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 306 flow [2022-12-06 07:45:33,873 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][32], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 63#L99-4true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, 6#L72true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 104#(= ~N~0 ~L~0), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 105#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 68#L46-1true]) [2022-12-06 07:45:33,873 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is not cut-off event [2022-12-06 07:45:33,873 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 07:45:33,873 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2022-12-06 07:45:33,874 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 07:45:33,876 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][32], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 63#L99-4true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 6#L72true, 102#true, Black: 104#(= ~N~0 ~L~0), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 105#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 68#L46-1true]) [2022-12-06 07:45:33,877 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:33,877 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:33,877 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:33,877 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:33,877 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:45:33,881 INFO L130 PetriNetUnfolder]: 91/222 cut-off events. [2022-12-06 07:45:33,882 INFO L131 PetriNetUnfolder]: For 317/359 co-relation queries the response was YES. [2022-12-06 07:45:33,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 222 events. 91/222 cut-off events. For 317/359 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1011 event pairs, 8 based on Foata normal form. 12/231 useless extension candidates. Maximal degree in co-relation 665. Up to 100 conditions per place. [2022-12-06 07:45:33,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 44 transitions, 306 flow [2022-12-06 07:45:33,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 07:45:33,887 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:33,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 07:45:33,888 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 306 flow [2022-12-06 07:45:33,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:33,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:33,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:33,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:45:33,889 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:33,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:33,890 INFO L85 PathProgramCache]: Analyzing trace with hash -861510489, now seen corresponding path program 1 times [2022-12-06 07:45:33,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:33,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669290199] [2022-12-06 07:45:33,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:33,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:34,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:34,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669290199] [2022-12-06 07:45:34,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669290199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:34,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:34,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:34,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963785727] [2022-12-06 07:45:34,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:34,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:45:34,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:34,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:45:34,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:45:34,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:45:34,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 306 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:34,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:34,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:45:34,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:34,388 INFO L130 PetriNetUnfolder]: 1207/1818 cut-off events. [2022-12-06 07:45:34,389 INFO L131 PetriNetUnfolder]: For 5089/5089 co-relation queries the response was YES. [2022-12-06 07:45:34,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7184 conditions, 1818 events. 1207/1818 cut-off events. For 5089/5089 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8062 event pairs, 280 based on Foata normal form. 24/1836 useless extension candidates. Maximal degree in co-relation 4653. Up to 990 conditions per place. [2022-12-06 07:45:34,402 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 75 selfloop transitions, 18 changer transitions 0/93 dead transitions. [2022-12-06 07:45:34,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 93 transitions, 721 flow [2022-12-06 07:45:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-06 07:45:34,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2022-12-06 07:45:34,403 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 306 flow. Second operand 5 states and 71 transitions. [2022-12-06 07:45:34,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 93 transitions, 721 flow [2022-12-06 07:45:34,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 701 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:45:34,415 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 432 flow [2022-12-06 07:45:34,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=432, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2022-12-06 07:45:34,418 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2022-12-06 07:45:34,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:34,418 INFO L89 Accepts]: Start accepts. Operand has 51 places, 52 transitions, 432 flow [2022-12-06 07:45:34,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:34,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:34,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 52 transitions, 432 flow [2022-12-06 07:45:34,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 52 transitions, 432 flow [2022-12-06 07:45:34,438 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][33], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 145#true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 63#L99-4true, 80#L53true, 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 104#(= ~N~0 ~L~0), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 105#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 48#L65-1true, Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2022-12-06 07:45:34,438 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is not cut-off event [2022-12-06 07:45:34,438 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 07:45:34,438 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 07:45:34,438 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2022-12-06 07:45:34,439 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][35], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 145#true, 63#L99-4true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 6#L72true, 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 104#(= ~N~0 ~L~0), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 105#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 68#L46-1true, Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2022-12-06 07:45:34,439 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is not cut-off event [2022-12-06 07:45:34,439 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 07:45:34,439 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2022-12-06 07:45:34,439 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 07:45:34,443 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][33], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 145#true, 80#L53true, 63#L99-4true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 104#(= ~N~0 ~L~0), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 105#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2022-12-06 07:45:34,443 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:34,443 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:45:34,443 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:34,443 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:34,443 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:34,443 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][35], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 145#true, 63#L99-4true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, 6#L72true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 104#(= ~N~0 ~L~0), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 105#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 68#L46-1true, Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2022-12-06 07:45:34,444 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:34,444 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:34,444 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:34,444 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:45:34,444 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:34,449 INFO L130 PetriNetUnfolder]: 128/310 cut-off events. [2022-12-06 07:45:34,449 INFO L131 PetriNetUnfolder]: For 743/854 co-relation queries the response was YES. [2022-12-06 07:45:34,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 310 events. 128/310 cut-off events. For 743/854 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1539 event pairs, 8 based on Foata normal form. 26/323 useless extension candidates. Maximal degree in co-relation 1079. Up to 138 conditions per place. [2022-12-06 07:45:34,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 52 transitions, 432 flow [2022-12-06 07:45:34,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-06 07:45:34,454 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:34,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 07:45:34,456 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 432 flow [2022-12-06 07:45:34,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:34,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:34,456 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:34,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:45:34,456 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:34,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:34,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1489845740, now seen corresponding path program 2 times [2022-12-06 07:45:34,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:34,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975109252] [2022-12-06 07:45:34,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:34,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:34,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:34,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975109252] [2022-12-06 07:45:34,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975109252] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:34,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041657027] [2022-12-06 07:45:34,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:45:34,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:34,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:34,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:45:34,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:45:34,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:45:34,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:45:34,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:45:34,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:34,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:34,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041657027] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:34,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:34,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 07:45:34,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184470433] [2022-12-06 07:45:34,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:34,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:45:34,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:34,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:45:34,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:45:34,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:45:34,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 432 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:34,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:34,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:45:34,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:35,270 INFO L130 PetriNetUnfolder]: 1535/2356 cut-off events. [2022-12-06 07:45:35,271 INFO L131 PetriNetUnfolder]: For 9451/9451 co-relation queries the response was YES. [2022-12-06 07:45:35,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10368 conditions, 2356 events. 1535/2356 cut-off events. For 9451/9451 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11256 event pairs, 108 based on Foata normal form. 30/2380 useless extension candidates. Maximal degree in co-relation 8966. Up to 1088 conditions per place. [2022-12-06 07:45:35,291 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 108 selfloop transitions, 54 changer transitions 4/166 dead transitions. [2022-12-06 07:45:35,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 166 transitions, 1526 flow [2022-12-06 07:45:35,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:45:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:45:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-12-06 07:45:35,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3964285714285714 [2022-12-06 07:45:35,293 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 432 flow. Second operand 10 states and 111 transitions. [2022-12-06 07:45:35,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 166 transitions, 1526 flow [2022-12-06 07:45:35,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 166 transitions, 1466 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:35,323 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 972 flow [2022-12-06 07:45:35,324 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=972, PETRI_PLACES=64, PETRI_TRANSITIONS=91} [2022-12-06 07:45:35,324 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2022-12-06 07:45:35,324 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:35,324 INFO L89 Accepts]: Start accepts. Operand has 64 places, 91 transitions, 972 flow [2022-12-06 07:45:35,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:35,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:35,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 91 transitions, 972 flow [2022-12-06 07:45:35,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 91 transitions, 972 flow [2022-12-06 07:45:35,351 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][49], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 63#L99-4true, 137#true, 80#L53true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, 159#true, Black: 104#(= ~N~0 ~L~0), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 278#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 280#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2022-12-06 07:45:35,352 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is not cut-off event [2022-12-06 07:45:35,352 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2022-12-06 07:45:35,352 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 07:45:35,352 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 07:45:35,352 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][52], [42#L83true, 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 63#L99-4true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, 6#L72true, Black: 104#(= ~N~0 ~L~0), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 278#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 280#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 68#L46-1true, Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2022-12-06 07:45:35,353 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is not cut-off event [2022-12-06 07:45:35,353 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2022-12-06 07:45:35,353 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 07:45:35,353 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 07:45:35,359 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][58], [26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 137#true, 80#L53true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 63#L99-4true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 6#L72true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 104#(= ~N~0 ~L~0), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 278#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 280#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2022-12-06 07:45:35,359 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:35,359 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:35,359 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:35,359 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:35,365 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][49], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 63#L99-4true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 80#L53true, 102#true, 159#true, Black: 104#(= ~N~0 ~L~0), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 278#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 280#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1)]) [2022-12-06 07:45:35,366 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:35,366 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:35,366 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:35,366 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:35,366 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:35,366 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][52], [42#L83true, 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 63#L99-4true, 137#true, 6#L72true, 102#true, Black: 104#(= ~N~0 ~L~0), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 278#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), 68#L46-1true, Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 280#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1)]) [2022-12-06 07:45:35,366 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:35,366 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:35,366 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:35,366 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:35,366 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:35,377 INFO L130 PetriNetUnfolder]: 246/549 cut-off events. [2022-12-06 07:45:35,378 INFO L131 PetriNetUnfolder]: For 2514/2667 co-relation queries the response was YES. [2022-12-06 07:45:35,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2474 conditions, 549 events. 246/549 cut-off events. For 2514/2667 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3001 event pairs, 8 based on Foata normal form. 60/598 useless extension candidates. Maximal degree in co-relation 2324. Up to 232 conditions per place. [2022-12-06 07:45:35,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 91 transitions, 972 flow [2022-12-06 07:45:35,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 566 [2022-12-06 07:45:35,394 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 07:45:35,575 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 07:45:35,727 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 07:45:35,872 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:45:35,916 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:45:35,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 07:45:36,098 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 07:45:36,237 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:45:36,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:45:36,332 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:45:36,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 07:45:36,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 07:45:36,652 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 07:45:36,786 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:45:36,829 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:45:36,874 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:45:36,875 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1551 [2022-12-06 07:45:36,875 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 89 transitions, 1057 flow [2022-12-06 07:45:36,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:36,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:36,875 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:36,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 07:45:37,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:37,076 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:37,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:37,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2129447873, now seen corresponding path program 2 times [2022-12-06 07:45:37,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:37,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126908259] [2022-12-06 07:45:37,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:37,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:37,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:37,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126908259] [2022-12-06 07:45:37,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126908259] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:37,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408273214] [2022-12-06 07:45:37,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:45:37,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:37,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:37,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:45:37,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:45:37,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:45:37,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:45:37,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 07:45:37,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:37,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:37,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408273214] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:37,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:37,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2022-12-06 07:45:37,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432252123] [2022-12-06 07:45:37,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:37,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:45:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:45:37,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:45:37,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:45:37,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 89 transitions, 1057 flow. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:37,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:37,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:45:37,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:39,295 INFO L130 PetriNetUnfolder]: 2740/4183 cut-off events. [2022-12-06 07:45:39,295 INFO L131 PetriNetUnfolder]: For 21786/21786 co-relation queries the response was YES. [2022-12-06 07:45:39,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20467 conditions, 4183 events. 2740/4183 cut-off events. For 21786/21786 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 22051 event pairs, 32 based on Foata normal form. 107/4284 useless extension candidates. Maximal degree in co-relation 18211. Up to 1440 conditions per place. [2022-12-06 07:45:39,338 INFO L137 encePairwiseOnDemand]: 15/43 looper letters, 176 selfloop transitions, 148 changer transitions 52/376 dead transitions. [2022-12-06 07:45:39,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 376 transitions, 3891 flow [2022-12-06 07:45:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 07:45:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 07:45:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 291 transitions. [2022-12-06 07:45:39,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2942366026289181 [2022-12-06 07:45:39,342 INFO L175 Difference]: Start difference. First operand has 62 places, 89 transitions, 1057 flow. Second operand 23 states and 291 transitions. [2022-12-06 07:45:39,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 376 transitions, 3891 flow [2022-12-06 07:45:39,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 376 transitions, 3667 flow, removed 101 selfloop flow, removed 3 redundant places. [2022-12-06 07:45:39,406 INFO L231 Difference]: Finished difference. Result has 96 places, 187 transitions, 2672 flow [2022-12-06 07:45:39,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2672, PETRI_PLACES=96, PETRI_TRANSITIONS=187} [2022-12-06 07:45:39,407 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2022-12-06 07:45:39,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:39,407 INFO L89 Accepts]: Start accepts. Operand has 96 places, 187 transitions, 2672 flow [2022-12-06 07:45:39,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:39,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:39,410 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 187 transitions, 2672 flow [2022-12-06 07:45:39,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 187 transitions, 2672 flow [2022-12-06 07:45:39,451 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][110], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 444#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 380#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 278#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 280#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, 6#L72true, 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 436#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:45:39,451 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:39,451 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:39,452 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:39,452 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:39,463 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][110], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 444#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 137#true, 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 380#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 278#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), 48#L65-1true, Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 280#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 287#true, 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 436#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:45:39,464 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:39,464 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:39,464 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:39,464 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:39,510 INFO L130 PetriNetUnfolder]: 423/913 cut-off events. [2022-12-06 07:45:39,510 INFO L131 PetriNetUnfolder]: For 9115/9744 co-relation queries the response was YES. [2022-12-06 07:45:39,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5415 conditions, 913 events. 423/913 cut-off events. For 9115/9744 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5644 event pairs, 2 based on Foata normal form. 69/966 useless extension candidates. Maximal degree in co-relation 5267. Up to 389 conditions per place. [2022-12-06 07:45:39,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 187 transitions, 2672 flow [2022-12-06 07:45:39,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 1140 [2022-12-06 07:45:39,534 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 07:45:39,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 07:45:39,804 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [254] L65-1-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_7) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_7, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] [2022-12-06 07:45:39,847 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 07:45:39,977 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [254] L65-1-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_7) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_7, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] [2022-12-06 07:45:40,026 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [254] L65-1-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_7) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_7, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] [2022-12-06 07:45:40,133 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [248] $Ultimate##0-->L72: Formula: (= v_thread2Thread1of1ForFork0_~cond~1_1 (ite (= (ite (< 1 (mod v_~N~0_10 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_10} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_1, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] and [340] $Ultimate##0-->L65-1: Formula: (let ((.cse1 (mod v_~N~0_102 4294967296))) (and (let ((.cse0 (< 1 .cse1))) (or (and .cse0 (= v_~N~0_102 (+ v_~N~0_101 2)) (= v_~p~0_89 (+ (* 2 v_~M~0_68) v_~p~0_90))) (and (= v_~p~0_90 v_~p~0_89) (= v_~N~0_102 v_~N~0_101) (not .cse0)))) (= v_thread1Thread1of1ForFork2_~cond~0_37 (ite (= (ite (< 0 .cse1) 1 0) 0) 0 1)) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_25 256) 0)))) InVars {~M~0=v_~M~0_68, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_25, ~p~0=v_~p~0_90, ~N~0=v_~N~0_102} OutVars{~M~0=v_~M~0_68, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_25, ~p~0=v_~p~0_89, ~N~0=v_~N~0_101, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_37} AuxVars[] AssignedVars[~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:45:40,207 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [248] $Ultimate##0-->L72: Formula: (= v_thread2Thread1of1ForFork0_~cond~1_1 (ite (= (ite (< 1 (mod v_~N~0_10 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_10} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_1, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] and [336] $Ultimate##0-->L46-1: Formula: (and (= (+ v_~p~0_86 v_~M~0_64) v_~p~0_85) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_29 256) 0)) (= v_thread1Thread1of1ForFork2_~cond~0_29 (ite (= (ite (< 0 (mod v_~N~0_92 4294967296)) 1 0) 0) 0 1)) (= (+ 1 v_~N~0_91) v_~N~0_92)) InVars {~M~0=v_~M~0_64, ~p~0=v_~p~0_86, ~N~0=v_~N~0_92} OutVars{~M~0=v_~M~0_64, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_19|, ~p~0=v_~p~0_85, ~N~0=v_~N~0_91, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_29} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:45:40,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 07:45:40,469 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:45:40,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1063 [2022-12-06 07:45:40,470 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 184 transitions, 2723 flow [2022-12-06 07:45:40,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:40,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:40,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:40,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:45:40,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 07:45:40,676 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:40,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:40,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1954420314, now seen corresponding path program 1 times [2022-12-06 07:45:40,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:40,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31028319] [2022-12-06 07:45:40,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:40,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:40,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:40,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31028319] [2022-12-06 07:45:40,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31028319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:40,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810336707] [2022-12-06 07:45:40,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:40,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:40,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:40,848 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:45:40,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:45:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:40,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 07:45:40,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:40,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:41,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810336707] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:41,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:41,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 5 [2022-12-06 07:45:41,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183114116] [2022-12-06 07:45:41,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:41,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:45:41,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:41,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:45:41,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:45:41,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2022-12-06 07:45:41,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 184 transitions, 2723 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:41,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:41,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2022-12-06 07:45:41,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:41,748 INFO L130 PetriNetUnfolder]: 2637/4121 cut-off events. [2022-12-06 07:45:41,748 INFO L131 PetriNetUnfolder]: For 41590/41914 co-relation queries the response was YES. [2022-12-06 07:45:41,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25616 conditions, 4121 events. 2637/4121 cut-off events. For 41590/41914 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 22859 event pairs, 295 based on Foata normal form. 180/4232 useless extension candidates. Maximal degree in co-relation 25135. Up to 3178 conditions per place. [2022-12-06 07:45:41,791 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 161 selfloop transitions, 46 changer transitions 1/249 dead transitions. [2022-12-06 07:45:41,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 249 transitions, 3819 flow [2022-12-06 07:45:41,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-06 07:45:41,793 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-06 07:45:41,793 INFO L175 Difference]: Start difference. First operand has 89 places, 184 transitions, 2723 flow. Second operand 5 states and 105 transitions. [2022-12-06 07:45:41,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 249 transitions, 3819 flow [2022-12-06 07:45:41,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 249 transitions, 3540 flow, removed 135 selfloop flow, removed 5 redundant places. [2022-12-06 07:45:41,992 INFO L231 Difference]: Finished difference. Result has 90 places, 221 transitions, 3193 flow [2022-12-06 07:45:41,992 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2494, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3193, PETRI_PLACES=90, PETRI_TRANSITIONS=221} [2022-12-06 07:45:41,993 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2022-12-06 07:45:41,993 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:41,993 INFO L89 Accepts]: Start accepts. Operand has 90 places, 221 transitions, 3193 flow [2022-12-06 07:45:41,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:41,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:41,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 221 transitions, 3193 flow [2022-12-06 07:45:41,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 221 transitions, 3193 flow [2022-12-06 07:45:42,045 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][94], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 137#true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 287#true, 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, Black: 104#(= ~N~0 ~L~0), 460#true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 436#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:42,045 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:45:42,046 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:45:42,046 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:42,046 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:45:42,049 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][94], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, 6#L72true, 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 436#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:45:42,049 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:45:42,049 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:42,049 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:42,049 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:42,054 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][94], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 137#true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 287#true, 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, 6#L72true, Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 436#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:45:42,054 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:42,054 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:42,055 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:42,055 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:42,092 INFO L130 PetriNetUnfolder]: 465/1005 cut-off events. [2022-12-06 07:45:42,092 INFO L131 PetriNetUnfolder]: For 9727/10611 co-relation queries the response was YES. [2022-12-06 07:45:42,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5940 conditions, 1005 events. 465/1005 cut-off events. For 9727/10611 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6305 event pairs, 5 based on Foata normal form. 71/1048 useless extension candidates. Maximal degree in co-relation 5648. Up to 369 conditions per place. [2022-12-06 07:45:42,106 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 221 transitions, 3193 flow [2022-12-06 07:45:42,106 INFO L188 LiptonReduction]: Number of co-enabled transitions 1326 [2022-12-06 07:45:42,108 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:42,108 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-06 07:45:42,108 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 221 transitions, 3193 flow [2022-12-06 07:45:42,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:42,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:42,109 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:42,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 07:45:42,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:42,314 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:42,314 INFO L85 PathProgramCache]: Analyzing trace with hash -946661476, now seen corresponding path program 1 times [2022-12-06 07:45:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:42,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517885728] [2022-12-06 07:45:42,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:42,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:42,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:42,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517885728] [2022-12-06 07:45:42,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517885728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:42,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:42,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:45:42,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251471025] [2022-12-06 07:45:42,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:42,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:45:42,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:42,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:45:42,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:45:42,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:45:42,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 221 transitions, 3193 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:42,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:42,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:45:42,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:43,223 INFO L130 PetriNetUnfolder]: 3303/4994 cut-off events. [2022-12-06 07:45:43,223 INFO L131 PetriNetUnfolder]: For 47688/47688 co-relation queries the response was YES. [2022-12-06 07:45:43,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30498 conditions, 4994 events. 3303/4994 cut-off events. For 47688/47688 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 26710 event pairs, 524 based on Foata normal form. 10/5004 useless extension candidates. Maximal degree in co-relation 29260. Up to 4720 conditions per place. [2022-12-06 07:45:43,263 INFO L137 encePairwiseOnDemand]: 35/51 looper letters, 235 selfloop transitions, 35 changer transitions 4/274 dead transitions. [2022-12-06 07:45:43,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 274 transitions, 4254 flow [2022-12-06 07:45:43,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 07:45:43,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34509803921568627 [2022-12-06 07:45:43,264 INFO L175 Difference]: Start difference. First operand has 90 places, 221 transitions, 3193 flow. Second operand 5 states and 88 transitions. [2022-12-06 07:45:43,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 274 transitions, 4254 flow [2022-12-06 07:45:43,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 274 transitions, 4145 flow, removed 50 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:43,428 INFO L231 Difference]: Finished difference. Result has 94 places, 247 transitions, 3599 flow [2022-12-06 07:45:43,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3084, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3599, PETRI_PLACES=94, PETRI_TRANSITIONS=247} [2022-12-06 07:45:43,429 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 64 predicate places. [2022-12-06 07:45:43,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:43,429 INFO L89 Accepts]: Start accepts. Operand has 94 places, 247 transitions, 3599 flow [2022-12-06 07:45:43,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:43,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:43,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 247 transitions, 3599 flow [2022-12-06 07:45:43,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 247 transitions, 3599 flow [2022-12-06 07:45:43,485 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][108], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 63#L99-4true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 137#true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 287#true, 26#thread3EXITtrue, 577#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, Black: 104#(= ~N~0 ~L~0), 460#true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:43,485 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:45:43,485 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:45:43,485 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:43,486 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:45:43,492 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][108], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 63#L99-4true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 287#true, 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 80#L53true, 6#L72true, Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:43,492 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:43,492 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:43,492 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:43,492 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:43,496 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][108], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 63#L99-4true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, 577#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, 6#L72true, 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:43,496 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:45:43,496 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:43,496 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:43,496 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:43,541 INFO L130 PetriNetUnfolder]: 493/1079 cut-off events. [2022-12-06 07:45:43,541 INFO L131 PetriNetUnfolder]: For 9870/10750 co-relation queries the response was YES. [2022-12-06 07:45:43,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6411 conditions, 1079 events. 493/1079 cut-off events. For 9870/10750 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6996 event pairs, 5 based on Foata normal form. 76/1127 useless extension candidates. Maximal degree in co-relation 6101. Up to 331 conditions per place. [2022-12-06 07:45:43,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 247 transitions, 3599 flow [2022-12-06 07:45:43,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 1474 [2022-12-06 07:45:43,559 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:43,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-06 07:45:43,560 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 247 transitions, 3599 flow [2022-12-06 07:45:43,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:43,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:43,560 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:43,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:45:43,560 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:43,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash -795023675, now seen corresponding path program 1 times [2022-12-06 07:45:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:43,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372105382] [2022-12-06 07:45:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:43,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:43,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:43,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372105382] [2022-12-06 07:45:43,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372105382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:43,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927751466] [2022-12-06 07:45:43,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:43,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:43,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:43,776 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:45:43,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:45:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:43,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 07:45:43,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:43,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:44,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927751466] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:44,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:44,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 07:45:44,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848711746] [2022-12-06 07:45:44,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:44,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:45:44,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:44,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:45:44,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:45:44,160 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:45:44,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 247 transitions, 3599 flow. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:44,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:44,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:45:44,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:45,216 INFO L130 PetriNetUnfolder]: 4021/6144 cut-off events. [2022-12-06 07:45:45,216 INFO L131 PetriNetUnfolder]: For 59000/59000 co-relation queries the response was YES. [2022-12-06 07:45:45,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38549 conditions, 6144 events. 4021/6144 cut-off events. For 59000/59000 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 34564 event pairs, 486 based on Foata normal form. 8/6152 useless extension candidates. Maximal degree in co-relation 35503. Up to 4379 conditions per place. [2022-12-06 07:45:45,330 INFO L137 encePairwiseOnDemand]: 17/51 looper letters, 234 selfloop transitions, 169 changer transitions 5/408 dead transitions. [2022-12-06 07:45:45,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 408 transitions, 6374 flow [2022-12-06 07:45:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:45:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:45:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2022-12-06 07:45:45,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-06 07:45:45,332 INFO L175 Difference]: Start difference. First operand has 94 places, 247 transitions, 3599 flow. Second operand 8 states and 119 transitions. [2022-12-06 07:45:45,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 408 transitions, 6374 flow [2022-12-06 07:45:45,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 408 transitions, 6307 flow, removed 29 selfloop flow, removed 1 redundant places. [2022-12-06 07:45:45,581 INFO L231 Difference]: Finished difference. Result has 103 places, 328 transitions, 5362 flow [2022-12-06 07:45:45,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3532, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5362, PETRI_PLACES=103, PETRI_TRANSITIONS=328} [2022-12-06 07:45:45,583 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2022-12-06 07:45:45,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:45,583 INFO L89 Accepts]: Start accepts. Operand has 103 places, 328 transitions, 5362 flow [2022-12-06 07:45:45,585 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:45,585 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:45,585 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 328 transitions, 5362 flow [2022-12-06 07:45:45,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 328 transitions, 5362 flow [2022-12-06 07:45:45,630 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][119], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 137#true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 287#true, 26#thread3EXITtrue, 577#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, Black: 104#(= ~N~0 ~L~0), 460#true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:45,630 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,630 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:45:45,630 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:45:45,631 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,636 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][119], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 287#true, 26#thread3EXITtrue, 577#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, 6#L72true, Black: 104#(= ~N~0 ~L~0), 460#true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:45,636 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,636 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,636 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,636 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,637 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][98], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 137#true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 287#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 80#L53true, 159#true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:45,637 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,637 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,637 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,637 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,638 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][119], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 287#true, 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 80#L53true, 6#L72true, Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:45,638 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,638 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,638 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,638 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,638 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,638 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][38], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 137#true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 68#L46-1true, Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 287#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 6#L72true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:45,638 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,639 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,639 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,639 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,645 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][119], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, 577#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, 6#L72true, 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:45,645 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,646 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:45,646 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,646 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,651 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][142], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 287#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 80#L53true, 159#true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:45,651 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,651 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,651 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:45,651 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,651 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][145], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), 68#L46-1true, Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 287#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 6#L72true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:45,651 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,651 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,651 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,651 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:45,652 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][119], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 80#L53true, 6#L72true, 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:45,653 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,653 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,653 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:45,653 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,653 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,653 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][151], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 80#L53true, 159#true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:45,653 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,653 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,653 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,653 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:45,653 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][148], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), 68#L46-1true, Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 6#L72true, Black: 104#(= ~N~0 ~L~0), 460#true, 586#true, 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:45,653 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,653 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:45,653 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,654 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,661 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][48], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 580#(= ~L~0 (+ 2 ~N~0)), 102#true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 287#true, 9#thread1EXITtrue, 577#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:45,662 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:45,662 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:45,662 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:45,662 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,672 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][207], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 287#true, 9#thread1EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:45,672 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:45,672 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,672 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:45,672 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:45:45,673 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][233], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 07:45:45,673 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:45,673 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:45,673 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:45,673 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:45:45,708 INFO L130 PetriNetUnfolder]: 610/1385 cut-off events. [2022-12-06 07:45:45,709 INFO L131 PetriNetUnfolder]: For 15549/16317 co-relation queries the response was YES. [2022-12-06 07:45:45,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8789 conditions, 1385 events. 610/1385 cut-off events. For 15549/16317 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9669 event pairs, 5 based on Foata normal form. 90/1444 useless extension candidates. Maximal degree in co-relation 8362. Up to 439 conditions per place. [2022-12-06 07:45:45,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 328 transitions, 5362 flow [2022-12-06 07:45:45,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 1792 [2022-12-06 07:45:45,725 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] $Ultimate##0-->L83: Formula: (and (= v_thread1Thread1of1ForFork2_~cond~0_35 (ite (= 0 (ite (< 0 (mod v_~N~0_99 4294967296)) 1 0)) 0 1)) (< 0 (mod v_~L~0_57 4294967296)) (= v_~q~0_43 (+ v_~q~0_44 v_~M~0_66)) (= (+ v_~L~0_56 1) v_~L~0_57)) InVars {~M~0=v_~M~0_66, ~L~0=v_~L~0_57, ~q~0=v_~q~0_44, ~N~0=v_~N~0_99} OutVars{~M~0=v_~M~0_66, ~L~0=v_~L~0_56, ~q~0=v_~q~0_43, ~N~0=v_~N~0_99, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_7|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_35} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 07:45:45,812 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] $Ultimate##0-->L83: Formula: (and (= v_thread1Thread1of1ForFork2_~cond~0_35 (ite (= 0 (ite (< 0 (mod v_~N~0_99 4294967296)) 1 0)) 0 1)) (< 0 (mod v_~L~0_57 4294967296)) (= v_~q~0_43 (+ v_~q~0_44 v_~M~0_66)) (= (+ v_~L~0_56 1) v_~L~0_57)) InVars {~M~0=v_~M~0_66, ~L~0=v_~L~0_57, ~q~0=v_~q~0_44, ~N~0=v_~N~0_99} OutVars{~M~0=v_~M~0_66, ~L~0=v_~L~0_56, ~q~0=v_~q~0_43, ~N~0=v_~N~0_99, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_7|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_35} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [248] $Ultimate##0-->L72: Formula: (= v_thread2Thread1of1ForFork0_~cond~1_1 (ite (= (ite (< 1 (mod v_~N~0_10 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_10} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_1, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] [2022-12-06 07:45:45,849 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:45,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-06 07:45:45,850 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 328 transitions, 5388 flow [2022-12-06 07:45:45,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:45,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:45,850 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:45,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:45:46,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:46,056 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:46,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:46,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1554296755, now seen corresponding path program 1 times [2022-12-06 07:45:46,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:46,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223714609] [2022-12-06 07:45:46,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:46,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:45:46,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:46,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223714609] [2022-12-06 07:45:46,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223714609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:46,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:46,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:45:46,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480129074] [2022-12-06 07:45:46,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:46,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:46,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:46,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:46,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:46,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:45:46,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 328 transitions, 5388 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:46,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:46,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:45:46,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:47,118 INFO L130 PetriNetUnfolder]: 4259/6501 cut-off events. [2022-12-06 07:45:47,119 INFO L131 PetriNetUnfolder]: For 93004/93004 co-relation queries the response was YES. [2022-12-06 07:45:47,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43544 conditions, 6501 events. 4259/6501 cut-off events. For 93004/93004 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 37144 event pairs, 712 based on Foata normal form. 272/6773 useless extension candidates. Maximal degree in co-relation 40891. Up to 5101 conditions per place. [2022-12-06 07:45:47,223 INFO L137 encePairwiseOnDemand]: 29/53 looper letters, 352 selfloop transitions, 45 changer transitions 0/397 dead transitions. [2022-12-06 07:45:47,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 397 transitions, 6883 flow [2022-12-06 07:45:47,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:45:47,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:45:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-06 07:45:47,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4528301886792453 [2022-12-06 07:45:47,224 INFO L175 Difference]: Start difference. First operand has 103 places, 328 transitions, 5388 flow. Second operand 4 states and 96 transitions. [2022-12-06 07:45:47,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 397 transitions, 6883 flow [2022-12-06 07:45:47,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 397 transitions, 6391 flow, removed 195 selfloop flow, removed 6 redundant places. [2022-12-06 07:45:47,520 INFO L231 Difference]: Finished difference. Result has 99 places, 318 transitions, 4935 flow [2022-12-06 07:45:47,520 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=4339, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4935, PETRI_PLACES=99, PETRI_TRANSITIONS=318} [2022-12-06 07:45:47,521 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2022-12-06 07:45:47,521 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:47,521 INFO L89 Accepts]: Start accepts. Operand has 99 places, 318 transitions, 4935 flow [2022-12-06 07:45:47,522 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:47,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:47,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 318 transitions, 4935 flow [2022-12-06 07:45:47,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 318 transitions, 4935 flow [2022-12-06 07:45:47,622 INFO L130 PetriNetUnfolder]: 565/1366 cut-off events. [2022-12-06 07:45:47,622 INFO L131 PetriNetUnfolder]: For 11987/12435 co-relation queries the response was YES. [2022-12-06 07:45:47,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7981 conditions, 1366 events. 565/1366 cut-off events. For 11987/12435 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9967 event pairs, 6 based on Foata normal form. 61/1399 useless extension candidates. Maximal degree in co-relation 7548. Up to 412 conditions per place. [2022-12-06 07:45:47,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 318 transitions, 4935 flow [2022-12-06 07:45:47,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 1788 [2022-12-06 07:45:47,636 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:47,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-06 07:45:47,636 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 318 transitions, 4935 flow [2022-12-06 07:45:47,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:47,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:47,637 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:47,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:45:47,637 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:47,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:47,637 INFO L85 PathProgramCache]: Analyzing trace with hash -770404099, now seen corresponding path program 1 times [2022-12-06 07:45:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:47,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886536063] [2022-12-06 07:45:47,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:47,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:47,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:47,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886536063] [2022-12-06 07:45:47,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886536063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:47,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:47,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:47,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888287976] [2022-12-06 07:45:47,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:47,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:45:47,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:47,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:45:47,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:47,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:45:47,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 318 transitions, 4935 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:47,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:47,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:45:47,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:49,381 INFO L130 PetriNetUnfolder]: 5544/8572 cut-off events. [2022-12-06 07:45:49,381 INFO L131 PetriNetUnfolder]: For 98405/98405 co-relation queries the response was YES. [2022-12-06 07:45:49,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54461 conditions, 8572 events. 5544/8572 cut-off events. For 98405/98405 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 52412 event pairs, 539 based on Foata normal form. 76/8648 useless extension candidates. Maximal degree in co-relation 51211. Up to 3923 conditions per place. [2022-12-06 07:45:49,465 INFO L137 encePairwiseOnDemand]: 16/45 looper letters, 548 selfloop transitions, 135 changer transitions 0/683 dead transitions. [2022-12-06 07:45:49,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 683 transitions, 11075 flow [2022-12-06 07:45:49,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:45:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:45:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2022-12-06 07:45:49,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3656565656565657 [2022-12-06 07:45:49,469 INFO L175 Difference]: Start difference. First operand has 99 places, 318 transitions, 4935 flow. Second operand 11 states and 181 transitions. [2022-12-06 07:45:49,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 683 transitions, 11075 flow [2022-12-06 07:45:49,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 683 transitions, 11011 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 07:45:49,819 INFO L231 Difference]: Finished difference. Result has 113 places, 406 transitions, 6797 flow [2022-12-06 07:45:49,819 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4880, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6797, PETRI_PLACES=113, PETRI_TRANSITIONS=406} [2022-12-06 07:45:49,820 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places. [2022-12-06 07:45:49,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:49,820 INFO L89 Accepts]: Start accepts. Operand has 113 places, 406 transitions, 6797 flow [2022-12-06 07:45:49,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:49,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:49,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 406 transitions, 6797 flow [2022-12-06 07:45:49,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 406 transitions, 6797 flow [2022-12-06 07:45:49,992 INFO L130 PetriNetUnfolder]: 869/2028 cut-off events. [2022-12-06 07:45:49,993 INFO L131 PetriNetUnfolder]: For 25554/26215 co-relation queries the response was YES. [2022-12-06 07:45:49,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13035 conditions, 2028 events. 869/2028 cut-off events. For 25554/26215 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 15831 event pairs, 8 based on Foata normal form. 100/2091 useless extension candidates. Maximal degree in co-relation 12414. Up to 582 conditions per place. [2022-12-06 07:45:50,014 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 406 transitions, 6797 flow [2022-12-06 07:45:50,014 INFO L188 LiptonReduction]: Number of co-enabled transitions 2210 [2022-12-06 07:45:50,017 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 07:45:50,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [339] $Ultimate##0-->L83: Formula: (and (= v_thread1Thread1of1ForFork2_~cond~0_35 (ite (= 0 (ite (< 0 (mod v_~N~0_99 4294967296)) 1 0)) 0 1)) (< 0 (mod v_~L~0_57 4294967296)) (= v_~q~0_43 (+ v_~q~0_44 v_~M~0_66)) (= (+ v_~L~0_56 1) v_~L~0_57)) InVars {~M~0=v_~M~0_66, ~L~0=v_~L~0_57, ~q~0=v_~q~0_44, ~N~0=v_~N~0_99} OutVars{~M~0=v_~M~0_66, ~L~0=v_~L~0_56, ~q~0=v_~q~0_43, ~N~0=v_~N~0_99, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_7|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_35} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:45:50,202 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 07:45:50,327 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 07:45:50,386 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [349] L83-->L53: Formula: (and (= v_thread1Thread1of1ForFork2_~cond~0_59 (ite (= (ite (< 0 (mod v_~N~0_149 4294967296)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork1_#res.offset_33| 0) (= |v_thread3Thread1of1ForFork1_#res.base_33| 0) (not (< 0 (mod v_~L~0_79 4294967296)))) InVars {~L~0=v_~L~0_79, ~N~0=v_~N~0_149} OutVars{~L~0=v_~L~0_79, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_33|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_33|, ~N~0=v_~N~0_149, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:45:50,538 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [248] $Ultimate##0-->L72: Formula: (= v_thread2Thread1of1ForFork0_~cond~1_1 (ite (= (ite (< 1 (mod v_~N~0_10 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_10} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_1, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] and [339] $Ultimate##0-->L83: Formula: (and (= v_thread1Thread1of1ForFork2_~cond~0_35 (ite (= 0 (ite (< 0 (mod v_~N~0_99 4294967296)) 1 0)) 0 1)) (< 0 (mod v_~L~0_57 4294967296)) (= v_~q~0_43 (+ v_~q~0_44 v_~M~0_66)) (= (+ v_~L~0_56 1) v_~L~0_57)) InVars {~M~0=v_~M~0_66, ~L~0=v_~L~0_57, ~q~0=v_~q~0_44, ~N~0=v_~N~0_99} OutVars{~M~0=v_~M~0_66, ~L~0=v_~L~0_56, ~q~0=v_~q~0_43, ~N~0=v_~N~0_99, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_7|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_35} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:45:50,627 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [248] $Ultimate##0-->L72: Formula: (= v_thread2Thread1of1ForFork0_~cond~1_1 (ite (= (ite (< 1 (mod v_~N~0_10 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_10} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_1, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 07:45:50,658 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:45:50,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 839 [2022-12-06 07:45:50,659 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 406 transitions, 6832 flow [2022-12-06 07:45:50,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:50,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:50,660 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:50,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:45:50,660 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:50,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1411093443, now seen corresponding path program 2 times [2022-12-06 07:45:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:50,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717542723] [2022-12-06 07:45:50,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:50,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:50,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:50,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717542723] [2022-12-06 07:45:50,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717542723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:50,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:50,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669032420] [2022-12-06 07:45:50,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:50,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:45:50,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:50,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:45:50,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:50,858 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 07:45:50,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 406 transitions, 6832 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:50,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:50,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 07:45:50,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:52,625 INFO L130 PetriNetUnfolder]: 6335/9912 cut-off events. [2022-12-06 07:45:52,625 INFO L131 PetriNetUnfolder]: For 141093/141093 co-relation queries the response was YES. [2022-12-06 07:45:52,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69212 conditions, 9912 events. 6335/9912 cut-off events. For 141093/141093 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 63483 event pairs, 663 based on Foata normal form. 82/9994 useless extension candidates. Maximal degree in co-relation 65535. Up to 5652 conditions per place. [2022-12-06 07:45:52,699 INFO L137 encePairwiseOnDemand]: 16/52 looper letters, 472 selfloop transitions, 164 changer transitions 7/643 dead transitions. [2022-12-06 07:45:52,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 643 transitions, 11386 flow [2022-12-06 07:45:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:45:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:45:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2022-12-06 07:45:52,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-06 07:45:52,701 INFO L175 Difference]: Start difference. First operand has 113 places, 406 transitions, 6832 flow. Second operand 8 states and 169 transitions. [2022-12-06 07:45:52,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 643 transitions, 11386 flow [2022-12-06 07:45:53,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 643 transitions, 11280 flow, removed 53 selfloop flow, removed 0 redundant places. [2022-12-06 07:45:53,250 INFO L231 Difference]: Finished difference. Result has 123 places, 453 transitions, 8098 flow [2022-12-06 07:45:53,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=6678, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8098, PETRI_PLACES=123, PETRI_TRANSITIONS=453} [2022-12-06 07:45:53,250 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 93 predicate places. [2022-12-06 07:45:53,251 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:53,251 INFO L89 Accepts]: Start accepts. Operand has 123 places, 453 transitions, 8098 flow [2022-12-06 07:45:53,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:53,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:53,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 453 transitions, 8098 flow [2022-12-06 07:45:53,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 453 transitions, 8098 flow [2022-12-06 07:45:53,475 INFO L130 PetriNetUnfolder]: 1039/2439 cut-off events. [2022-12-06 07:45:53,476 INFO L131 PetriNetUnfolder]: For 35730/36463 co-relation queries the response was YES. [2022-12-06 07:45:53,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16917 conditions, 2439 events. 1039/2439 cut-off events. For 35730/36463 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 19908 event pairs, 13 based on Foata normal form. 116/2513 useless extension candidates. Maximal degree in co-relation 16166. Up to 717 conditions per place. [2022-12-06 07:45:53,502 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 453 transitions, 8098 flow [2022-12-06 07:45:53,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 2482 [2022-12-06 07:45:53,505 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 07:45:53,564 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:53,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-06 07:45:53,565 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 453 transitions, 8101 flow [2022-12-06 07:45:53,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:53,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:53,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:53,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:45:53,566 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:53,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:53,566 INFO L85 PathProgramCache]: Analyzing trace with hash -803092475, now seen corresponding path program 1 times [2022-12-06 07:45:53,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:53,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062378723] [2022-12-06 07:45:53,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:53,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:53,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:53,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062378723] [2022-12-06 07:45:53,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062378723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:53,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:53,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:45:53,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687762342] [2022-12-06 07:45:53,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:53,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:45:53,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:53,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:45:53,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:45:53,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:45:53,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 453 transitions, 8101 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:53,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:53,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:45:53,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:55,776 INFO L130 PetriNetUnfolder]: 6906/10762 cut-off events. [2022-12-06 07:45:55,776 INFO L131 PetriNetUnfolder]: For 190435/190435 co-relation queries the response was YES. [2022-12-06 07:45:55,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80687 conditions, 10762 events. 6906/10762 cut-off events. For 190435/190435 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 69657 event pairs, 834 based on Foata normal form. 66/10826 useless extension candidates. Maximal degree in co-relation 76792. Up to 7686 conditions per place. [2022-12-06 07:45:55,841 INFO L137 encePairwiseOnDemand]: 23/53 looper letters, 444 selfloop transitions, 174 changer transitions 0/618 dead transitions. [2022-12-06 07:45:55,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 618 transitions, 11928 flow [2022-12-06 07:45:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:45:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:45:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2022-12-06 07:45:55,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30660377358490565 [2022-12-06 07:45:55,842 INFO L175 Difference]: Start difference. First operand has 122 places, 453 transitions, 8101 flow. Second operand 8 states and 130 transitions. [2022-12-06 07:45:55,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 618 transitions, 11928 flow [2022-12-06 07:45:56,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 618 transitions, 11798 flow, removed 42 selfloop flow, removed 1 redundant places. [2022-12-06 07:45:56,429 INFO L231 Difference]: Finished difference. Result has 132 places, 499 transitions, 9453 flow [2022-12-06 07:45:56,430 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=7994, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9453, PETRI_PLACES=132, PETRI_TRANSITIONS=499} [2022-12-06 07:45:56,430 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 102 predicate places. [2022-12-06 07:45:56,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:56,430 INFO L89 Accepts]: Start accepts. Operand has 132 places, 499 transitions, 9453 flow [2022-12-06 07:45:56,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:56,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:56,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 499 transitions, 9453 flow [2022-12-06 07:45:56,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 499 transitions, 9453 flow [2022-12-06 07:45:56,705 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][327], [Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 65#thread2EXITtrue, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, 80#L53true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:45:56,705 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 07:45:56,705 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:45:56,705 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:56,705 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:56,706 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][28], [Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 65#thread2EXITtrue, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 586#true, 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 68#L46-1true, Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:45:56,706 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 07:45:56,706 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:45:56,706 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:56,706 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:56,747 INFO L130 PetriNetUnfolder]: 1186/2709 cut-off events. [2022-12-06 07:45:56,747 INFO L131 PetriNetUnfolder]: For 45074/45896 co-relation queries the response was YES. [2022-12-06 07:45:56,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20219 conditions, 2709 events. 1186/2709 cut-off events. For 45074/45896 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 22087 event pairs, 18 based on Foata normal form. 137/2796 useless extension candidates. Maximal degree in co-relation 19430. Up to 796 conditions per place. [2022-12-06 07:45:56,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 499 transitions, 9453 flow [2022-12-06 07:45:56,778 INFO L188 LiptonReduction]: Number of co-enabled transitions 2636 [2022-12-06 07:45:56,782 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [368] $Ultimate##0-->L46-1: Formula: (and (= (+ v_~L~0_111 1) v_~L~0_112) (= v_~q~0_52 (+ v_~M~0_110 v_~q~0_53)) (= v_thread1Thread1of1ForFork2_~cond~0_91 (ite (= (ite (< 0 (mod v_~N~0_215 4294967296)) 1 0) 0) 0 1)) (< 0 (mod v_~L~0_112 4294967296)) (= v_~p~0_179 (+ v_~M~0_110 v_~p~0_180)) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_91 256) 0)) (= v_~N~0_215 (+ v_~N~0_214 1))) InVars {~M~0=v_~M~0_110, ~L~0=v_~L~0_112, ~q~0=v_~q~0_53, ~p~0=v_~p~0_180, ~N~0=v_~N~0_215} OutVars{~M~0=v_~M~0_110, ~L~0=v_~L~0_111, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_64|, ~q~0=v_~q~0_52, ~p~0=v_~p~0_179, ~N~0=v_~N~0_214, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_16|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_91} AuxVars[] AssignedVars[~L~0, thread1Thread1of1ForFork2_#t~post1, ~q~0, ~p~0, ~N~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [349] L83-->L53: Formula: (and (= v_thread1Thread1of1ForFork2_~cond~0_59 (ite (= (ite (< 0 (mod v_~N~0_149 4294967296)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork1_#res.offset_33| 0) (= |v_thread3Thread1of1ForFork1_#res.base_33| 0) (not (< 0 (mod v_~L~0_79 4294967296)))) InVars {~L~0=v_~L~0_79, ~N~0=v_~N~0_149} OutVars{~L~0=v_~L~0_79, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_33|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_33|, ~N~0=v_~N~0_149, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:45:56,905 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [368] $Ultimate##0-->L46-1: Formula: (and (= (+ v_~L~0_111 1) v_~L~0_112) (= v_~q~0_52 (+ v_~M~0_110 v_~q~0_53)) (= v_thread1Thread1of1ForFork2_~cond~0_91 (ite (= (ite (< 0 (mod v_~N~0_215 4294967296)) 1 0) 0) 0 1)) (< 0 (mod v_~L~0_112 4294967296)) (= v_~p~0_179 (+ v_~M~0_110 v_~p~0_180)) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_91 256) 0)) (= v_~N~0_215 (+ v_~N~0_214 1))) InVars {~M~0=v_~M~0_110, ~L~0=v_~L~0_112, ~q~0=v_~q~0_53, ~p~0=v_~p~0_180, ~N~0=v_~N~0_215} OutVars{~M~0=v_~M~0_110, ~L~0=v_~L~0_111, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_64|, ~q~0=v_~q~0_52, ~p~0=v_~p~0_179, ~N~0=v_~N~0_214, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_16|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_91} AuxVars[] AssignedVars[~L~0, thread1Thread1of1ForFork2_#t~post1, ~q~0, ~p~0, ~N~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 07:45:56,990 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:56,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 561 [2022-12-06 07:45:56,991 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 499 transitions, 9469 flow [2022-12-06 07:45:56,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:56,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:56,991 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:56,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 07:45:56,991 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:56,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1927942813, now seen corresponding path program 3 times [2022-12-06 07:45:56,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:56,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330893840] [2022-12-06 07:45:56,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:56,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:57,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:57,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330893840] [2022-12-06 07:45:57,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330893840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:57,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:57,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:57,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190182421] [2022-12-06 07:45:57,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:57,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:45:57,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:57,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:45:57,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:57,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 07:45:57,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 499 transitions, 9469 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:57,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:57,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 07:45:57,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:59,232 INFO L130 PetriNetUnfolder]: 6770/10520 cut-off events. [2022-12-06 07:45:59,233 INFO L131 PetriNetUnfolder]: For 195490/195490 co-relation queries the response was YES. [2022-12-06 07:45:59,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81775 conditions, 10520 events. 6770/10520 cut-off events. For 195490/195490 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 67300 event pairs, 711 based on Foata normal form. 68/10586 useless extension candidates. Maximal degree in co-relation 77555. Up to 4305 conditions per place. [2022-12-06 07:45:59,306 INFO L137 encePairwiseOnDemand]: 16/55 looper letters, 538 selfloop transitions, 147 changer transitions 2/687 dead transitions. [2022-12-06 07:45:59,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 687 transitions, 13398 flow [2022-12-06 07:45:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:45:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:45:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2022-12-06 07:45:59,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35909090909090907 [2022-12-06 07:45:59,314 INFO L175 Difference]: Start difference. First operand has 132 places, 499 transitions, 9469 flow. Second operand 8 states and 158 transitions. [2022-12-06 07:45:59,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 687 transitions, 13398 flow [2022-12-06 07:46:00,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 687 transitions, 13266 flow, removed 33 selfloop flow, removed 2 redundant places. [2022-12-06 07:46:00,064 INFO L231 Difference]: Finished difference. Result has 138 places, 495 transitions, 9658 flow [2022-12-06 07:46:00,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=9226, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9658, PETRI_PLACES=138, PETRI_TRANSITIONS=495} [2022-12-06 07:46:00,064 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 108 predicate places. [2022-12-06 07:46:00,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:00,064 INFO L89 Accepts]: Start accepts. Operand has 138 places, 495 transitions, 9658 flow [2022-12-06 07:46:00,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:00,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:00,066 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 495 transitions, 9658 flow [2022-12-06 07:46:00,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 495 transitions, 9658 flow [2022-12-06 07:46:00,307 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][177], [Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 80#L53true, 586#true, 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 159#true, Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:00,307 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:46:00,307 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:00,307 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:00,307 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:00,307 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][26], [Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 6#L72true, 586#true, 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 137#true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 68#L46-1true, Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:00,307 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:46:00,307 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:00,307 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:00,307 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:00,308 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][110], [Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 26#thread3EXITtrue, 80#L53true, 6#L72true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:00,308 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:46:00,308 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:00,308 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:00,308 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:00,390 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][82], [Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, 586#true, 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:00,390 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 07:46:00,390 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:00,390 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:46:00,390 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:00,431 INFO L130 PetriNetUnfolder]: 1159/2641 cut-off events. [2022-12-06 07:46:00,432 INFO L131 PetriNetUnfolder]: For 46205/47055 co-relation queries the response was YES. [2022-12-06 07:46:00,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20019 conditions, 2641 events. 1159/2641 cut-off events. For 46205/47055 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 21495 event pairs, 15 based on Foata normal form. 126/2716 useless extension candidates. Maximal degree in co-relation 19260. Up to 782 conditions per place. [2022-12-06 07:46:00,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 495 transitions, 9658 flow [2022-12-06 07:46:00,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 2604 [2022-12-06 07:46:00,466 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:00,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 403 [2022-12-06 07:46:00,467 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 495 transitions, 9658 flow [2022-12-06 07:46:00,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:00,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:00,467 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:00,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 07:46:00,468 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:00,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash 19215245, now seen corresponding path program 1 times [2022-12-06 07:46:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:00,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947019409] [2022-12-06 07:46:00,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:00,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:00,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:00,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947019409] [2022-12-06 07:46:00,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947019409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:00,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:00,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:46:00,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395405067] [2022-12-06 07:46:00,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:00,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:46:00,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:00,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:46:00,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:46:00,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 07:46:00,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 495 transitions, 9658 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:00,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:00,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 07:46:00,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:02,879 INFO L130 PetriNetUnfolder]: 7725/12243 cut-off events. [2022-12-06 07:46:02,879 INFO L131 PetriNetUnfolder]: For 243456/243456 co-relation queries the response was YES. [2022-12-06 07:46:02,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95702 conditions, 12243 events. 7725/12243 cut-off events. For 243456/243456 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 81951 event pairs, 701 based on Foata normal form. 80/12321 useless extension candidates. Maximal degree in co-relation 91419. Up to 7160 conditions per place. [2022-12-06 07:46:02,968 INFO L137 encePairwiseOnDemand]: 27/55 looper letters, 435 selfloop transitions, 220 changer transitions 4/659 dead transitions. [2022-12-06 07:46:02,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 659 transitions, 13207 flow [2022-12-06 07:46:02,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:46:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:46:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2022-12-06 07:46:02,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35454545454545455 [2022-12-06 07:46:02,970 INFO L175 Difference]: Start difference. First operand has 138 places, 495 transitions, 9658 flow. Second operand 8 states and 156 transitions. [2022-12-06 07:46:02,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 659 transitions, 13207 flow [2022-12-06 07:46:03,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 659 transitions, 13052 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 07:46:03,926 INFO L231 Difference]: Finished difference. Result has 148 places, 568 transitions, 11925 flow [2022-12-06 07:46:03,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=9244, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11925, PETRI_PLACES=148, PETRI_TRANSITIONS=568} [2022-12-06 07:46:03,927 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2022-12-06 07:46:03,927 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:03,927 INFO L89 Accepts]: Start accepts. Operand has 148 places, 568 transitions, 11925 flow [2022-12-06 07:46:03,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:03,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:03,930 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 568 transitions, 11925 flow [2022-12-06 07:46:03,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 568 transitions, 11925 flow [2022-12-06 07:46:04,368 INFO L130 PetriNetUnfolder]: 1299/3092 cut-off events. [2022-12-06 07:46:04,368 INFO L131 PetriNetUnfolder]: For 59272/59985 co-relation queries the response was YES. [2022-12-06 07:46:04,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24343 conditions, 3092 events. 1299/3092 cut-off events. For 59272/59985 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 26266 event pairs, 19 based on Foata normal form. 138/3178 useless extension candidates. Maximal degree in co-relation 23462. Up to 895 conditions per place. [2022-12-06 07:46:04,515 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 568 transitions, 11925 flow [2022-12-06 07:46:04,516 INFO L188 LiptonReduction]: Number of co-enabled transitions 2978 [2022-12-06 07:46:04,517 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [248] $Ultimate##0-->L72: Formula: (= v_thread2Thread1of1ForFork0_~cond~1_1 (ite (= (ite (< 1 (mod v_~N~0_10 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_10} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_1, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] [2022-12-06 07:46:04,625 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:46:04,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 699 [2022-12-06 07:46:04,626 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 568 transitions, 11945 flow [2022-12-06 07:46:04,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:04,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:04,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:04,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 07:46:04,627 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:04,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:04,627 INFO L85 PathProgramCache]: Analyzing trace with hash -141597587, now seen corresponding path program 1 times [2022-12-06 07:46:04,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:04,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472116374] [2022-12-06 07:46:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:04,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:04,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:04,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472116374] [2022-12-06 07:46:04,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472116374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:04,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:04,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:46:04,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293003695] [2022-12-06 07:46:04,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:04,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:46:04,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:04,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:46:04,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:46:04,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 07:46:04,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 568 transitions, 11945 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:04,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:04,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 07:46:04,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:07,436 INFO L130 PetriNetUnfolder]: 8000/12658 cut-off events. [2022-12-06 07:46:07,436 INFO L131 PetriNetUnfolder]: For 298663/298663 co-relation queries the response was YES. [2022-12-06 07:46:07,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105895 conditions, 12658 events. 8000/12658 cut-off events. For 298663/298663 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 85109 event pairs, 1071 based on Foata normal form. 184/12840 useless extension candidates. Maximal degree in co-relation 103495. Up to 9148 conditions per place. [2022-12-06 07:46:07,543 INFO L137 encePairwiseOnDemand]: 32/55 looper letters, 535 selfloop transitions, 77 changer transitions 3/615 dead transitions. [2022-12-06 07:46:07,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 615 transitions, 13649 flow [2022-12-06 07:46:07,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:46:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:46:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-06 07:46:07,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3563636363636364 [2022-12-06 07:46:07,544 INFO L175 Difference]: Start difference. First operand has 148 places, 568 transitions, 11945 flow. Second operand 5 states and 98 transitions. [2022-12-06 07:46:07,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 615 transitions, 13649 flow [2022-12-06 07:46:08,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 615 transitions, 13481 flow, removed 84 selfloop flow, removed 0 redundant places. [2022-12-06 07:46:08,953 INFO L231 Difference]: Finished difference. Result has 153 places, 557 transitions, 11756 flow [2022-12-06 07:46:08,953 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=11442, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11756, PETRI_PLACES=153, PETRI_TRANSITIONS=557} [2022-12-06 07:46:08,954 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 123 predicate places. [2022-12-06 07:46:08,954 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:08,954 INFO L89 Accepts]: Start accepts. Operand has 153 places, 557 transitions, 11756 flow [2022-12-06 07:46:08,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:08,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:08,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 557 transitions, 11756 flow [2022-12-06 07:46:08,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 557 transitions, 11756 flow [2022-12-06 07:46:09,360 INFO L130 PetriNetUnfolder]: 1340/3194 cut-off events. [2022-12-06 07:46:09,360 INFO L131 PetriNetUnfolder]: For 61344/62050 co-relation queries the response was YES. [2022-12-06 07:46:09,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25141 conditions, 3194 events. 1340/3194 cut-off events. For 61344/62050 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 27441 event pairs, 27 based on Foata normal form. 118/3254 useless extension candidates. Maximal degree in co-relation 24402. Up to 923 conditions per place. [2022-12-06 07:46:09,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 557 transitions, 11756 flow [2022-12-06 07:46:09,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 2960 [2022-12-06 07:46:09,424 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:09,424 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 470 [2022-12-06 07:46:09,425 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 557 transitions, 11756 flow [2022-12-06 07:46:09,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:09,425 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:09,425 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:09,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 07:46:09,425 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:09,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:09,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1335490921, now seen corresponding path program 1 times [2022-12-06 07:46:09,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:09,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612462297] [2022-12-06 07:46:09,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:09,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:09,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:09,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612462297] [2022-12-06 07:46:09,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612462297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:09,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:09,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:46:09,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042480326] [2022-12-06 07:46:09,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:09,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:46:09,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:09,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:46:09,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:46:09,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 07:46:09,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 557 transitions, 11756 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:09,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:09,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 07:46:09,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:12,507 INFO L130 PetriNetUnfolder]: 8145/12843 cut-off events. [2022-12-06 07:46:12,507 INFO L131 PetriNetUnfolder]: For 323870/323870 co-relation queries the response was YES. [2022-12-06 07:46:12,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109048 conditions, 12843 events. 8145/12843 cut-off events. For 323870/323870 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 85920 event pairs, 956 based on Foata normal form. 208/13049 useless extension candidates. Maximal degree in co-relation 106348. Up to 5463 conditions per place. [2022-12-06 07:46:12,609 INFO L137 encePairwiseOnDemand]: 16/55 looper letters, 583 selfloop transitions, 225 changer transitions 12/820 dead transitions. [2022-12-06 07:46:12,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 820 transitions, 18232 flow [2022-12-06 07:46:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:46:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:46:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2022-12-06 07:46:12,611 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27090909090909093 [2022-12-06 07:46:12,611 INFO L175 Difference]: Start difference. First operand has 153 places, 557 transitions, 11756 flow. Second operand 10 states and 149 transitions. [2022-12-06 07:46:12,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 820 transitions, 18232 flow [2022-12-06 07:46:13,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 820 transitions, 18096 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 07:46:13,861 INFO L231 Difference]: Finished difference. Result has 166 places, 623 transitions, 14333 flow [2022-12-06 07:46:13,861 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=11487, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14333, PETRI_PLACES=166, PETRI_TRANSITIONS=623} [2022-12-06 07:46:13,862 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 136 predicate places. [2022-12-06 07:46:13,862 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:13,862 INFO L89 Accepts]: Start accepts. Operand has 166 places, 623 transitions, 14333 flow [2022-12-06 07:46:13,865 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:13,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:13,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 623 transitions, 14333 flow [2022-12-06 07:46:13,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 623 transitions, 14333 flow [2022-12-06 07:46:14,224 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][399], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 780#(= ~N~0 ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 137#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:14,225 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:14,225 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:14,225 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:14,225 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:14,226 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][398], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 6#L72true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, 68#L46-1true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:14,226 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:14,226 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:14,226 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:14,226 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:14,226 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][159], [139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 778#true, Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 6#L72true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 806#true, Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:14,227 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:14,227 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:14,227 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:14,227 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:14,254 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][489], [778#true, 715#true, 806#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:14,255 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:14,255 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:14,255 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:14,255 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:46:14,528 INFO L130 PetriNetUnfolder]: 1418/3281 cut-off events. [2022-12-06 07:46:14,528 INFO L131 PetriNetUnfolder]: For 87453/88481 co-relation queries the response was YES. [2022-12-06 07:46:14,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28393 conditions, 3281 events. 1418/3281 cut-off events. For 87453/88481 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 27652 event pairs, 20 based on Foata normal form. 167/3390 useless extension candidates. Maximal degree in co-relation 27557. Up to 914 conditions per place. [2022-12-06 07:46:14,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 623 transitions, 14333 flow [2022-12-06 07:46:14,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 3210 [2022-12-06 07:46:14,597 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:14,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 736 [2022-12-06 07:46:14,598 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 623 transitions, 14333 flow [2022-12-06 07:46:14,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:14,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:14,598 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:14,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 07:46:14,598 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:14,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:14,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1761997621, now seen corresponding path program 2 times [2022-12-06 07:46:14,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:14,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756663539] [2022-12-06 07:46:14,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:14,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:14,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:14,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756663539] [2022-12-06 07:46:14,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756663539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:14,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:14,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:46:14,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219861413] [2022-12-06 07:46:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:14,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:46:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:14,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:46:14,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:46:14,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 07:46:14,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 623 transitions, 14333 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:14,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:14,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 07:46:14,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:17,809 INFO L130 PetriNetUnfolder]: 8417/13268 cut-off events. [2022-12-06 07:46:17,809 INFO L131 PetriNetUnfolder]: For 360108/360108 co-relation queries the response was YES. [2022-12-06 07:46:17,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117895 conditions, 13268 events. 8417/13268 cut-off events. For 360108/360108 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 89496 event pairs, 884 based on Foata normal form. 80/13346 useless extension candidates. Maximal degree in co-relation 113856. Up to 7684 conditions per place. [2022-12-06 07:46:17,928 INFO L137 encePairwiseOnDemand]: 18/55 looper letters, 577 selfloop transitions, 228 changer transitions 4/809 dead transitions. [2022-12-06 07:46:17,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 809 transitions, 18924 flow [2022-12-06 07:46:17,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:46:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:46:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-12-06 07:46:17,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29772727272727273 [2022-12-06 07:46:17,929 INFO L175 Difference]: Start difference. First operand has 164 places, 623 transitions, 14333 flow. Second operand 8 states and 131 transitions. [2022-12-06 07:46:17,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 809 transitions, 18924 flow [2022-12-06 07:46:19,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 809 transitions, 18873 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-06 07:46:19,550 INFO L231 Difference]: Finished difference. Result has 173 places, 636 transitions, 15281 flow [2022-12-06 07:46:19,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=13920, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15281, PETRI_PLACES=173, PETRI_TRANSITIONS=636} [2022-12-06 07:46:19,550 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 143 predicate places. [2022-12-06 07:46:19,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:19,550 INFO L89 Accepts]: Start accepts. Operand has 173 places, 636 transitions, 15281 flow [2022-12-06 07:46:19,553 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:19,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:19,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 636 transitions, 15281 flow [2022-12-06 07:46:19,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 636 transitions, 15281 flow [2022-12-06 07:46:19,706 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][386], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:19,706 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:19,706 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:19,706 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:19,706 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:19,707 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][385], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 6#L72true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 68#L46-1true, Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:19,707 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:19,707 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:19,707 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:19,707 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:19,707 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][213], [139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 778#true, Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 6#L72true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 806#true, Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 827#true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:19,707 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:19,707 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:19,707 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:19,707 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:19,725 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][493], [778#true, 715#true, 806#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:19,725 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:19,725 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:19,725 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:19,725 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:46:19,957 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][138], [778#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 780#(= ~N~0 ~L~0), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 806#true, Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 827#true, Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:19,957 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:46:19,957 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:19,957 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:46:19,957 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:19,958 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][28], [778#true, 806#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, 68#L46-1true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:19,958 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:46:19,958 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:19,958 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:46:19,958 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:19,958 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L65-1-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_7) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_7, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1][370], [139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 778#true, 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 715#true, 806#true, 102#true, Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 6#L72true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:19,958 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 07:46:19,958 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:19,958 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:19,958 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:20,115 INFO L130 PetriNetUnfolder]: 1527/3520 cut-off events. [2022-12-06 07:46:20,116 INFO L131 PetriNetUnfolder]: For 100118/101309 co-relation queries the response was YES. [2022-12-06 07:46:20,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31517 conditions, 3520 events. 1527/3520 cut-off events. For 100118/101309 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 29943 event pairs, 27 based on Foata normal form. 184/3643 useless extension candidates. Maximal degree in co-relation 30502. Up to 993 conditions per place. [2022-12-06 07:46:20,166 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 636 transitions, 15281 flow [2022-12-06 07:46:20,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 3190 [2022-12-06 07:46:20,168 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:20,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 619 [2022-12-06 07:46:20,169 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 636 transitions, 15281 flow [2022-12-06 07:46:20,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:20,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:20,169 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:20,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 07:46:20,169 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:20,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash 357982343, now seen corresponding path program 1 times [2022-12-06 07:46:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:20,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867122722] [2022-12-06 07:46:20,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:20,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:20,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867122722] [2022-12-06 07:46:20,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867122722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:20,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:20,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:46:20,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595055317] [2022-12-06 07:46:20,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:20,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:46:20,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:20,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:46:20,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:46:20,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 07:46:20,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 636 transitions, 15281 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:20,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:20,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 07:46:20,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:23,141 INFO L130 PetriNetUnfolder]: 8427/13308 cut-off events. [2022-12-06 07:46:23,142 INFO L131 PetriNetUnfolder]: For 402216/402216 co-relation queries the response was YES. [2022-12-06 07:46:23,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122259 conditions, 13308 events. 8427/13308 cut-off events. For 402216/402216 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 90465 event pairs, 3449 based on Foata normal form. 6/13312 useless extension candidates. Maximal degree in co-relation 118508. Up to 13257 conditions per place. [2022-12-06 07:46:23,250 INFO L137 encePairwiseOnDemand]: 51/55 looper letters, 632 selfloop transitions, 0 changer transitions 16/648 dead transitions. [2022-12-06 07:46:23,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 648 transitions, 16679 flow [2022-12-06 07:46:23,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:46:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:46:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-06 07:46:23,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2545454545454545 [2022-12-06 07:46:23,252 INFO L175 Difference]: Start difference. First operand has 173 places, 636 transitions, 15281 flow. Second operand 5 states and 70 transitions. [2022-12-06 07:46:23,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 648 transitions, 16679 flow [2022-12-06 07:46:25,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 648 transitions, 16589 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 07:46:25,133 INFO L231 Difference]: Finished difference. Result has 176 places, 632 transitions, 15095 flow [2022-12-06 07:46:25,133 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=15192, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15095, PETRI_PLACES=176, PETRI_TRANSITIONS=632} [2022-12-06 07:46:25,134 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 146 predicate places. [2022-12-06 07:46:25,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:25,134 INFO L89 Accepts]: Start accepts. Operand has 176 places, 632 transitions, 15095 flow [2022-12-06 07:46:25,137 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:25,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:25,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 632 transitions, 15095 flow [2022-12-06 07:46:25,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 632 transitions, 15095 flow [2022-12-06 07:46:25,395 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][374], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 780#(= ~N~0 ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 844#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 846#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 845#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:25,395 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:25,395 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:25,395 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:25,395 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:25,396 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][373], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 6#L72true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 844#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 846#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 845#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 68#L46-1true, Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:25,396 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:25,396 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:25,396 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:25,396 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:25,396 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][201], [139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 778#true, Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 6#L72true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 806#true, Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 827#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 844#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 846#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 845#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296)), 752#true, 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:25,396 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:25,396 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:25,396 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:25,396 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:25,413 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][480], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 780#(= ~N~0 ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 844#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 846#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 845#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:25,414 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:25,414 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:25,414 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:46:25,414 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:25,700 INFO L130 PetriNetUnfolder]: 1514/3504 cut-off events. [2022-12-06 07:46:25,701 INFO L131 PetriNetUnfolder]: For 98367/99446 co-relation queries the response was YES. [2022-12-06 07:46:25,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31295 conditions, 3504 events. 1514/3504 cut-off events. For 98367/99446 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 29845 event pairs, 27 based on Foata normal form. 168/3615 useless extension candidates. Maximal degree in co-relation 31053. Up to 982 conditions per place. [2022-12-06 07:46:25,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 632 transitions, 15095 flow [2022-12-06 07:46:25,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 3182 [2022-12-06 07:46:25,756 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:25,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 622 [2022-12-06 07:46:25,756 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 632 transitions, 15095 flow [2022-12-06 07:46:25,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:25,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:25,756 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:25,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 07:46:25,757 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1627427305, now seen corresponding path program 1 times [2022-12-06 07:46:25,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:25,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202228449] [2022-12-06 07:46:25,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:25,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:25,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:25,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202228449] [2022-12-06 07:46:25,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202228449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:25,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:25,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:46:25,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626552812] [2022-12-06 07:46:25,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:25,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:46:25,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:25,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:46:25,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:46:25,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 07:46:25,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 632 transitions, 15095 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:25,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:25,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 07:46:25,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:28,770 INFO L130 PetriNetUnfolder]: 8498/13535 cut-off events. [2022-12-06 07:46:28,770 INFO L131 PetriNetUnfolder]: For 418095/418095 co-relation queries the response was YES. [2022-12-06 07:46:28,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123689 conditions, 13535 events. 8498/13535 cut-off events. For 418095/418095 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 93624 event pairs, 1803 based on Foata normal form. 130/13663 useless extension candidates. Maximal degree in co-relation 122956. Up to 7519 conditions per place. [2022-12-06 07:46:28,901 INFO L137 encePairwiseOnDemand]: 33/54 looper letters, 414 selfloop transitions, 355 changer transitions 3/772 dead transitions. [2022-12-06 07:46:28,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 772 transitions, 19183 flow [2022-12-06 07:46:28,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:46:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:46:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-12-06 07:46:28,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33641975308641975 [2022-12-06 07:46:28,902 INFO L175 Difference]: Start difference. First operand has 172 places, 632 transitions, 15095 flow. Second operand 6 states and 109 transitions. [2022-12-06 07:46:28,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 772 transitions, 19183 flow [2022-12-06 07:46:31,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 772 transitions, 19038 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 07:46:31,073 INFO L231 Difference]: Finished difference. Result has 176 places, 661 transitions, 16697 flow [2022-12-06 07:46:31,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=14714, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=315, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=16697, PETRI_PLACES=176, PETRI_TRANSITIONS=661} [2022-12-06 07:46:31,074 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 146 predicate places. [2022-12-06 07:46:31,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:31,074 INFO L89 Accepts]: Start accepts. Operand has 176 places, 661 transitions, 16697 flow [2022-12-06 07:46:31,077 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:31,077 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:31,077 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 661 transitions, 16697 flow [2022-12-06 07:46:31,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 661 transitions, 16697 flow [2022-12-06 07:46:31,242 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][217], [139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 778#true, Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 6#L72true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 806#true, Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:31,242 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:31,242 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:31,242 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:31,242 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:31,242 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][383], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:31,242 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:31,242 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:31,242 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:31,242 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:31,243 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][382], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 6#L72true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 68#L46-1true, Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:31,243 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:31,243 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:31,243 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:31,243 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:31,265 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][501], [778#true, 715#true, 806#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 780#(= ~N~0 ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 07:46:31,265 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:31,265 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:46:31,265 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:31,265 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:31,573 INFO L130 PetriNetUnfolder]: 1490/3539 cut-off events. [2022-12-06 07:46:31,573 INFO L131 PetriNetUnfolder]: For 108187/109340 co-relation queries the response was YES. [2022-12-06 07:46:31,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33146 conditions, 3539 events. 1490/3539 cut-off events. For 108187/109340 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 30671 event pairs, 22 based on Foata normal form. 179/3663 useless extension candidates. Maximal degree in co-relation 32085. Up to 954 conditions per place. [2022-12-06 07:46:31,626 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 661 transitions, 16697 flow [2022-12-06 07:46:31,626 INFO L188 LiptonReduction]: Number of co-enabled transitions 3324 [2022-12-06 07:46:31,730 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:46:31,731 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 657 [2022-12-06 07:46:31,731 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 661 transitions, 16726 flow [2022-12-06 07:46:31,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:31,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:31,731 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:31,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 07:46:31,732 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:31,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:31,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1961339890, now seen corresponding path program 1 times [2022-12-06 07:46:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:31,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340305440] [2022-12-06 07:46:31,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:31,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:31,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:31,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340305440] [2022-12-06 07:46:31,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340305440] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:46:31,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38648305] [2022-12-06 07:46:31,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:31,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:46:31,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:46:31,996 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:46:32,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:46:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:32,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 07:46:32,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:46:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:32,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:46:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:33,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38648305] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:46:33,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:46:33,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 07:46:33,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098390148] [2022-12-06 07:46:33,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:46:33,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:46:33,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:33,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:46:33,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:46:33,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 07:46:33,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 661 transitions, 16726 flow. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:33,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:33,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 07:46:33,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:38,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:46:42,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:46:44,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:46:49,064 INFO L130 PetriNetUnfolder]: 10364/16738 cut-off events. [2022-12-06 07:46:49,064 INFO L131 PetriNetUnfolder]: For 572533/572533 co-relation queries the response was YES. [2022-12-06 07:46:49,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159692 conditions, 16738 events. 10364/16738 cut-off events. For 572533/572533 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 120557 event pairs, 1128 based on Foata normal form. 36/16772 useless extension candidates. Maximal degree in co-relation 154651. Up to 10245 conditions per place. [2022-12-06 07:46:49,273 INFO L137 encePairwiseOnDemand]: 15/55 looper letters, 576 selfloop transitions, 521 changer transitions 64/1161 dead transitions. [2022-12-06 07:46:49,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 1161 transitions, 28614 flow [2022-12-06 07:46:49,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 07:46:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 07:46:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 327 transitions. [2022-12-06 07:46:49,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19178885630498535 [2022-12-06 07:46:49,274 INFO L175 Difference]: Start difference. First operand has 176 places, 661 transitions, 16726 flow. Second operand 31 states and 327 transitions. [2022-12-06 07:46:49,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 1161 transitions, 28614 flow [2022-12-06 07:46:52,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 1161 transitions, 28544 flow, removed 35 selfloop flow, removed 0 redundant places. [2022-12-06 07:46:52,283 INFO L231 Difference]: Finished difference. Result has 219 places, 875 transitions, 23942 flow [2022-12-06 07:46:52,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=16688, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=23942, PETRI_PLACES=219, PETRI_TRANSITIONS=875} [2022-12-06 07:46:52,284 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 189 predicate places. [2022-12-06 07:46:52,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:52,284 INFO L89 Accepts]: Start accepts. Operand has 219 places, 875 transitions, 23942 flow [2022-12-06 07:46:52,289 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:52,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:52,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 875 transitions, 23942 flow [2022-12-06 07:46:52,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 875 transitions, 23942 flow [2022-12-06 07:46:52,554 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][271], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 1022#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1012#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 6#L72true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 806#true, Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:46:52,555 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:52,555 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:52,555 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:52,555 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:52,555 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][512], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 1022#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), 806#true, 715#true, Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 1012#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 861#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 42#L83true, Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:46:52,555 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:52,555 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:52,555 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:52,555 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:52,556 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][519], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 1022#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), 806#true, 715#true, Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 1012#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 6#L72true, 861#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 42#L83true, Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 68#L46-1true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:46:52,556 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:52,556 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:52,556 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:52,556 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:52,579 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][687], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 1022#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), 806#true, 715#true, Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 1012#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 861#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:46:52,579 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:52,579 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:52,579 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:52,579 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:46:53,057 INFO L130 PetriNetUnfolder]: 1742/4211 cut-off events. [2022-12-06 07:46:53,058 INFO L131 PetriNetUnfolder]: For 149256/150669 co-relation queries the response was YES. [2022-12-06 07:46:53,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42212 conditions, 4211 events. 1742/4211 cut-off events. For 149256/150669 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 37988 event pairs, 15 based on Foata normal form. 194/4346 useless extension candidates. Maximal degree in co-relation 41475. Up to 1216 conditions per place. [2022-12-06 07:46:53,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 875 transitions, 23942 flow [2022-12-06 07:46:53,127 INFO L188 LiptonReduction]: Number of co-enabled transitions 4122 [2022-12-06 07:46:53,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 07:46:53,696 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:46:53,696 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1412 [2022-12-06 07:46:53,696 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 873 transitions, 23916 flow [2022-12-06 07:46:53,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:53,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:53,697 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:53,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:46:53,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-06 07:46:53,900 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:53,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:53,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1472657793, now seen corresponding path program 1 times [2022-12-06 07:46:53,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:53,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905972470] [2022-12-06 07:46:53,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:53,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:54,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:54,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905972470] [2022-12-06 07:46:54,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905972470] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:46:54,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706196196] [2022-12-06 07:46:54,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:54,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:46:54,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:46:54,159 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:46:54,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:46:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:54,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 07:46:54,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:46:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:54,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:46:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:54,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706196196] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:46:54,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:46:54,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 07:46:54,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602878792] [2022-12-06 07:46:54,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:46:54,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:46:54,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:54,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:46:54,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:46:54,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 07:46:54,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 873 transitions, 23916 flow. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:54,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:54,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 07:46:54,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:57,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:46:58,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:47:06,668 INFO L130 PetriNetUnfolder]: 11491/18359 cut-off events. [2022-12-06 07:47:06,668 INFO L131 PetriNetUnfolder]: For 747990/747990 co-relation queries the response was YES. [2022-12-06 07:47:06,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189246 conditions, 18359 events. 11491/18359 cut-off events. For 747990/747990 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 130855 event pairs, 1140 based on Foata normal form. 23/18380 useless extension candidates. Maximal degree in co-relation 188328. Up to 8101 conditions per place. [2022-12-06 07:47:06,851 INFO L137 encePairwiseOnDemand]: 15/56 looper letters, 804 selfloop transitions, 409 changer transitions 30/1243 dead transitions. [2022-12-06 07:47:06,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 1243 transitions, 34045 flow [2022-12-06 07:47:06,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 07:47:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 07:47:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 249 transitions. [2022-12-06 07:47:06,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23402255639097744 [2022-12-06 07:47:06,852 INFO L175 Difference]: Start difference. First operand has 215 places, 873 transitions, 23916 flow. Second operand 19 states and 249 transitions. [2022-12-06 07:47:06,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 1243 transitions, 34045 flow [2022-12-06 07:47:11,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 1243 transitions, 32252 flow, removed 859 selfloop flow, removed 7 redundant places. [2022-12-06 07:47:11,473 INFO L231 Difference]: Finished difference. Result has 234 places, 1030 transitions, 27908 flow [2022-12-06 07:47:11,473 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=22053, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=871, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=27908, PETRI_PLACES=234, PETRI_TRANSITIONS=1030} [2022-12-06 07:47:11,474 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2022-12-06 07:47:11,474 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:11,474 INFO L89 Accepts]: Start accepts. Operand has 234 places, 1030 transitions, 27908 flow [2022-12-06 07:47:11,480 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:11,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:11,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 1030 transitions, 27908 flow [2022-12-06 07:47:11,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 1030 transitions, 27908 flow [2022-12-06 07:47:12,054 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][34], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), 806#true, Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1173#(and (<= ~p~0 ~q~0) (or (and (< 0 (mod ~L~0 4294967296)) (= (* 2 ~M~0) ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~M~0 ~p~0))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~M~0 ~q~0) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 1171#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1163#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1181#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1175#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1169#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1165#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 1081#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 861#true, 1036#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 68#L46-1true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 287#true, Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:47:12,055 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:47:12,055 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:47:12,055 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:47:12,055 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:47:12,055 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][169], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1173#(and (<= ~p~0 ~q~0) (or (and (< 0 (mod ~L~0 4294967296)) (= (* 2 ~M~0) ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~M~0 ~p~0))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~M~0 ~q~0) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 1171#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1163#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1181#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1175#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1169#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 26#thread3EXITtrue, Black: 1165#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 1081#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 80#L53true, 1161#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1))))), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 806#true, Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:47:12,055 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:47:12,055 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:47:12,055 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:47:12,055 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:47:12,092 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][725], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), 806#true, Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 1036#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 42#L83true, 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1173#(and (<= ~p~0 ~q~0) (or (and (< 0 (mod ~L~0 4294967296)) (= (* 2 ~M~0) ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~M~0 ~p~0))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~M~0 ~q~0) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1171#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1163#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1181#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1175#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1169#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1165#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1081#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 861#true, Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 827#true, Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:47:12,092 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:47:12,092 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:47:12,092 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:47:12,092 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:47:12,093 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][282], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), 806#true, Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 1173#(and (<= ~p~0 ~q~0) (or (and (< 0 (mod ~L~0 4294967296)) (= (* 2 ~M~0) ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~M~0 ~p~0))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~M~0 ~q~0) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 1171#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1163#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1181#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1175#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 9#thread1EXITtrue, Black: 1169#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1165#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1081#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 861#true, 1036#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:47:12,094 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:47:12,094 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:47:12,094 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:47:12,094 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:47:12,356 INFO L130 PetriNetUnfolder]: 1920/4711 cut-off events. [2022-12-06 07:47:12,356 INFO L131 PetriNetUnfolder]: For 175828/177436 co-relation queries the response was YES. [2022-12-06 07:47:12,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46772 conditions, 4711 events. 1920/4711 cut-off events. For 175828/177436 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 43746 event pairs, 14 based on Foata normal form. 227/4872 useless extension candidates. Maximal degree in co-relation 45846. Up to 1356 conditions per place. [2022-12-06 07:47:12,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 1030 transitions, 27908 flow [2022-12-06 07:47:12,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 4880 [2022-12-06 07:47:12,438 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:47:12,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 965 [2022-12-06 07:47:12,439 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 1030 transitions, 27908 flow [2022-12-06 07:47:12,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:47:12,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:12,439 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:12,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 07:47:12,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 07:47:12,640 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:47:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash 129654173, now seen corresponding path program 2 times [2022-12-06 07:47:12,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:12,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090483553] [2022-12-06 07:47:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:12,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:12,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:12,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090483553] [2022-12-06 07:47:12,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090483553] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:47:12,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955789615] [2022-12-06 07:47:12,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:47:12,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:47:12,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:47:12,780 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:47:12,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 07:47:12,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:47:12,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:47:12,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 07:47:12,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:47:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:12,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:47:13,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:13,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955789615] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:47:13,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:47:13,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2022-12-06 07:47:13,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113240559] [2022-12-06 07:47:13,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:47:13,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:47:13,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:13,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:47:13,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-12-06 07:47:13,157 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:47:13,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 1030 transitions, 27908 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:47:13,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:13,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:47:13,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:20,541 INFO L130 PetriNetUnfolder]: 13047/20720 cut-off events. [2022-12-06 07:47:20,541 INFO L131 PetriNetUnfolder]: For 936862/936862 co-relation queries the response was YES. [2022-12-06 07:47:20,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215260 conditions, 20720 events. 13047/20720 cut-off events. For 936862/936862 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 150152 event pairs, 1431 based on Foata normal form. 66/20784 useless extension candidates. Maximal degree in co-relation 213029. Up to 7775 conditions per place. [2022-12-06 07:47:20,762 INFO L137 encePairwiseOnDemand]: 15/53 looper letters, 581 selfloop transitions, 890 changer transitions 0/1471 dead transitions. [2022-12-06 07:47:20,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 1471 transitions, 41221 flow [2022-12-06 07:47:20,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:47:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:47:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 203 transitions. [2022-12-06 07:47:20,764 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2946298984034833 [2022-12-06 07:47:20,764 INFO L175 Difference]: Start difference. First operand has 233 places, 1030 transitions, 27908 flow. Second operand 13 states and 203 transitions. [2022-12-06 07:47:20,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 1471 transitions, 41221 flow [2022-12-06 07:47:26,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 1471 transitions, 38764 flow, removed 858 selfloop flow, removed 5 redundant places. [2022-12-06 07:47:26,979 INFO L231 Difference]: Finished difference. Result has 249 places, 1248 transitions, 35426 flow [2022-12-06 07:47:26,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=25876, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1030, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=688, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=35426, PETRI_PLACES=249, PETRI_TRANSITIONS=1248} [2022-12-06 07:47:26,981 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 219 predicate places. [2022-12-06 07:47:26,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:26,981 INFO L89 Accepts]: Start accepts. Operand has 249 places, 1248 transitions, 35426 flow [2022-12-06 07:47:26,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:26,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:26,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 1248 transitions, 35426 flow [2022-12-06 07:47:27,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 1248 transitions, 35426 flow [2022-12-06 07:47:27,583 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][287], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 6#L72true, 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1332#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 1322#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1330#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 1328#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 806#true, Black: 1279#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 1286#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 1290#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))), Black: 1190#true, Black: 1326#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), 1320#(and (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), 752#true, Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 1173#(and (<= ~p~0 ~q~0) (or (and (< 0 (mod ~L~0 4294967296)) (= (* 2 ~M~0) ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~M~0 ~p~0))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~M~0 ~q~0) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1171#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1163#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1181#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1175#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1169#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 26#thread3EXITtrue, Black: 1165#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1081#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 1161#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1))))), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:47:27,583 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:47:27,583 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:47:27,583 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:47:27,583 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:47:27,752 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][756], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), 806#true, Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 1036#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1332#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1322#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1330#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 1328#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 1279#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 1286#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 1190#true, Black: 1290#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))), Black: 1326#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 42#L83true, 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 752#true, Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1173#(and (<= ~p~0 ~q~0) (or (and (< 0 (mod ~L~0 4294967296)) (= (* 2 ~M~0) ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~M~0 ~p~0))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~M~0 ~q~0) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1171#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1163#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1181#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1175#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1169#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1165#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1081#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 861#true, Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 827#true, Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:47:27,753 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:47:27,753 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:47:27,753 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:47:27,753 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:47:28,184 INFO L130 PetriNetUnfolder]: 2190/5315 cut-off events. [2022-12-06 07:47:28,184 INFO L131 PetriNetUnfolder]: For 229583/231092 co-relation queries the response was YES. [2022-12-06 07:47:28,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56134 conditions, 5315 events. 2190/5315 cut-off events. For 229583/231092 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 50036 event pairs, 18 based on Foata normal form. 224/5470 useless extension candidates. Maximal degree in co-relation 54785. Up to 1549 conditions per place. [2022-12-06 07:47:28,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 249 places, 1248 transitions, 35426 flow [2022-12-06 07:47:28,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 5706 [2022-12-06 07:47:28,283 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:47:28,284 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1303 [2022-12-06 07:47:28,284 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 1248 transitions, 35426 flow [2022-12-06 07:47:28,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:47:28,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:28,284 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:28,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 07:47:28,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:47:28,487 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:47:28,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash 174758280, now seen corresponding path program 1 times [2022-12-06 07:47:28,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:28,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973694990] [2022-12-06 07:47:28,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:28,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:47:28,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:28,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973694990] [2022-12-06 07:47:28,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973694990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:47:28,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:47:28,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:47:28,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922203563] [2022-12-06 07:47:28,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:47:28,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:47:28,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:28,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:47:28,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:47:28,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:47:28,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 1248 transitions, 35426 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:47:28,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:28,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:47:28,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:36,439 INFO L130 PetriNetUnfolder]: 13626/21704 cut-off events. [2022-12-06 07:47:36,439 INFO L131 PetriNetUnfolder]: For 1044263/1044263 co-relation queries the response was YES. [2022-12-06 07:47:36,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232957 conditions, 21704 events. 13626/21704 cut-off events. For 1044263/1044263 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 159704 event pairs, 5375 based on Foata normal form. 24/21726 useless extension candidates. Maximal degree in co-relation 230616. Up to 20324 conditions per place. [2022-12-06 07:47:36,697 INFO L137 encePairwiseOnDemand]: 44/53 looper letters, 1325 selfloop transitions, 47 changer transitions 8/1380 dead transitions. [2022-12-06 07:47:36,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 1380 transitions, 41258 flow [2022-12-06 07:47:36,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:47:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:47:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-06 07:47:36,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38113207547169814 [2022-12-06 07:47:36,698 INFO L175 Difference]: Start difference. First operand has 249 places, 1248 transitions, 35426 flow. Second operand 5 states and 101 transitions. [2022-12-06 07:47:36,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 1380 transitions, 41258 flow [2022-12-06 07:47:46,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 1380 transitions, 40470 flow, removed 394 selfloop flow, removed 0 redundant places. [2022-12-06 07:47:46,631 INFO L231 Difference]: Finished difference. Result has 256 places, 1272 transitions, 35388 flow [2022-12-06 07:47:46,632 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=34684, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=35388, PETRI_PLACES=256, PETRI_TRANSITIONS=1272} [2022-12-06 07:47:46,632 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2022-12-06 07:47:46,632 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:46,632 INFO L89 Accepts]: Start accepts. Operand has 256 places, 1272 transitions, 35388 flow [2022-12-06 07:47:46,639 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:46,639 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:46,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 1272 transitions, 35388 flow [2022-12-06 07:47:46,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 1272 transitions, 35388 flow [2022-12-06 07:47:47,486 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][684], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), 806#true, Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), 102#true, Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 1036#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1332#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1322#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1330#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 1328#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 1279#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), 1190#true, Black: 1286#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 1290#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))), Black: 1326#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 42#L83true, 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 1348#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 1344#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 1350#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 1342#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1173#(and (<= ~p~0 ~q~0) (or (and (< 0 (mod ~L~0 4294967296)) (= (* 2 ~M~0) ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~M~0 ~p~0))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~M~0 ~q~0) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1171#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1163#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1181#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1175#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1169#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1165#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1081#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 861#true, Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 827#true, Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:47:47,486 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:47:47,486 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:47:47,486 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:47:47,487 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:47:47,826 INFO L130 PetriNetUnfolder]: 2302/5606 cut-off events. [2022-12-06 07:47:47,826 INFO L131 PetriNetUnfolder]: For 239621/241219 co-relation queries the response was YES. [2022-12-06 07:47:47,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58911 conditions, 5606 events. 2302/5606 cut-off events. For 239621/241219 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 53454 event pairs, 18 based on Foata normal form. 245/5779 useless extension candidates. Maximal degree in co-relation 57497. Up to 1565 conditions per place. [2022-12-06 07:47:47,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 256 places, 1272 transitions, 35388 flow [2022-12-06 07:47:47,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 5860 [2022-12-06 07:47:47,933 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:47:47,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1302 [2022-12-06 07:47:47,934 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 1272 transitions, 35388 flow [2022-12-06 07:47:47,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:47:47,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:47,934 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:47,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 07:47:47,934 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:47:47,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:47,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1723152994, now seen corresponding path program 1 times [2022-12-06 07:47:47,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:47,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162765480] [2022-12-06 07:47:47,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:48,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:48,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162765480] [2022-12-06 07:47:48,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162765480] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:47:48,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881092402] [2022-12-06 07:47:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:48,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:47:48,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:47:48,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:47:48,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 07:47:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:48,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 07:47:48,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:47:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:48,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:47:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:48,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881092402] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:47:48,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:47:48,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-06 07:47:48,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212751500] [2022-12-06 07:47:48,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:47:48,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:47:48,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:48,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:47:48,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:47:48,726 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:47:48,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 1272 transitions, 35388 flow. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:47:48,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:48,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:47:48,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:56,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:48:00,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:48:18,181 INFO L130 PetriNetUnfolder]: 23564/37018 cut-off events. [2022-12-06 07:48:18,182 INFO L131 PetriNetUnfolder]: For 1991910/1991910 co-relation queries the response was YES. [2022-12-06 07:48:18,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419424 conditions, 37018 events. 23564/37018 cut-off events. For 1991910/1991910 co-relation queries the response was YES. Maximal size of possible extension queue 2182. Compared 286159 event pairs, 1672 based on Foata normal form. 65/37081 useless extension candidates. Maximal degree in co-relation 416621. Up to 11428 conditions per place. [2022-12-06 07:48:18,930 INFO L137 encePairwiseOnDemand]: 15/53 looper letters, 1279 selfloop transitions, 1442 changer transitions 50/2771 dead transitions. [2022-12-06 07:48:18,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 2771 transitions, 77667 flow [2022-12-06 07:48:18,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-06 07:48:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-12-06 07:48:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 591 transitions. [2022-12-06 07:48:18,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23725411481332798 [2022-12-06 07:48:18,932 INFO L175 Difference]: Start difference. First operand has 256 places, 1272 transitions, 35388 flow. Second operand 47 states and 591 transitions. [2022-12-06 07:48:18,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 2771 transitions, 77667 flow [2022-12-06 07:48:41,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 2771 transitions, 77424 flow, removed 60 selfloop flow, removed 1 redundant places. [2022-12-06 07:48:41,899 INFO L231 Difference]: Finished difference. Result has 320 places, 2015 transitions, 63430 flow [2022-12-06 07:48:41,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=35310, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=779, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=63430, PETRI_PLACES=320, PETRI_TRANSITIONS=2015} [2022-12-06 07:48:41,901 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 290 predicate places. [2022-12-06 07:48:41,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:41,901 INFO L89 Accepts]: Start accepts. Operand has 320 places, 2015 transitions, 63430 flow [2022-12-06 07:48:41,915 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:41,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:41,916 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 320 places, 2015 transitions, 63430 flow [2022-12-06 07:48:41,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 2015 transitions, 63430 flow [2022-12-06 07:48:42,927 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][33], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), 806#true, Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 1556#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 1534#(and (= ~N~0 ~L~0) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0)), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 1518#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296)))))), Black: 1362#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1560#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0)), Black: 1361#(or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)), Black: 1512#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 1 (mod ~N~0 4294967296))) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))))))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 1279#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1492#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296)))))), Black: 1454#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 1562#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 1524#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1546#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 1542#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1504#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1558#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 1536#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 1530#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1450#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 1528#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 1036#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1332#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1322#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1330#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 1328#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 1286#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 1290#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))), Black: 1190#true, Black: 1326#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 42#L83true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 1348#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1344#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 1350#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 68#L46-1true, 287#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 1356#true, Black: 1173#(and (<= ~p~0 ~q~0) (or (and (< 0 (mod ~L~0 4294967296)) (= (* 2 ~M~0) ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~M~0 ~p~0))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~M~0 ~q~0) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1171#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1163#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1181#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1175#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1169#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1165#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1081#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 861#true, Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 827#true, Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:48:42,928 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:48:42,928 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:48:42,928 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:48:42,928 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:48:42,928 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][396], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 1556#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 1534#(and (= ~N~0 ~L~0) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0)), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 1518#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296)))))), Black: 1362#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1560#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0)), Black: 1361#(or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)), Black: 1512#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 1 (mod ~N~0 4294967296))) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))))))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1492#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296)))))), Black: 1454#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 1562#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 1524#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1546#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 1542#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1504#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1558#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 1530#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1450#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 1528#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1332#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1322#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1330#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 1328#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 806#true, Black: 1279#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 1286#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 1290#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))), Black: 1190#true, Black: 1326#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 1348#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1344#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 1350#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 1320#(and (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 287#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 104#(= ~N~0 ~L~0), 460#true, 1536#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 48#L65-1true, Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1173#(and (<= ~p~0 ~q~0) (or (and (< 0 (mod ~L~0 4294967296)) (= (* 2 ~M~0) ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~M~0 ~p~0))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~M~0 ~q~0) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1171#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1163#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1181#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1175#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 26#thread3EXITtrue, Black: 1169#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1165#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1081#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 80#L53true, 1161#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1))))), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 137#true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:48:42,928 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:48:42,928 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:48:42,928 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:48:42,929 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:48:44,691 INFO L130 PetriNetUnfolder]: 3838/9190 cut-off events. [2022-12-06 07:48:44,691 INFO L131 PetriNetUnfolder]: For 474895/476795 co-relation queries the response was YES. [2022-12-06 07:48:44,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107462 conditions, 9190 events. 3838/9190 cut-off events. For 474895/476795 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 94974 event pairs, 31 based on Foata normal form. 265/9312 useless extension candidates. Maximal degree in co-relation 105456. Up to 2581 conditions per place. [2022-12-06 07:48:44,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 320 places, 2015 transitions, 63430 flow [2022-12-06 07:48:44,879 INFO L188 LiptonReduction]: Number of co-enabled transitions 9350 [2022-12-06 07:48:44,883 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:48:44,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 07:48:45,056 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 07:48:45,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:48:45,273 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 07:48:45,375 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] $Ultimate##0-->L46-1: Formula: (let ((.cse0 (mod v_~N~0_200 4294967296))) (and (= (+ v_~N~0_199 1) v_~N~0_200) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_79 256) 0)) (= (ite (= (ite (< 1 .cse0) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_63) (= v_~p~0_163 (+ v_~M~0_104 v_~p~0_164)) (= v_thread1Thread1of1ForFork2_~cond~0_79 (ite (= (ite (< 0 .cse0) 1 0) 0) 0 1)))) InVars {~M~0=v_~M~0_104, ~p~0=v_~p~0_164, ~N~0=v_~N~0_200} OutVars{~M~0=v_~M~0_104, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_63, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_49|, ~p~0=v_~p~0_163, ~N~0=v_~N~0_199, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1, thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] and [388] L72-->L83: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_110 256) 0)) (= v_~q~0_114 (+ v_~M~0_146 v_~q~0_115)) (< 0 (mod v_~L~0_181 4294967296)) (= v_~L~0_181 (+ v_~L~0_180 1)) (let ((.cse0 (< 1 (mod v_~N~0_285 4294967296)))) (or (and (not .cse0) (= v_~p~0_232 v_~p~0_233) (= v_~N~0_285 v_~N~0_284)) (and .cse0 (= (+ v_~N~0_284 2) v_~N~0_285) (= v_~p~0_232 (+ v_~p~0_233 (* v_~M~0_146 2))))))) InVars {~M~0=v_~M~0_146, ~L~0=v_~L~0_181, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_110, ~q~0=v_~q~0_115, ~p~0=v_~p~0_233, ~N~0=v_~N~0_285} OutVars{~M~0=v_~M~0_146, ~L~0=v_~L~0_180, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_110, ~q~0=v_~q~0_114, ~p~0=v_~p~0_232, ~N~0=v_~N~0_284, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_53|} AuxVars[] AssignedVars[~L~0, ~q~0, ~p~0, ~N~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 07:48:45,765 WARN L322 ript$VariableManager]: TermVariable LBE145 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:45,765 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:45,844 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] $Ultimate##0-->L46-1: Formula: (let ((.cse0 (mod v_~N~0_200 4294967296))) (and (= (+ v_~N~0_199 1) v_~N~0_200) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_79 256) 0)) (= (ite (= (ite (< 1 .cse0) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_63) (= v_~p~0_163 (+ v_~M~0_104 v_~p~0_164)) (= v_thread1Thread1of1ForFork2_~cond~0_79 (ite (= (ite (< 0 .cse0) 1 0) 0) 0 1)))) InVars {~M~0=v_~M~0_104, ~p~0=v_~p~0_164, ~N~0=v_~N~0_200} OutVars{~M~0=v_~M~0_104, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_63, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_49|, ~p~0=v_~p~0_163, ~N~0=v_~N~0_199, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1, thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 07:48:46,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] $Ultimate##0-->L46-1: Formula: (let ((.cse0 (mod v_~N~0_200 4294967296))) (and (= (+ v_~N~0_199 1) v_~N~0_200) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_79 256) 0)) (= (ite (= (ite (< 1 .cse0) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_63) (= v_~p~0_163 (+ v_~M~0_104 v_~p~0_164)) (= v_thread1Thread1of1ForFork2_~cond~0_79 (ite (= (ite (< 0 .cse0) 1 0) 0) 0 1)))) InVars {~M~0=v_~M~0_104, ~p~0=v_~p~0_164, ~N~0=v_~N~0_200} OutVars{~M~0=v_~M~0_104, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_63, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_49|, ~p~0=v_~p~0_163, ~N~0=v_~N~0_199, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1, thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 07:48:46,133 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] $Ultimate##0-->L46-1: Formula: (let ((.cse0 (mod v_~N~0_200 4294967296))) (and (= (+ v_~N~0_199 1) v_~N~0_200) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_79 256) 0)) (= (ite (= (ite (< 1 .cse0) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_63) (= v_~p~0_163 (+ v_~M~0_104 v_~p~0_164)) (= v_thread1Thread1of1ForFork2_~cond~0_79 (ite (= (ite (< 0 .cse0) 1 0) 0) 0 1)))) InVars {~M~0=v_~M~0_104, ~p~0=v_~p~0_164, ~N~0=v_~N~0_200} OutVars{~M~0=v_~M~0_104, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_63, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_49|, ~p~0=v_~p~0_163, ~N~0=v_~N~0_199, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1, thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] and [387] L72-->L53: Formula: (and (let ((.cse0 (< 1 (mod v_~N~0_281 4294967296)))) (or (and (= v_~p~0_228 (+ v_~p~0_229 (* v_~M~0_144 2))) (= (+ v_~N~0_280 2) v_~N~0_281) .cse0) (and (not .cse0) (= v_~p~0_229 v_~p~0_228) (= v_~N~0_281 v_~N~0_280)))) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_108 256) 0)) (= (ite (= (ite (< 0 (mod v_~N~0_280 4294967296)) 1 0) 0) 0 1) v_thread1Thread1of1ForFork2_~cond~0_133)) InVars {~M~0=v_~M~0_144, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_108, ~p~0=v_~p~0_229, ~N~0=v_~N~0_281} OutVars{~M~0=v_~M~0_144, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_108, ~p~0=v_~p~0_228, ~N~0=v_~N~0_280, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_133} AuxVars[] AssignedVars[~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:48:46,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:48:46,461 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [364] $Ultimate##0-->L65-1: Formula: (let ((.cse0 (mod v_~N~0_196 4294967296))) (and (= (ite (= (ite (< 1 .cse0) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_61) (= v_thread1Thread1of1ForFork2_~cond~0_77 (ite (= (ite (< 0 .cse0) 1 0) 0) 0 1)) (= v_~p~0_159 (+ (* v_~M~0_102 2) v_~p~0_160)) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_61 256) 0)) (= v_~N~0_196 (+ v_~N~0_195 2)))) InVars {~M~0=v_~M~0_102, ~p~0=v_~p~0_160, ~N~0=v_~N~0_196} OutVars{~M~0=v_~M~0_102, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_61, ~p~0=v_~p~0_159, ~N~0=v_~N~0_195, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1, ~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 07:48:46,648 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [364] $Ultimate##0-->L65-1: Formula: (let ((.cse0 (mod v_~N~0_196 4294967296))) (and (= (ite (= (ite (< 1 .cse0) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_61) (= v_thread1Thread1of1ForFork2_~cond~0_77 (ite (= (ite (< 0 .cse0) 1 0) 0) 0 1)) (= v_~p~0_159 (+ (* v_~M~0_102 2) v_~p~0_160)) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_61 256) 0)) (= v_~N~0_196 (+ v_~N~0_195 2)))) InVars {~M~0=v_~M~0_102, ~p~0=v_~p~0_160, ~N~0=v_~N~0_196} OutVars{~M~0=v_~M~0_102, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_61, ~p~0=v_~p~0_159, ~N~0=v_~N~0_195, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1, ~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 07:48:46,705 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [336] $Ultimate##0-->L46-1: Formula: (and (= (+ v_~p~0_86 v_~M~0_64) v_~p~0_85) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_29 256) 0)) (= v_thread1Thread1of1ForFork2_~cond~0_29 (ite (= (ite (< 0 (mod v_~N~0_92 4294967296)) 1 0) 0) 0 1)) (= (+ 1 v_~N~0_91) v_~N~0_92)) InVars {~M~0=v_~M~0_64, ~p~0=v_~p~0_86, ~N~0=v_~N~0_92} OutVars{~M~0=v_~M~0_64, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_19|, ~p~0=v_~p~0_85, ~N~0=v_~N~0_91, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_29} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 07:48:46,802 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 07:48:46,804 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4903 [2022-12-06 07:48:46,804 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 2014 transitions, 63835 flow [2022-12-06 07:48:46,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:48:46,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:46,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:46,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 07:48:47,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 07:48:47,009 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:48:47,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:47,009 INFO L85 PathProgramCache]: Analyzing trace with hash -832212199, now seen corresponding path program 1 times [2022-12-06 07:48:47,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:47,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649106625] [2022-12-06 07:48:47,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:47,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:47,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:47,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649106625] [2022-12-06 07:48:47,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649106625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:47,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:47,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:48:47,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848059376] [2022-12-06 07:48:47,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:47,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:48:47,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:47,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:48:47,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:48:47,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 07:48:47,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 2014 transitions, 63835 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:48:47,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:47,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 07:48:47,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:09,581 INFO L130 PetriNetUnfolder]: 23789/37578 cut-off events. [2022-12-06 07:49:09,581 INFO L131 PetriNetUnfolder]: For 2331748/2331748 co-relation queries the response was YES. [2022-12-06 07:49:10,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450337 conditions, 37578 events. 23789/37578 cut-off events. For 2331748/2331748 co-relation queries the response was YES. Maximal size of possible extension queue 2141. Compared 295133 event pairs, 4471 based on Foata normal form. 34/37610 useless extension candidates. Maximal degree in co-relation 446508. Up to 33318 conditions per place. [2022-12-06 07:49:10,436 INFO L137 encePairwiseOnDemand]: 38/66 looper letters, 2053 selfloop transitions, 197 changer transitions 17/2267 dead transitions. [2022-12-06 07:49:10,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 2267 transitions, 76367 flow [2022-12-06 07:49:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:49:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:49:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2022-12-06 07:49:10,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3106060606060606 [2022-12-06 07:49:10,437 INFO L175 Difference]: Start difference. First operand has 319 places, 2014 transitions, 63835 flow. Second operand 6 states and 123 transitions. [2022-12-06 07:49:10,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 2267 transitions, 76367 flow [2022-12-06 07:49:48,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 2267 transitions, 70489 flow, removed 2898 selfloop flow, removed 4 redundant places. [2022-12-06 07:49:48,941 INFO L231 Difference]: Finished difference. Result has 323 places, 2076 transitions, 61913 flow [2022-12-06 07:49:48,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=59446, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1817, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=61913, PETRI_PLACES=323, PETRI_TRANSITIONS=2076} [2022-12-06 07:49:48,942 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 293 predicate places. [2022-12-06 07:49:48,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:48,943 INFO L89 Accepts]: Start accepts. Operand has 323 places, 2076 transitions, 61913 flow [2022-12-06 07:49:48,951 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:48,951 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:48,951 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 323 places, 2076 transitions, 61913 flow [2022-12-06 07:49:48,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 323 places, 2076 transitions, 61913 flow [2022-12-06 07:49:49,767 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][360], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), 806#true, Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 1556#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 1534#(and (= ~N~0 ~L~0) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0)), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 1518#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296)))))), Black: 1362#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1560#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0)), Black: 1361#(or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)), Black: 1512#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 1 (mod ~N~0 4294967296))) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))))))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 1279#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1492#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296)))))), Black: 1454#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 1562#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 1524#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1546#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 1542#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1504#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1558#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 1536#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 1530#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1450#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 1528#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 1036#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 1584#true, Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1332#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 1322#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1588#(and (or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1330#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 1589#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1587#(or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 1328#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 1286#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 1290#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))), Black: 1190#true, Black: 1326#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 42#L83true, 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1348#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 1344#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 1350#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 68#L46-1true, 287#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1173#(and (<= ~p~0 ~q~0) (or (and (< 0 (mod ~L~0 4294967296)) (= (* 2 ~M~0) ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~M~0 ~p~0))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~M~0 ~q~0) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), 1356#true, Black: 1171#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1163#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1181#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1175#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1169#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1165#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1081#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 861#true, Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 827#true, Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:49:49,768 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:49:49,768 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:49:49,768 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:49:49,768 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:49:49,768 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][398], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 1556#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 1534#(and (= ~N~0 ~L~0) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0)), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 1518#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296)))))), Black: 1362#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1560#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0)), Black: 1361#(or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)), Black: 1512#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 1 (mod ~N~0 4294967296))) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))))))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1492#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296)))))), Black: 1454#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 1562#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 1524#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1546#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 1542#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1504#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1558#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 1530#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1450#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 1528#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 1584#true, Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1332#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 1588#(and (or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1322#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1589#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1330#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 1587#(or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 1328#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 806#true, Black: 1279#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 1286#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 1290#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))), Black: 1190#true, Black: 1326#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1348#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1344#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 1350#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 1320#(and (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 287#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 1536#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 48#L65-1true, Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1173#(and (<= ~p~0 ~q~0) (or (and (< 0 (mod ~L~0 4294967296)) (= (* 2 ~M~0) ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~M~0 ~p~0))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~M~0 ~q~0) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1171#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1163#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1181#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1175#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1169#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 26#thread3EXITtrue, Black: 1165#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1081#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 80#L53true, 1161#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1))))), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:49:49,768 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:49:49,768 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:49:49,769 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:49:49,769 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:49:49,769 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L65-1-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_7) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_7, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1][713], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), 806#true, Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 1556#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 1534#(and (= ~N~0 ~L~0) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0)), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 1518#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296)))))), Black: 1362#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1560#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0)), 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1361#(or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)), Black: 1512#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 1 (mod ~N~0 4294967296))) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))))))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1492#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296)))))), Black: 1454#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 1562#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 1524#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1546#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), 6#L72true, Black: 1542#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1504#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1558#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 1536#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 1530#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1528#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 1036#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 1584#true, Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1332#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 1588#(and (or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1322#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1589#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1330#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 1587#(or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 1328#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 1279#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), 1190#true, Black: 1286#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 1290#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))), Black: 1326#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), 1450#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 42#L83true, 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1348#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 1344#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 1350#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 715#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1173#(and (<= ~p~0 ~q~0) (or (and (< 0 (mod ~L~0 4294967296)) (= (* 2 ~M~0) ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~M~0 ~p~0))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~M~0 ~q~0) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1171#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1163#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1181#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1175#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1169#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1165#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1081#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 80#L53true, 861#true, Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 827#true, Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:49:49,769 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:49:49,769 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:49:49,769 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:49:49,769 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:49:50,174 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L65-1-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_7) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_7, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1][1146], [Black: 1016#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), 778#true, 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), 806#true, Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 1556#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1534#(and (= ~N~0 ~L~0) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0)), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 1518#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296)))))), Black: 1362#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1560#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0)), Black: 1361#(or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)), 9#thread1EXITtrue, 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1512#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 1 (mod ~N~0 4294967296))) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))))))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1492#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296)))))), Black: 1454#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 1562#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (not (< 1 (mod ~L~0 4294967296))) (= ~p~0 (* 3 ~q~0))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 1524#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1546#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 1542#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 6#L72true, Black: 1504#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ (* 2 ~M~0) ~p~0 1)) (< (+ (* 2 ~M~0) ~p~0) (+ (* (div (+ (* 2 ~M~0) ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1558#(and (or (and (< (+ 4294967295 ~q~0 (* (div (+ (- 1) (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296)) ~p~0) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1536#(and (or (<= ~L~0 (+ (* (div (+ ~L~0 (- 3)) 4294967296) 4294967296) 4294967296)) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (not (< 1 (mod (+ 4294967295 ~N~0) 4294967296)))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 1530#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1528#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 1036#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 1584#true, Black: 1332#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1322#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1588#(and (or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1589#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1330#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1587#(or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 1328#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 1279#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), 1190#true, Black: 1286#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 1290#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))), Black: 1326#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), 1450#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 42#L83true, 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1348#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 1344#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 1350#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 752#true, Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 715#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 1173#(and (<= ~p~0 ~q~0) (or (and (< 0 (mod ~L~0 4294967296)) (= (* 2 ~M~0) ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~M~0 ~p~0))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~M~0 ~q~0) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1171#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1163#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1181#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1175#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1169#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1165#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 1081#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 861#true, Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 827#true, Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0))]) [2022-12-06 07:49:50,174 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:49:50,174 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:49:50,174 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:49:50,174 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:49:51,826 INFO L130 PetriNetUnfolder]: 3826/9357 cut-off events. [2022-12-06 07:49:51,827 INFO L131 PetriNetUnfolder]: For 456924/462055 co-relation queries the response was YES. [2022-12-06 07:49:51,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102370 conditions, 9357 events. 3826/9357 cut-off events. For 456924/462055 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 97977 event pairs, 35 based on Foata normal form. 342/9539 useless extension candidates. Maximal degree in co-relation 101967. Up to 2571 conditions per place. [2022-12-06 07:49:52,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 323 places, 2076 transitions, 61913 flow [2022-12-06 07:49:52,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 9450 [2022-12-06 07:49:52,071 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:52,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3130 [2022-12-06 07:49:52,072 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 2076 transitions, 61913 flow [2022-12-06 07:49:52,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:52,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:52,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:52,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 07:49:52,073 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:49:52,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1256614804, now seen corresponding path program 1 times [2022-12-06 07:49:52,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:52,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579668608] [2022-12-06 07:49:52,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:52,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:52,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:52,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579668608] [2022-12-06 07:49:52,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579668608] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:52,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177032692] [2022-12-06 07:49:52,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:52,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:52,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:52,353 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:52,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 07:49:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:52,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 07:49:52,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:52,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:52,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177032692] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:52,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:52,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 07:49:52,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487406426] [2022-12-06 07:49:52,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:52,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:49:52,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:52,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:49:52,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:49:52,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 07:49:52,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 2076 transitions, 61913 flow. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:52,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:52,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 07:49:52,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:27,008 INFO L130 PetriNetUnfolder]: 34109/54420 cut-off events. [2022-12-06 07:50:27,009 INFO L131 PetriNetUnfolder]: For 3419808/3419808 co-relation queries the response was YES. [2022-12-06 07:50:28,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615856 conditions, 54420 events. 34109/54420 cut-off events. For 3419808/3419808 co-relation queries the response was YES. Maximal size of possible extension queue 3167. Compared 454665 event pairs, 1938 based on Foata normal form. 708/55126 useless extension candidates. Maximal degree in co-relation 614253. Up to 12935 conditions per place. [2022-12-06 07:50:28,483 INFO L137 encePairwiseOnDemand]: 17/66 looper letters, 1243 selfloop transitions, 2440 changer transitions 33/3716 dead transitions. [2022-12-06 07:50:28,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 3716 transitions, 113899 flow [2022-12-06 07:50:28,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 07:50:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 07:50:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 411 transitions. [2022-12-06 07:50:28,485 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20757575757575758 [2022-12-06 07:50:28,485 INFO L175 Difference]: Start difference. First operand has 323 places, 2076 transitions, 61913 flow. Second operand 30 states and 411 transitions. [2022-12-06 07:50:28,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 3716 transitions, 113899 flow [2022-12-06 07:51:36,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 3716 transitions, 112700 flow, removed 472 selfloop flow, removed 6 redundant places. [2022-12-06 07:51:36,935 INFO L231 Difference]: Finished difference. Result has 368 places, 3091 transitions, 102865 flow [2022-12-06 07:51:36,937 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=61402, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2075, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1511, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=102865, PETRI_PLACES=368, PETRI_TRANSITIONS=3091} [2022-12-06 07:51:36,937 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 338 predicate places. [2022-12-06 07:51:36,937 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:36,938 INFO L89 Accepts]: Start accepts. Operand has 368 places, 3091 transitions, 102865 flow [2022-12-06 07:51:36,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:36,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:36,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 368 places, 3091 transitions, 102865 flow [2022-12-06 07:51:36,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 368 places, 3091 transitions, 102865 flow [2022-12-06 07:51:42,695 INFO L130 PetriNetUnfolder]: 5642/13988 cut-off events. [2022-12-06 07:51:42,695 INFO L131 PetriNetUnfolder]: For 850594/857859 co-relation queries the response was YES. [2022-12-06 07:51:42,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166257 conditions, 13988 events. 5642/13988 cut-off events. For 850594/857859 co-relation queries the response was YES. Maximal size of possible extension queue 1382. Compared 158288 event pairs, 9 based on Foata normal form. 237/14069 useless extension candidates. Maximal degree in co-relation 165705. Up to 3435 conditions per place. [2022-12-06 07:51:42,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 368 places, 3091 transitions, 102865 flow [2022-12-06 07:51:42,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 13270 [2022-12-06 07:51:43,152 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [393] $Ultimate##0-->L83: Formula: (let ((.cse0 (mod v_~N~0_306 4294967296))) (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_118 256) 0)) (= (ite (= (ite (< 1 .cse0) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_118) (= v_~q~0_122 (+ v_~M~0_156 v_~q~0_123)) (= (ite (= (ite (< 0 .cse0) 1 0) 0) 0 1) v_thread1Thread1of1ForFork2_~cond~0_141) (= (+ v_~L~0_188 1) v_~L~0_189) (let ((.cse1 (< 1 (mod (+ v_~N~0_306 4294967295) 4294967296)))) (or (and (= v_~N~0_306 (+ v_~N~0_304 1)) (not .cse1) (= v_~p~0_252 (+ v_~M~0_156 v_~p~0_254))) (and (= v_~p~0_252 (+ (* v_~M~0_156 3) v_~p~0_254)) .cse1 (= v_~N~0_306 (+ v_~N~0_304 3))))) (< 0 (mod v_~L~0_189 4294967296)))) InVars {~M~0=v_~M~0_156, ~L~0=v_~L~0_189, ~q~0=v_~q~0_123, ~p~0=v_~p~0_254, ~N~0=v_~N~0_306} OutVars{~M~0=v_~M~0_156, ~L~0=v_~L~0_188, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_118, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_102|, ~q~0=v_~q~0_122, ~p~0=v_~p~0_252, ~N~0=v_~N~0_304, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_57|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_141} AuxVars[] AssignedVars[~L~0, thread2Thread1of1ForFork0_~cond~1, thread1Thread1of1ForFork2_#t~post1, ~q~0, ~p~0, ~N~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 07:51:43,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 07:51:43,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] $Ultimate##0-->L83: Formula: (let ((.cse0 (mod v_~N~0_353 4294967296))) (and (= (ite (= (ite (< 1 .cse0) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_136) (= v_~N~0_353 (+ v_~N~0_352 2)) (= v_thread1Thread1of1ForFork2_~cond~0_167 (ite (= (ite (< 0 .cse0) 1 0) 0) 0 1)) (< 0 (mod v_~L~0_197 4294967296)) (= (+ v_~M~0_174 v_~q~0_131) v_~q~0_130) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_136 256) 0)) (= v_~p~0_300 (+ v_~p~0_301 (* v_~M~0_174 2))) (= (+ v_~L~0_196 1) v_~L~0_197))) InVars {~M~0=v_~M~0_174, ~L~0=v_~L~0_197, ~q~0=v_~q~0_131, ~p~0=v_~p~0_301, ~N~0=v_~N~0_353} OutVars{~M~0=v_~M~0_174, ~L~0=v_~L~0_196, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_136, ~q~0=v_~q~0_130, ~p~0=v_~p~0_300, ~N~0=v_~N~0_352, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_61|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_167} AuxVars[] AssignedVars[~L~0, thread2Thread1of1ForFork0_~cond~1, ~q~0, ~p~0, ~N~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 07:51:43,753 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:51:43,754 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6817 [2022-12-06 07:51:43,754 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 3091 transitions, 103048 flow [2022-12-06 07:51:43,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:43,754 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:43,754 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:43,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 07:51:43,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:43,962 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:51:43,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:43,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1957277239, now seen corresponding path program 2 times [2022-12-06 07:51:43,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:43,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039069839] [2022-12-06 07:51:43,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:43,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:44,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:44,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039069839] [2022-12-06 07:51:44,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039069839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:51:44,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:51:44,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:51:44,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588119614] [2022-12-06 07:51:44,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:51:44,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:51:44,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:44,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:51:44,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:51:44,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-06 07:51:44,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 3091 transitions, 103048 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:44,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:44,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-06 07:51:44,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:32,766 INFO L130 PetriNetUnfolder]: 34166/54285 cut-off events. [2022-12-06 07:52:32,766 INFO L131 PetriNetUnfolder]: For 3725459/3725459 co-relation queries the response was YES. [2022-12-06 07:52:33,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663250 conditions, 54285 events. 34166/54285 cut-off events. For 3725459/3725459 co-relation queries the response was YES. Maximal size of possible extension queue 3122. Compared 450682 event pairs, 12835 based on Foata normal form. 144/54427 useless extension candidates. Maximal degree in co-relation 661547. Up to 50516 conditions per place. [2022-12-06 07:52:34,269 INFO L137 encePairwiseOnDemand]: 47/71 looper letters, 3051 selfloop transitions, 298 changer transitions 15/3364 dead transitions. [2022-12-06 07:52:34,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 3364 transitions, 118289 flow [2022-12-06 07:52:34,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:52:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:52:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2022-12-06 07:52:34,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30985915492957744 [2022-12-06 07:52:34,270 INFO L175 Difference]: Start difference. First operand has 368 places, 3091 transitions, 103048 flow. Second operand 6 states and 132 transitions. [2022-12-06 07:52:34,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 3364 transitions, 118289 flow [2022-12-06 07:54:26,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 3364 transitions, 112297 flow, removed 2979 selfloop flow, removed 3 redundant places. [2022-12-06 07:54:26,647 INFO L231 Difference]: Finished difference. Result has 371 places, 3141 transitions, 100178 flow [2022-12-06 07:54:26,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=97527, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3081, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=232, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2825, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100178, PETRI_PLACES=371, PETRI_TRANSITIONS=3141} [2022-12-06 07:54:26,650 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 341 predicate places. [2022-12-06 07:54:26,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:26,650 INFO L89 Accepts]: Start accepts. Operand has 371 places, 3141 transitions, 100178 flow [2022-12-06 07:54:26,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:26,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:26,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 371 places, 3141 transitions, 100178 flow [2022-12-06 07:54:26,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 370 places, 3141 transitions, 100178 flow [2022-12-06 07:54:31,941 INFO L130 PetriNetUnfolder]: 5688/13964 cut-off events. [2022-12-06 07:54:31,942 INFO L131 PetriNetUnfolder]: For 719344/723314 co-relation queries the response was YES. [2022-12-06 07:54:32,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157364 conditions, 13964 events. 5688/13964 cut-off events. For 719344/723314 co-relation queries the response was YES. Maximal size of possible extension queue 1343. Compared 156249 event pairs, 10 based on Foata normal form. 201/14015 useless extension candidates. Maximal degree in co-relation 156823. Up to 3312 conditions per place. [2022-12-06 07:54:32,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 370 places, 3141 transitions, 100178 flow [2022-12-06 07:54:32,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 13528 [2022-12-06 07:54:32,301 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:32,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5652 [2022-12-06 07:54:32,302 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 3141 transitions, 100178 flow [2022-12-06 07:54:32,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:32,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:32,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:32,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 07:54:32,303 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:54:32,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash 138788861, now seen corresponding path program 1 times [2022-12-06 07:54:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:32,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783480280] [2022-12-06 07:54:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:32,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:32,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783480280] [2022-12-06 07:54:32,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783480280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:32,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:32,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:54:32,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638149854] [2022-12-06 07:54:32,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:32,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:54:32,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:32,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:54:32,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:54:32,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-06 07:54:32,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 3141 transitions, 100178 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:32,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:32,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-06 07:54:32,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:19,565 INFO L130 PetriNetUnfolder]: 34641/55021 cut-off events. [2022-12-06 07:55:19,566 INFO L131 PetriNetUnfolder]: For 3167558/3167558 co-relation queries the response was YES. [2022-12-06 07:55:20,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632602 conditions, 55021 events. 34641/55021 cut-off events. For 3167558/3167558 co-relation queries the response was YES. Maximal size of possible extension queue 3213. Compared 455565 event pairs, 5097 based on Foata normal form. 16/55035 useless extension candidates. Maximal degree in co-relation 630962. Up to 49507 conditions per place. [2022-12-06 07:55:21,012 INFO L137 encePairwiseOnDemand]: 26/71 looper letters, 2788 selfloop transitions, 585 changer transitions 5/3378 dead transitions. [2022-12-06 07:55:21,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 3378 transitions, 112860 flow [2022-12-06 07:55:21,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:55:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:55:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2022-12-06 07:55:21,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32796780684104626 [2022-12-06 07:55:21,013 INFO L175 Difference]: Start difference. First operand has 370 places, 3141 transitions, 100178 flow. Second operand 7 states and 163 transitions. [2022-12-06 07:55:21,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 3378 transitions, 112860 flow [2022-12-06 07:56:53,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 3378 transitions, 112327 flow, removed 166 selfloop flow, removed 4 redundant places. [2022-12-06 07:56:53,690 INFO L231 Difference]: Finished difference. Result has 375 places, 3203 transitions, 103730 flow [2022-12-06 07:56:53,693 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=99749, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=528, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=103730, PETRI_PLACES=375, PETRI_TRANSITIONS=3203} [2022-12-06 07:56:53,693 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 345 predicate places. [2022-12-06 07:56:53,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:53,694 INFO L89 Accepts]: Start accepts. Operand has 375 places, 3203 transitions, 103730 flow [2022-12-06 07:56:53,727 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:53,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:53,727 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 3203 transitions, 103730 flow [2022-12-06 07:56:53,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 3203 transitions, 103730 flow [2022-12-06 07:56:59,828 INFO L130 PetriNetUnfolder]: 5776/14178 cut-off events. [2022-12-06 07:56:59,828 INFO L131 PetriNetUnfolder]: For 727465/731929 co-relation queries the response was YES. [2022-12-06 07:56:59,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160731 conditions, 14178 events. 5776/14178 cut-off events. For 727465/731929 co-relation queries the response was YES. Maximal size of possible extension queue 1370. Compared 159074 event pairs, 10 based on Foata normal form. 203/14232 useless extension candidates. Maximal degree in co-relation 160185. Up to 3341 conditions per place. [2022-12-06 07:57:00,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 3203 transitions, 103730 flow [2022-12-06 07:57:00,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 13822 [2022-12-06 07:57:00,182 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:57:00,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6490 [2022-12-06 07:57:00,183 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 3203 transitions, 103730 flow [2022-12-06 07:57:00,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:00,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:00,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:00,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 07:57:00,184 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:57:00,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:00,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1379211273, now seen corresponding path program 1 times [2022-12-06 07:57:00,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:00,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934501634] [2022-12-06 07:57:00,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:00,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:00,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:00,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934501634] [2022-12-06 07:57:00,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934501634] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:57:00,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551899977] [2022-12-06 07:57:00,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:00,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:57:00,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:57:00,379 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:57:00,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 07:57:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:00,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 07:57:00,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:57:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:00,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:57:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:00,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551899977] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:57:00,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:57:00,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 07:57:00,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818343317] [2022-12-06 07:57:00,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:57:00,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:57:00,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:00,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:57:00,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:57:00,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-06 07:57:00,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 3203 transitions, 103730 flow. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:00,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:00,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-06 07:57:00,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:58,224 INFO L130 PetriNetUnfolder]: 38055/60053 cut-off events. [2022-12-06 07:57:58,225 INFO L131 PetriNetUnfolder]: For 3935054/3935054 co-relation queries the response was YES. [2022-12-06 07:57:59,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696669 conditions, 60053 events. 38055/60053 cut-off events. For 3935054/3935054 co-relation queries the response was YES. Maximal size of possible extension queue 3382. Compared 498353 event pairs, 3246 based on Foata normal form. 1810/61861 useless extension candidates. Maximal degree in co-relation 694995. Up to 18086 conditions per place. [2022-12-06 07:57:59,502 INFO L137 encePairwiseOnDemand]: 16/71 looper letters, 2049 selfloop transitions, 2030 changer transitions 20/4099 dead transitions. [2022-12-06 07:57:59,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 4099 transitions, 133228 flow [2022-12-06 07:57:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 07:57:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 07:57:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 433 transitions. [2022-12-06 07:57:59,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1967287596547024 [2022-12-06 07:57:59,504 INFO L175 Difference]: Start difference. First operand has 375 places, 3203 transitions, 103730 flow. Second operand 31 states and 433 transitions. [2022-12-06 07:57:59,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 4099 transitions, 133228 flow Received shutdown request... [2022-12-06 07:58:38,275 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:58:38,275 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:58:38,517 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 07:58:38,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 07:58:38,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-06 07:58:38,717 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-06 07:58:38,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 07:58:38,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 07:58:38,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 07:58:38,719 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:38,721 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:58:38,721 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:58:38,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:58:38 BasicIcfg [2022-12-06 07:58:38,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:58:38,724 INFO L158 Benchmark]: Toolchain (without parser) took 792309.64ms. Allocated memory was 189.8MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 166.2MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 4.7GB. Max. memory is 8.0GB. [2022-12-06 07:58:38,724 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 166.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:58:38,724 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.02ms. Allocated memory is still 189.8MB. Free memory was 165.9MB in the beginning and 152.8MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 07:58:38,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.70ms. Allocated memory is still 189.8MB. Free memory was 152.8MB in the beginning and 151.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:58:38,724 INFO L158 Benchmark]: Boogie Preprocessor took 37.86ms. Allocated memory is still 189.8MB. Free memory was 151.3MB in the beginning and 149.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:58:38,725 INFO L158 Benchmark]: RCFGBuilder took 385.60ms. Allocated memory is still 189.8MB. Free memory was 149.7MB in the beginning and 134.0MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 07:58:38,725 INFO L158 Benchmark]: TraceAbstraction took 791530.02ms. Allocated memory was 189.8MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 133.4MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 4.7GB. Max. memory is 8.0GB. [2022-12-06 07:58:38,726 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 166.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 297.02ms. Allocated memory is still 189.8MB. Free memory was 165.9MB in the beginning and 152.8MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.70ms. Allocated memory is still 189.8MB. Free memory was 152.8MB in the beginning and 151.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.86ms. Allocated memory is still 189.8MB. Free memory was 151.3MB in the beginning and 149.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 385.60ms. Allocated memory is still 189.8MB. Free memory was 149.7MB in the beginning and 134.0MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 791530.02ms. Allocated memory was 189.8MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 133.4MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 4.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 82 PlacesBefore, 30 PlacesAfterwards, 79 TransitionsBefore, 23 TransitionsAfterwards, 860 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 31 TrivialYvCompositions, 21 ConcurrentYvCompositions, 4 ChoiceCompositions, 56 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 467, independent: 459, independent conditional: 459, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 467, independent: 459, independent conditional: 0, independent unconditional: 459, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 467, independent: 459, independent conditional: 0, independent unconditional: 459, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 467, independent: 459, independent conditional: 0, independent unconditional: 459, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 435, independent: 430, independent conditional: 0, independent unconditional: 430, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 435, independent: 430, independent conditional: 0, independent unconditional: 430, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 467, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 435, unknown conditional: 0, unknown unconditional: 435] , Statistics on independence cache: Total cache size (in pairs): 666, Positive cache size: 661, Positive conditional cache size: 0, Positive unconditional cache size: 661, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 34 PlacesAfterwards, 35 TransitionsBefore, 33 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 73, independent: 69, independent conditional: 41, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, independent: 69, independent conditional: 41, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, independent: 69, independent conditional: 41, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 73, independent: 55, independent conditional: 29, independent unconditional: 26, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 14, unknown conditional: 12, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 22, Positive conditional cache size: 12, Positive unconditional cache size: 10, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 23, Positive conditional cache size: 12, Positive unconditional cache size: 11, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 23, Positive conditional cache size: 12, Positive unconditional cache size: 11, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 23, Positive conditional cache size: 12, Positive unconditional cache size: 11, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 12, Positive unconditional cache size: 11, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 12, Positive unconditional cache size: 11, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 12, Positive unconditional cache size: 11, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 64 PlacesBefore, 62 PlacesAfterwards, 91 TransitionsBefore, 89 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 34, Positive conditional cache size: 12, Positive unconditional cache size: 22, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 84, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 92 PlacesBefore, 89 PlacesAfterwards, 187 TransitionsBefore, 184 TransitionsAfterwards, 1140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 59, Positive conditional cache size: 34, Positive unconditional cache size: 25, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 90 PlacesAfterwards, 221 TransitionsBefore, 221 TransitionsAfterwards, 1326 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 59, Positive conditional cache size: 34, Positive unconditional cache size: 25, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 247 TransitionsBefore, 247 TransitionsAfterwards, 1474 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 59, Positive conditional cache size: 34, Positive unconditional cache size: 25, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 103 PlacesBefore, 103 PlacesAfterwards, 328 TransitionsBefore, 328 TransitionsAfterwards, 1792 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 62, Positive conditional cache size: 37, Positive unconditional cache size: 25, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 318 TransitionsBefore, 318 TransitionsAfterwards, 1788 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 62, Positive conditional cache size: 37, Positive unconditional cache size: 25, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 113 PlacesBefore, 113 PlacesAfterwards, 406 TransitionsBefore, 406 TransitionsAfterwards, 2210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 74, Positive conditional cache size: 46, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 122 PlacesBefore, 122 PlacesAfterwards, 453 TransitionsBefore, 453 TransitionsAfterwards, 2482 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 82, Positive conditional cache size: 53, Positive unconditional cache size: 29, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 132 PlacesBefore, 132 PlacesAfterwards, 499 TransitionsBefore, 499 TransitionsAfterwards, 2636 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 83, Positive conditional cache size: 54, Positive unconditional cache size: 29, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 138 PlacesBefore, 138 PlacesAfterwards, 495 TransitionsBefore, 495 TransitionsAfterwards, 2604 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 83, Positive conditional cache size: 54, Positive unconditional cache size: 29, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 148 PlacesBefore, 148 PlacesAfterwards, 568 TransitionsBefore, 568 TransitionsAfterwards, 2978 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 153 PlacesBefore, 153 PlacesAfterwards, 557 TransitionsBefore, 557 TransitionsAfterwards, 2960 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 164 PlacesBefore, 164 PlacesAfterwards, 623 TransitionsBefore, 623 TransitionsAfterwards, 3210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 173 PlacesBefore, 173 PlacesAfterwards, 636 TransitionsBefore, 636 TransitionsAfterwards, 3190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 172 PlacesBefore, 172 PlacesAfterwards, 632 TransitionsBefore, 632 TransitionsAfterwards, 3182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 176 PlacesBefore, 176 PlacesAfterwards, 661 TransitionsBefore, 661 TransitionsAfterwards, 3324 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 217 PlacesBefore, 215 PlacesAfterwards, 875 TransitionsBefore, 873 TransitionsAfterwards, 4122 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 87, Positive conditional cache size: 55, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 233 PlacesBefore, 233 PlacesAfterwards, 1030 TransitionsBefore, 1030 TransitionsAfterwards, 4880 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 87, Positive conditional cache size: 55, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 249 PlacesBefore, 249 PlacesAfterwards, 1248 TransitionsBefore, 1248 TransitionsAfterwards, 5706 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 87, Positive conditional cache size: 55, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 256 PlacesBefore, 256 PlacesAfterwards, 1272 TransitionsBefore, 1272 TransitionsAfterwards, 5860 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 87, Positive conditional cache size: 55, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 320 PlacesBefore, 319 PlacesAfterwards, 2015 TransitionsBefore, 2014 TransitionsAfterwards, 9350 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 118, Positive conditional cache size: 86, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 323 PlacesBefore, 323 PlacesAfterwards, 2076 TransitionsBefore, 2076 TransitionsAfterwards, 9450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 118, Positive conditional cache size: 86, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 368 PlacesBefore, 368 PlacesAfterwards, 3091 TransitionsBefore, 3091 TransitionsAfterwards, 13270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 123, Positive conditional cache size: 90, Positive unconditional cache size: 33, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 370 PlacesBefore, 370 PlacesAfterwards, 3141 TransitionsBefore, 3141 TransitionsAfterwards, 13528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 123, Positive conditional cache size: 90, Positive unconditional cache size: 33, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 375 PlacesBefore, 375 PlacesAfterwards, 3203 TransitionsBefore, 3203 TransitionsAfterwards, 13822 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 123, Positive conditional cache size: 90, Positive unconditional cache size: 33, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 108 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 791.4s, OverallIterations: 34, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 732.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 3431 SdHoareTripleChecker+Valid, 34.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3431 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 31.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 1651 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14099 IncrementalHoareTripleChecker+Invalid, 15755 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1651 mSolverCounterUnsat, 128 mSDtfsCounter, 14099 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 713 GetRequests, 354 SyntacticMatches, 9 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1911 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103730occurred in iteration=33, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 835 NumberOfCodeBlocks, 835 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 973 ConstructedInterpolants, 14 QuantifiedInterpolants, 10284 SizeOfPredicates, 39 NumberOfNonLiveVariables, 1671 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 54 InterpolantComputations, 25 PerfectInterpolantSequences, 27/63 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown