/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-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:41:36,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:41:36,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:41:36,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:41:36,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:41:36,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:41:36,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:41:36,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:41:36,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:41:36,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:41:36,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:41:36,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:41:36,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:41:36,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:41:36,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:41:36,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:41:36,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:41:36,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:41:36,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:41:36,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:41:36,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:41:36,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:41:36,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:41:36,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:41:36,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:41:36,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:41:36,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:41:36,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:41:36,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:41:36,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:41:36,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:41:36,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:41:36,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:41:36,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:41:36,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:41:36,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:41:36,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:41:36,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:41:36,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:41:36,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:41:36,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:41:36,754 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:41:36,782 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:41:36,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:41:36,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:41:36,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:41:36,785 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:41:36,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:41:36,786 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:41:36,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:41:36,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:41:36,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:41:36,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:41:36,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:41:36,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:41:36,787 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:41:36,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:41:36,787 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:41:36,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:41:36,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:41:36,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:41:36,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:41:36,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:41:36,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:41:36,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:41:36,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:41:36,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:41:36,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:41:36,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:41:36,788 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:41:36,788 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:41:37,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:41:37,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:41:37,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:41:37,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:41:37,211 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:41:37,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-12-06 07:41:38,295 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:41:38,477 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:41:38,477 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-12-06 07:41:38,482 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61948835e/0a860f2d21a3499c94e893c7df41abe0/FLAGc99e4a550 [2022-12-06 07:41:38,493 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61948835e/0a860f2d21a3499c94e893c7df41abe0 [2022-12-06 07:41:38,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:41:38,496 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:41:38,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:41:38,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:41:38,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:41:38,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:41:38" (1/1) ... [2022-12-06 07:41:38,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18cfe17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:38, skipping insertion in model container [2022-12-06 07:41:38,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:41:38" (1/1) ... [2022-12-06 07:41:38,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:41:38,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:41:38,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:38,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:38,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:38,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:38,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:38,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:38,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:38,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:38,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:38,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:38,654 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-more-inc-subseq.wvr.c[2924,2937] [2022-12-06 07:41:38,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:41:38,668 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:41:38,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:38,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:38,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:38,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:38,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:38,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:38,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:38,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:38,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:38,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:38,698 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-more-inc-subseq.wvr.c[2924,2937] [2022-12-06 07:41:38,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:41:38,712 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:41:38,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:38 WrapperNode [2022-12-06 07:41:38,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:41:38,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:41:38,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:41:38,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:41:38,719 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:41:38" (1/1) ... [2022-12-06 07:41:38,735 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:41:38" (1/1) ... [2022-12-06 07:41:38,767 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-12-06 07:41:38,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:41:38,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:41:38,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:41:38,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:41:38,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:41:38" (1/1) ... [2022-12-06 07:41:38,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:41:38" (1/1) ... [2022-12-06 07:41:38,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:38" (1/1) ... [2022-12-06 07:41:38,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:38" (1/1) ... [2022-12-06 07:41:38,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:38" (1/1) ... [2022-12-06 07:41:38,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:38" (1/1) ... [2022-12-06 07:41:38,796 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:38" (1/1) ... [2022-12-06 07:41:38,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:38" (1/1) ... [2022-12-06 07:41:38,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:41:38,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:41:38,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:41:38,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:41:38,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:38" (1/1) ... [2022-12-06 07:41:38,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:41:38,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:41:38,848 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:41:38,883 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:41:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:41:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:41:38,896 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:41:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:41:38,896 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:41:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:41:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:41:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:41:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:41:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:41:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:41:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:41:38,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:41:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:41:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:41:38,898 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:41:39,018 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:41:39,019 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:41:39,247 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:41:39,306 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:41:39,306 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 07:41:39,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:41:39 BoogieIcfgContainer [2022-12-06 07:41:39,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:41:39,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:41:39,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:41:39,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:41:39,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:41:38" (1/3) ... [2022-12-06 07:41:39,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:41:39, skipping insertion in model container [2022-12-06 07:41:39,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:38" (2/3) ... [2022-12-06 07:41:39,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:41:39, skipping insertion in model container [2022-12-06 07:41:39,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:41:39" (3/3) ... [2022-12-06 07:41:39,313 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2022-12-06 07:41:39,324 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:41:39,324 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:41:39,324 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:41:39,369 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:41:39,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 173 transitions, 362 flow [2022-12-06 07:41:39,488 INFO L130 PetriNetUnfolder]: 15/171 cut-off events. [2022-12-06 07:41:39,488 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:41:39,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 15/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-06 07:41:39,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 173 transitions, 362 flow [2022-12-06 07:41:39,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2022-12-06 07:41:39,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:39,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-06 07:41:39,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2022-12-06 07:41:39,582 INFO L130 PetriNetUnfolder]: 15/163 cut-off events. [2022-12-06 07:41:39,582 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:41:39,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 163 events. 15/163 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-06 07:41:39,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-06 07:41:39,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-06 07:41:44,629 INFO L203 LiptonReduction]: Total number of compositions: 140 [2022-12-06 07:41:44,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:41:44,643 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;@7d2e277d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:41:44,643 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:41:44,647 INFO L130 PetriNetUnfolder]: 5/22 cut-off events. [2022-12-06 07:41:44,647 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:41:44,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:41:44,659 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:41:44,659 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:41:44,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:41:44,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1533171233, now seen corresponding path program 1 times [2022-12-06 07:41:44,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:41:44,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014707774] [2022-12-06 07:41:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:41:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:44,945 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:41:44,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:41:44,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014707774] [2022-12-06 07:41:44,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014707774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:41:44,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:41:44,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:41:44,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185313739] [2022-12-06 07:41:44,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:41:44,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:41:44,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:41:44,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:41:44,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:41:44,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:41:44,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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:41:44,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:41:44,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:41:44,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:41:45,060 INFO L130 PetriNetUnfolder]: 146/245 cut-off events. [2022-12-06 07:41:45,060 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 07:41:45,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 245 events. 146/245 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 773 event pairs, 38 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 472. Up to 153 conditions per place. [2022-12-06 07:41:45,062 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 31 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-06 07:41:45,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 155 flow [2022-12-06 07:41:45,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:41:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:41:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 07:41:45,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-06 07:41:45,071 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 4 states and 36 transitions. [2022-12-06 07:41:45,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 155 flow [2022-12-06 07:41:45,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:41:45,074 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 71 flow [2022-12-06 07:41:45,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2022-12-06 07:41:45,077 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2022-12-06 07:41:45,077 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:41:45,078 INFO L89 Accepts]: Start accepts. Operand has 25 places, 25 transitions, 71 flow [2022-12-06 07:41:45,087 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:41:45,087 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:45,087 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 25 transitions, 71 flow [2022-12-06 07:41:45,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 71 flow [2022-12-06 07:41:45,091 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-06 07:41:45,092 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:41:45,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 29 events. 6/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 23. Up to 6 conditions per place. [2022-12-06 07:41:45,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 71 flow [2022-12-06 07:41:45,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 07:41:45,103 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:41:45,104 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 07:41:45,104 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 71 flow [2022-12-06 07:41:45,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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:41:45,104 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:41:45,104 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:41:45,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:41:45,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:41:45,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:41:45,105 INFO L85 PathProgramCache]: Analyzing trace with hash 908602455, now seen corresponding path program 1 times [2022-12-06 07:41:45,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:41:45,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521602594] [2022-12-06 07:41:45,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:45,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:41:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:45,253 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:41:45,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:41:45,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521602594] [2022-12-06 07:41:45,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521602594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:41:45,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:41:45,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:41:45,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627549615] [2022-12-06 07:41:45,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:41:45,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:41:45,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:41:45,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:41:45,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:41:45,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:41:45,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:41:45,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:41:45,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:41:45,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:41:45,329 INFO L130 PetriNetUnfolder]: 146/246 cut-off events. [2022-12-06 07:41:45,329 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 07:41:45,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 246 events. 146/246 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 769 event pairs, 38 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 182. Up to 153 conditions per place. [2022-12-06 07:41:45,331 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 31 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2022-12-06 07:41:45,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 36 transitions, 166 flow [2022-12-06 07:41:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:41:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:41:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 07:41:45,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2022-12-06 07:41:45,332 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 71 flow. Second operand 4 states and 37 transitions. [2022-12-06 07:41:45,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 36 transitions, 166 flow [2022-12-06 07:41:45,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:41:45,334 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 84 flow [2022-12-06 07:41:45,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=27, PETRI_TRANSITIONS=26} [2022-12-06 07:41:45,334 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2022-12-06 07:41:45,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:41:45,334 INFO L89 Accepts]: Start accepts. Operand has 27 places, 26 transitions, 84 flow [2022-12-06 07:41:45,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:41:45,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:45,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 26 transitions, 84 flow [2022-12-06 07:41:45,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 84 flow [2022-12-06 07:41:45,338 INFO L130 PetriNetUnfolder]: 6/30 cut-off events. [2022-12-06 07:41:45,338 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:41:45,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 30 events. 6/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 33. Up to 6 conditions per place. [2022-12-06 07:41:45,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 26 transitions, 84 flow [2022-12-06 07:41:45,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 07:41:45,586 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:41:45,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-06 07:41:45,587 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 80 flow [2022-12-06 07:41:45,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:41:45,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:41:45,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:41:45,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:41:45,588 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:41:45,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:41:45,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1878813032, now seen corresponding path program 1 times [2022-12-06 07:41:45,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:41:45,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214078101] [2022-12-06 07:41:45,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:45,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:41:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:45,675 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:41:45,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:41:45,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214078101] [2022-12-06 07:41:45,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214078101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:41:45,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:41:45,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:41:45,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575460453] [2022-12-06 07:41:45,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:41:45,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:41:45,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:41:45,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:41:45,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:41:45,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:41:45,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:41:45,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:41:45,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:41:45,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:41:45,773 INFO L130 PetriNetUnfolder]: 228/381 cut-off events. [2022-12-06 07:41:45,774 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 07:41:45,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 381 events. 228/381 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1410 event pairs, 40 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 858. Up to 212 conditions per place. [2022-12-06 07:41:45,777 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 36 selfloop transitions, 16 changer transitions 0/52 dead transitions. [2022-12-06 07:41:45,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 52 transitions, 266 flow [2022-12-06 07:41:45,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:41:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:41:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 07:41:45,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-06 07:41:45,779 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 80 flow. Second operand 5 states and 48 transitions. [2022-12-06 07:41:45,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 52 transitions, 266 flow [2022-12-06 07:41:45,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 52 transitions, 244 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:41:45,782 INFO L231 Difference]: Finished difference. Result has 30 places, 39 transitions, 181 flow [2022-12-06 07:41:45,782 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=30, PETRI_TRANSITIONS=39} [2022-12-06 07:41:45,783 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2022-12-06 07:41:45,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:41:45,783 INFO L89 Accepts]: Start accepts. Operand has 30 places, 39 transitions, 181 flow [2022-12-06 07:41:45,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:41:45,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:45,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 39 transitions, 181 flow [2022-12-06 07:41:45,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 39 transitions, 181 flow [2022-12-06 07:41:45,790 INFO L130 PetriNetUnfolder]: 29/82 cut-off events. [2022-12-06 07:41:45,790 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 07:41:45,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 82 events. 29/82 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 256 event pairs, 1 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 168. Up to 28 conditions per place. [2022-12-06 07:41:45,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 39 transitions, 181 flow [2022-12-06 07:41:45,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 07:41:45,798 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:41:45,799 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 07:41:45,799 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 39 transitions, 181 flow [2022-12-06 07:41:45,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:41:45,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:41:45,799 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:41:45,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:41:45,799 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:41:45,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:41:45,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1128489956, now seen corresponding path program 2 times [2022-12-06 07:41:45,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:41:45,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13453095] [2022-12-06 07:41:45,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:45,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:41:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:45,860 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:41:45,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:41:45,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13453095] [2022-12-06 07:41:45,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13453095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:41:45,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:41:45,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:41:45,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587793972] [2022-12-06 07:41:45,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:41:45,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:41:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:41:45,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:41:45,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:41:45,862 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 07:41:45,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 39 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 6.0) 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:41:45,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:41:45,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 07:41:45,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:41:45,919 INFO L130 PetriNetUnfolder]: 296/490 cut-off events. [2022-12-06 07:41:45,919 INFO L131 PetriNetUnfolder]: For 453/462 co-relation queries the response was YES. [2022-12-06 07:41:45,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 490 events. 296/490 cut-off events. For 453/462 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1909 event pairs, 100 based on Foata normal form. 5/449 useless extension candidates. Maximal degree in co-relation 874. Up to 263 conditions per place. [2022-12-06 07:41:45,922 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 46 selfloop transitions, 5 changer transitions 2/55 dead transitions. [2022-12-06 07:41:45,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 55 transitions, 358 flow [2022-12-06 07:41:45,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:41:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:41:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 07:41:45,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-06 07:41:45,924 INFO L175 Difference]: Start difference. First operand has 30 places, 39 transitions, 181 flow. Second operand 3 states and 39 transitions. [2022-12-06 07:41:45,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 55 transitions, 358 flow [2022-12-06 07:41:45,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 55 transitions, 354 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 07:41:45,929 INFO L231 Difference]: Finished difference. Result has 33 places, 41 transitions, 207 flow [2022-12-06 07:41:45,929 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=33, PETRI_TRANSITIONS=41} [2022-12-06 07:41:45,930 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2022-12-06 07:41:45,930 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:41:45,930 INFO L89 Accepts]: Start accepts. Operand has 33 places, 41 transitions, 207 flow [2022-12-06 07:41:45,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:41:45,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:45,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 41 transitions, 207 flow [2022-12-06 07:41:45,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 41 transitions, 207 flow [2022-12-06 07:41:45,940 INFO L130 PetriNetUnfolder]: 37/101 cut-off events. [2022-12-06 07:41:45,940 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-06 07:41:45,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 101 events. 37/101 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 336 event pairs, 2 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 243. Up to 38 conditions per place. [2022-12-06 07:41:45,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 41 transitions, 207 flow [2022-12-06 07:41:45,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 07:41:45,948 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:41:45,954 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 07:41:45,954 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 41 transitions, 207 flow [2022-12-06 07:41:45,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) 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:41:45,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:41:45,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:41:45,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:41:45,954 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:41:45,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:41:45,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1026730500, now seen corresponding path program 1 times [2022-12-06 07:41:45,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:41:45,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933538858] [2022-12-06 07:41:45,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:45,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:41:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:41:46,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:41:46,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933538858] [2022-12-06 07:41:46,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933538858] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:41:46,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131256824] [2022-12-06 07:41:46,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:46,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:41:46,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:41:46,132 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:41:46,155 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:41:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:46,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:41:46,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:41:46,250 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:41:46,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:41:46,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131256824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:41:46,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:41:46,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-06 07:41:46,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652034352] [2022-12-06 07:41:46,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:41:46,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:41:46,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:41:46,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:41:46,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:41:46,251 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:41:46,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 41 transitions, 207 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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:41:46,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:41:46,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:41:46,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:41:46,311 INFO L130 PetriNetUnfolder]: 304/527 cut-off events. [2022-12-06 07:41:46,311 INFO L131 PetriNetUnfolder]: For 445/445 co-relation queries the response was YES. [2022-12-06 07:41:46,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 527 events. 304/527 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2076 event pairs, 82 based on Foata normal form. 30/524 useless extension candidates. Maximal degree in co-relation 1085. Up to 374 conditions per place. [2022-12-06 07:41:46,314 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 50 selfloop transitions, 2 changer transitions 5/57 dead transitions. [2022-12-06 07:41:46,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 57 transitions, 389 flow [2022-12-06 07:41:46,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:41:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:41:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 07:41:46,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2022-12-06 07:41:46,315 INFO L175 Difference]: Start difference. First operand has 33 places, 41 transitions, 207 flow. Second operand 3 states and 37 transitions. [2022-12-06 07:41:46,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 57 transitions, 389 flow [2022-12-06 07:41:46,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 57 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:41:46,317 INFO L231 Difference]: Finished difference. Result has 35 places, 41 transitions, 214 flow [2022-12-06 07:41:46,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=35, PETRI_TRANSITIONS=41} [2022-12-06 07:41:46,318 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2022-12-06 07:41:46,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:41:46,318 INFO L89 Accepts]: Start accepts. Operand has 35 places, 41 transitions, 214 flow [2022-12-06 07:41:46,319 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:41:46,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:46,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 41 transitions, 214 flow [2022-12-06 07:41:46,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 41 transitions, 214 flow [2022-12-06 07:41:46,327 INFO L130 PetriNetUnfolder]: 37/114 cut-off events. [2022-12-06 07:41:46,327 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 07:41:46,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 114 events. 37/114 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 429 event pairs, 2 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 263. Up to 33 conditions per place. [2022-12-06 07:41:46,328 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 41 transitions, 214 flow [2022-12-06 07:41:46,328 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 07:41:46,329 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:41:46,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 07:41:46,329 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 41 transitions, 214 flow [2022-12-06 07:41:46,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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:41:46,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:41:46,330 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:41:46,341 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:41:46,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:41:46,536 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:41:46,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:41:46,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1914271914, now seen corresponding path program 1 times [2022-12-06 07:41:46,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:41:46,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451580871] [2022-12-06 07:41:46,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:46,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:41:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:46,612 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:41:46,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:41:46,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451580871] [2022-12-06 07:41:46,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451580871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:41:46,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:41:46,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:41:46,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111788679] [2022-12-06 07:41:46,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:41:46,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:41:46,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:41:46,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:41:46,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:41:46,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 07:41:46,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 41 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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:41:46,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:41:46,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 07:41:46,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:41:46,731 INFO L130 PetriNetUnfolder]: 344/631 cut-off events. [2022-12-06 07:41:46,731 INFO L131 PetriNetUnfolder]: For 799/816 co-relation queries the response was YES. [2022-12-06 07:41:46,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 631 events. 344/631 cut-off events. For 799/816 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2836 event pairs, 212 based on Foata normal form. 33/601 useless extension candidates. Maximal degree in co-relation 1467. Up to 476 conditions per place. [2022-12-06 07:41:46,734 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 38 selfloop transitions, 2 changer transitions 20/62 dead transitions. [2022-12-06 07:41:46,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 62 transitions, 424 flow [2022-12-06 07:41:46,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:41:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:41:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 07:41:46,736 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2022-12-06 07:41:46,737 INFO L175 Difference]: Start difference. First operand has 35 places, 41 transitions, 214 flow. Second operand 4 states and 43 transitions. [2022-12-06 07:41:46,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 62 transitions, 424 flow [2022-12-06 07:41:46,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 62 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:41:46,743 INFO L231 Difference]: Finished difference. Result has 39 places, 42 transitions, 226 flow [2022-12-06 07:41:46,743 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=39, PETRI_TRANSITIONS=42} [2022-12-06 07:41:46,745 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2022-12-06 07:41:46,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:41:46,745 INFO L89 Accepts]: Start accepts. Operand has 39 places, 42 transitions, 226 flow [2022-12-06 07:41:46,746 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:41:46,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:46,747 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 42 transitions, 226 flow [2022-12-06 07:41:46,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 42 transitions, 226 flow [2022-12-06 07:41:46,757 INFO L130 PetriNetUnfolder]: 37/115 cut-off events. [2022-12-06 07:41:46,757 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-06 07:41:46,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 115 events. 37/115 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 425 event pairs, 2 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 293. Up to 33 conditions per place. [2022-12-06 07:41:46,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 42 transitions, 226 flow [2022-12-06 07:41:46,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 07:41:47,631 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:41:47,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 887 [2022-12-06 07:41:47,632 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 41 transitions, 222 flow [2022-12-06 07:41:47,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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:41:47,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:41:47,632 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:41:47,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:41:47,633 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:41:47,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:41:47,633 INFO L85 PathProgramCache]: Analyzing trace with hash 788331176, now seen corresponding path program 1 times [2022-12-06 07:41:47,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:41:47,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871141247] [2022-12-06 07:41:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:47,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:41:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:48,649 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:41:48,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:41:48,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871141247] [2022-12-06 07:41:48,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871141247] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:41:48,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622658359] [2022-12-06 07:41:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:48,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:41:48,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:41:48,651 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:41:48,654 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:41:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:48,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 07:41:48,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:41:48,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 07:41:48,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:41:48,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:41:48,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:41:48,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:41:49,052 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-06 07:41:49,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 10 [2022-12-06 07:41:49,072 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:41:49,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:41:49,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:41:49,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 97 [2022-12-06 07:41:50,015 INFO L321 Elim1Store]: treesize reduction 15, result has 89.4 percent of original size [2022-12-06 07:41:50,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1382 treesize of output 1293 [2022-12-06 07:41:50,046 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:41:50,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1166 treesize of output 1115 [2022-12-06 07:41:50,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:41:50,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1074 treesize of output 931 [2022-12-06 07:41:50,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:41:50,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 890 treesize of output 865 [2022-12-06 07:41:50,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:41:50,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 850 treesize of output 785 [2022-12-06 07:41:53,885 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:41:53,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622658359] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:41:53,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:41:53,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 07:41:53,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250119664] [2022-12-06 07:41:53,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:41:53,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 07:41:53,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:41:53,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 07:41:53,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=408, Unknown=6, NotChecked=0, Total=552 [2022-12-06 07:41:53,887 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:41:53,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 41 transitions, 222 flow. Second operand has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 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:41:53,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:41:53,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:41:53,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:41:57,292 INFO L130 PetriNetUnfolder]: 1112/1951 cut-off events. [2022-12-06 07:41:57,292 INFO L131 PetriNetUnfolder]: For 2022/2022 co-relation queries the response was YES. [2022-12-06 07:41:57,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6618 conditions, 1951 events. 1112/1951 cut-off events. For 2022/2022 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10676 event pairs, 139 based on Foata normal form. 33/1859 useless extension candidates. Maximal degree in co-relation 6600. Up to 489 conditions per place. [2022-12-06 07:41:57,300 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 175 selfloop transitions, 86 changer transitions 56/317 dead transitions. [2022-12-06 07:41:57,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 317 transitions, 2182 flow [2022-12-06 07:41:57,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 07:41:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 07:41:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 247 transitions. [2022-12-06 07:41:57,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38354037267080743 [2022-12-06 07:41:57,302 INFO L175 Difference]: Start difference. First operand has 37 places, 41 transitions, 222 flow. Second operand 28 states and 247 transitions. [2022-12-06 07:41:57,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 317 transitions, 2182 flow [2022-12-06 07:41:57,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 317 transitions, 2150 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 07:41:57,314 INFO L231 Difference]: Finished difference. Result has 76 places, 129 transitions, 1099 flow [2022-12-06 07:41:57,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1099, PETRI_PLACES=76, PETRI_TRANSITIONS=129} [2022-12-06 07:41:57,314 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 51 predicate places. [2022-12-06 07:41:57,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:41:57,315 INFO L89 Accepts]: Start accepts. Operand has 76 places, 129 transitions, 1099 flow [2022-12-06 07:41:57,316 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:41:57,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:57,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 129 transitions, 1099 flow [2022-12-06 07:41:57,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 129 transitions, 1099 flow [2022-12-06 07:41:57,346 INFO L130 PetriNetUnfolder]: 172/451 cut-off events. [2022-12-06 07:41:57,347 INFO L131 PetriNetUnfolder]: For 1436/1453 co-relation queries the response was YES. [2022-12-06 07:41:57,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 451 events. 172/451 cut-off events. For 1436/1453 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2508 event pairs, 2 based on Foata normal form. 4/411 useless extension candidates. Maximal degree in co-relation 1679. Up to 148 conditions per place. [2022-12-06 07:41:57,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 129 transitions, 1099 flow [2022-12-06 07:41:57,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-06 07:41:59,919 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:42:00,014 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:42:00,085 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [696] $Ultimate##0-->L79: Formula: (and (= v_~new~0_64 v_~v_old~0_84) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_97 256) 0)) (<= v_~v_old~0_85 v_~new~0_64)) 1 0) 0) 0 1) v_~ok~0_96) (= (+ v_~start~0_150 1) v_~start~0_149) (= (ite (and (< v_~start~0_150 v_~end~0_184) (<= 0 v_~start~0_150) (< v_~start~0_150 v_~n~0_106)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork1_~cond~0#1_72| (ite (= (ite (or (< v_~start~0_149 v_~end~0_184) (< v_~i~0_186 v_~N~0_155)) 1 0) 0) 0 1)) (= v_~new~0_64 (select (select |v_#memory_int_262| v_~queue~0.base_102) (+ (* v_~start~0_150 4) v_~queue~0.offset_102)))) InVars {~start~0=v_~start~0_150, ~queue~0.offset=v_~queue~0.offset_102, ~ok~0=v_~ok~0_97, ~i~0=v_~i~0_186, #memory_int=|v_#memory_int_262|, ~end~0=v_~end~0_184, ~N~0=v_~N~0_155, ~v_old~0=v_~v_old~0_85, ~queue~0.base=v_~queue~0.base_102, ~n~0=v_~n~0_106} OutVars{~start~0=v_~start~0_149, ~new~0=v_~new~0_64, ~queue~0.offset=v_~queue~0.offset_102, ~ok~0=v_~ok~0_96, ~i~0=v_~i~0_186, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~N~0=v_~N~0_155, ~queue~0.base=v_~queue~0.base_102, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_21|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_72|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_262|, ~end~0=v_~end~0_184, ~v_old~0=v_~v_old~0_84, ~n~0=v_~n~0_106} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:42:00,162 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:42:00,237 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [591] L49-4-->L59: Formula: (= v_~i~0_59 (+ v_~i~0_60 1)) InVars {~i~0=v_~i~0_60} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|, ~i~0=v_~i~0_59, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:42:00,273 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:42:00,361 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:42:00,393 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [591] L49-4-->L59: Formula: (= v_~i~0_59 (+ v_~i~0_60 1)) InVars {~i~0=v_~i~0_60} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|, ~i~0=v_~i~0_59, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:42:10,553 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 07:42:10,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13240 [2022-12-06 07:42:10,554 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 123 transitions, 1140 flow [2022-12-06 07:42:10,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 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:42:10,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:10,554 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:42:10,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 07:42:10,759 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,SelfDestructingSolverStorable6 [2022-12-06 07:42:10,760 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:42:10,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:42:10,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1802932544, now seen corresponding path program 1 times [2022-12-06 07:42:10,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:42:10,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954090750] [2022-12-06 07:42:10,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:10,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:42:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:11,290 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:42:11,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:42:11,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954090750] [2022-12-06 07:42:11,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954090750] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:42:11,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633573458] [2022-12-06 07:42:11,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:11,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:11,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:42:11,292 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:42:11,294 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:42:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:11,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 07:42:11,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:42:11,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-06 07:42:11,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 198 [2022-12-06 07:42:11,403 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 07:42:11,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-06 07:42:11,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:42:11,508 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 07:42:11,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2022-12-06 07:42:11,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-06 07:42:11,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 07:42:11,685 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:42:11,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:42:11,990 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:42:11,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633573458] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:42:11,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:42:11,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 07:42:11,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211441218] [2022-12-06 07:42:11,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:42:11,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:42:11,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:42:11,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:42:11,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-12-06 07:42:11,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 07:42:11,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 123 transitions, 1140 flow. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 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:42:11,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:42:11,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 07:42:11,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:42:14,372 INFO L130 PetriNetUnfolder]: 2078/3657 cut-off events. [2022-12-06 07:42:14,372 INFO L131 PetriNetUnfolder]: For 12819/12819 co-relation queries the response was YES. [2022-12-06 07:42:14,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16131 conditions, 3657 events. 2078/3657 cut-off events. For 12819/12819 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 22602 event pairs, 253 based on Foata normal form. 52/3487 useless extension candidates. Maximal degree in co-relation 16082. Up to 1172 conditions per place. [2022-12-06 07:42:14,390 INFO L137 encePairwiseOnDemand]: 6/36 looper letters, 273 selfloop transitions, 197 changer transitions 69/539 dead transitions. [2022-12-06 07:42:14,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 539 transitions, 5281 flow [2022-12-06 07:42:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 07:42:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 07:42:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 319 transitions. [2022-12-06 07:42:14,393 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28584229390681004 [2022-12-06 07:42:14,393 INFO L175 Difference]: Start difference. First operand has 66 places, 123 transitions, 1140 flow. Second operand 31 states and 319 transitions. [2022-12-06 07:42:14,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 539 transitions, 5281 flow [2022-12-06 07:42:14,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 539 transitions, 4514 flow, removed 257 selfloop flow, removed 11 redundant places. [2022-12-06 07:42:14,457 INFO L231 Difference]: Finished difference. Result has 110 places, 279 transitions, 2938 flow [2022-12-06 07:42:14,457 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2938, PETRI_PLACES=110, PETRI_TRANSITIONS=279} [2022-12-06 07:42:14,457 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 85 predicate places. [2022-12-06 07:42:14,457 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:42:14,457 INFO L89 Accepts]: Start accepts. Operand has 110 places, 279 transitions, 2938 flow [2022-12-06 07:42:14,463 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:42:14,463 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:42:14,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 279 transitions, 2938 flow [2022-12-06 07:42:14,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 279 transitions, 2938 flow [2022-12-06 07:42:14,555 INFO L130 PetriNetUnfolder]: 427/1100 cut-off events. [2022-12-06 07:42:14,555 INFO L131 PetriNetUnfolder]: For 5961/5993 co-relation queries the response was YES. [2022-12-06 07:42:14,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5394 conditions, 1100 events. 427/1100 cut-off events. For 5961/5993 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7841 event pairs, 19 based on Foata normal form. 6/1094 useless extension candidates. Maximal degree in co-relation 5328. Up to 405 conditions per place. [2022-12-06 07:42:14,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 279 transitions, 2938 flow [2022-12-06 07:42:14,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 1014 [2022-12-06 07:42:14,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:42:14,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [698] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_80| (ite (= (ite (or (< v_~start~0_157 v_~end~0_188) (< v_~i~0_193 v_~N~0_159)) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= v_~start~0_157 (+ v_~start~0_158 1)) (= (+ v_~i~0_193 1) v_~i~0_192) (= v_~new~0_68 v_~v_old~0_92) (= (ite (= (ite (and (<= v_~v_old~0_93 v_~new~0_68) (not (= (mod v_~ok~0_105 256) 0))) 1 0) 0) 0 1) v_~ok~0_104) (= v_~new~0_68 (select (select |v_#memory_int_266| v_~queue~0.base_106) (+ v_~queue~0.offset_106 (* v_~start~0_158 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= (ite (and (< v_~start~0_158 v_~end~0_188) (< v_~start~0_158 v_~n~0_110) (<= 0 v_~start~0_158)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|)) InVars {~start~0=v_~start~0_158, ~queue~0.offset=v_~queue~0.offset_106, ~ok~0=v_~ok~0_105, ~i~0=v_~i~0_193, #memory_int=|v_#memory_int_266|, ~end~0=v_~end~0_188, ~N~0=v_~N~0_159, ~v_old~0=v_~v_old~0_93, ~queue~0.base=v_~queue~0.base_106, ~n~0=v_~n~0_110} OutVars{~start~0=v_~start~0_157, ~new~0=v_~new~0_68, ~queue~0.offset=v_~queue~0.offset_106, ~ok~0=v_~ok~0_104, ~i~0=v_~i~0_192, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~N~0=v_~N~0_159, ~queue~0.base=v_~queue~0.base_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_47|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_80|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_35|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_266|, ~end~0=v_~end~0_188, ~v_old~0=v_~v_old~0_92, ~n~0=v_~n~0_110} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:42:14,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [699] L79-->L59: Formula: (and (= (ite (and (<= 0 v_~start~0_162) (< v_~start~0_162 v_~n~0_112) (< v_~start~0_162 v_~end~0_190)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|) (= v_~new~0_70 v_~v_old~0_96) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_83| 256) 0)) (= |v_thread2Thread1of1ForFork1_~cond~0#1_82| (ite (= (ite (or (< v_~i~0_197 v_~N~0_161) (< v_~start~0_161 v_~end~0_190)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= (+ v_~start~0_162 1) v_~start~0_161) (= (ite (= (ite (and (not (= (mod v_~ok~0_109 256) 0)) (<= v_~v_old~0_97 v_~new~0_70)) 1 0) 0) 0 1) v_~ok~0_108) (= v_~i~0_196 (+ v_~i~0_197 1)) (= v_~new~0_70 (select (select |v_#memory_int_268| v_~queue~0.base_108) (+ (* v_~start~0_162 4) v_~queue~0.offset_108))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|)) InVars {~start~0=v_~start~0_162, ~queue~0.offset=v_~queue~0.offset_108, ~ok~0=v_~ok~0_109, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_83|, ~i~0=v_~i~0_197, #memory_int=|v_#memory_int_268|, ~end~0=v_~end~0_190, ~N~0=v_~N~0_161, ~v_old~0=v_~v_old~0_97, ~queue~0.base=v_~queue~0.base_108, ~n~0=v_~n~0_112} OutVars{~start~0=v_~start~0_161, ~new~0=v_~new~0_70, ~queue~0.offset=v_~queue~0.offset_108, ~ok~0=v_~ok~0_108, ~i~0=v_~i~0_196, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~N~0=v_~N~0_161, ~queue~0.base=v_~queue~0.base_108, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_49|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_82|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_37|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_268|, ~end~0=v_~end~0_190, ~v_old~0=v_~v_old~0_96, ~n~0=v_~n~0_112} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:42:14,920 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [695] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_70| (ite (= (ite (or (< v_~i~0_183 v_~N~0_153) (< v_~start~0_147 v_~end~0_182)) 1 0) 0) 0 1)) (= (+ v_~i~0_183 1) v_~i~0_182)) InVars {~start~0=v_~start~0_147, ~i~0=v_~i~0_183, ~end~0=v_~end~0_182, ~N~0=v_~N~0_153} OutVars{~start~0=v_~start~0_147, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_43|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_70|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_31|, ~i~0=v_~i~0_182, ~end~0=v_~end~0_182, ~N~0=v_~N~0_153} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:42:14,946 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:42:14,965 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:42:15,024 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [697] L79-->L59: Formula: (and (= v_~new~0_66 v_~v_old~0_88) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= v_~start~0_153 (+ v_~start~0_154 1)) (= (ite (= (ite (or (< v_~i~0_189 v_~N~0_157) (< v_~start~0_153 v_~end~0_186)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_76|) (= (ite (= (ite (and (<= v_~v_old~0_89 v_~new~0_66) (not (= (mod v_~ok~0_101 256) 0))) 1 0) 0) 0 1) v_~ok~0_100) (= v_~new~0_66 (select (select |v_#memory_int_264| v_~queue~0.base_104) (+ (* v_~start~0_154 4) v_~queue~0.offset_104))) (= (+ v_~i~0_189 1) v_~i~0_188) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_77| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23| (ite (and (< v_~start~0_154 v_~n~0_108) (<= 0 v_~start~0_154) (< v_~start~0_154 v_~end~0_186)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~start~0=v_~start~0_154, ~queue~0.offset=v_~queue~0.offset_104, ~ok~0=v_~ok~0_101, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_77|, ~i~0=v_~i~0_189, #memory_int=|v_#memory_int_264|, ~end~0=v_~end~0_186, ~N~0=v_~N~0_157, ~v_old~0=v_~v_old~0_89, ~queue~0.base=v_~queue~0.base_104, ~n~0=v_~n~0_108} OutVars{~start~0=v_~start~0_153, ~new~0=v_~new~0_66, ~queue~0.offset=v_~queue~0.offset_104, ~ok~0=v_~ok~0_100, ~i~0=v_~i~0_188, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, ~N~0=v_~N~0_157, ~queue~0.base=v_~queue~0.base_104, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_45|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_23|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_76|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_33|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_264|, ~end~0=v_~end~0_186, ~v_old~0=v_~v_old~0_88, ~n~0=v_~n~0_108} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:42:15,090 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:42:15,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:42:15,146 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:42:15,254 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:42:15,484 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:42:15,639 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:42:15,708 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 07:42:15,710 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1253 [2022-12-06 07:42:15,710 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 273 transitions, 2989 flow [2022-12-06 07:42:15,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 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:42:15,710 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:15,710 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:42:15,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:42:15,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:15,915 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:42:15,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:42:15,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1330626402, now seen corresponding path program 1 times [2022-12-06 07:42:15,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:42:15,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685264504] [2022-12-06 07:42:15,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:15,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:42:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:16,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:42:16,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685264504] [2022-12-06 07:42:16,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685264504] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:42:16,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791818771] [2022-12-06 07:42:16,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:16,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:16,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:42:16,113 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:42:16,138 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:42:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:16,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 07:42:16,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:42:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:16,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:42:16,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791818771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:42:16,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:42:16,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-06 07:42:16,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129693965] [2022-12-06 07:42:16,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:42:16,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:42:16,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:42:16,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:42:16,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:42:16,204 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 07:42:16,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 273 transitions, 2989 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:42:16,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:42:16,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 07:42:16,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:42:16,710 INFO L130 PetriNetUnfolder]: 1944/3527 cut-off events. [2022-12-06 07:42:16,710 INFO L131 PetriNetUnfolder]: For 23087/23087 co-relation queries the response was YES. [2022-12-06 07:42:16,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18925 conditions, 3527 events. 1944/3527 cut-off events. For 23087/23087 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 21747 event pairs, 393 based on Foata normal form. 240/3764 useless extension candidates. Maximal degree in co-relation 18835. Up to 1440 conditions per place. [2022-12-06 07:42:16,736 INFO L137 encePairwiseOnDemand]: 38/59 looper letters, 176 selfloop transitions, 133 changer transitions 0/309 dead transitions. [2022-12-06 07:42:16,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 309 transitions, 3906 flow [2022-12-06 07:42:16,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:42:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:42:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-06 07:42:16,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3771186440677966 [2022-12-06 07:42:16,737 INFO L175 Difference]: Start difference. First operand has 101 places, 273 transitions, 2989 flow. Second operand 4 states and 89 transitions. [2022-12-06 07:42:16,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 309 transitions, 3906 flow [2022-12-06 07:42:16,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 309 transitions, 3518 flow, removed 148 selfloop flow, removed 11 redundant places. [2022-12-06 07:42:16,811 INFO L231 Difference]: Finished difference. Result has 94 places, 267 transitions, 3186 flow [2022-12-06 07:42:16,811 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2320, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3186, PETRI_PLACES=94, PETRI_TRANSITIONS=267} [2022-12-06 07:42:16,811 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 69 predicate places. [2022-12-06 07:42:16,812 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:42:16,812 INFO L89 Accepts]: Start accepts. Operand has 94 places, 267 transitions, 3186 flow [2022-12-06 07:42:16,815 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:42:16,815 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:42:16,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 267 transitions, 3186 flow [2022-12-06 07:42:16,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 267 transitions, 3186 flow [2022-12-06 07:42:16,933 INFO L130 PetriNetUnfolder]: 418/1213 cut-off events. [2022-12-06 07:42:16,934 INFO L131 PetriNetUnfolder]: For 7198/7258 co-relation queries the response was YES. [2022-12-06 07:42:16,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5996 conditions, 1213 events. 418/1213 cut-off events. For 7198/7258 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9047 event pairs, 22 based on Foata normal form. 13/1214 useless extension candidates. Maximal degree in co-relation 5882. Up to 391 conditions per place. [2022-12-06 07:42:16,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 267 transitions, 3186 flow [2022-12-06 07:42:16,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 992 [2022-12-06 07:42:16,944 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:42:16,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-06 07:42:16,945 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 267 transitions, 3186 flow [2022-12-06 07:42:16,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:42:16,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:16,945 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:42:16,951 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:42:17,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:17,150 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:42:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:42:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1505712246, now seen corresponding path program 1 times [2022-12-06 07:42:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:42:17,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246115374] [2022-12-06 07:42:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:17,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:42:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:17,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:42:17,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246115374] [2022-12-06 07:42:17,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246115374] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:42:17,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644315039] [2022-12-06 07:42:17,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:17,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:17,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:42:17,236 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:42:17,238 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:42:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:17,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:42:17,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:42:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:17,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:42:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:17,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644315039] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:42:17,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:42:17,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-12-06 07:42:17,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115484744] [2022-12-06 07:42:17,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:42:17,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:42:17,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:42:17,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:42:17,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:42:17,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:42:17,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 267 transitions, 3186 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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:42:17,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:42:17,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:42:17,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:42:17,994 INFO L130 PetriNetUnfolder]: 2559/4632 cut-off events. [2022-12-06 07:42:17,994 INFO L131 PetriNetUnfolder]: For 29356/29356 co-relation queries the response was YES. [2022-12-06 07:42:18,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25485 conditions, 4632 events. 2559/4632 cut-off events. For 29356/29356 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 30631 event pairs, 675 based on Foata normal form. 82/4707 useless extension candidates. Maximal degree in co-relation 25092. Up to 1913 conditions per place. [2022-12-06 07:42:18,017 INFO L137 encePairwiseOnDemand]: 28/53 looper letters, 329 selfloop transitions, 114 changer transitions 0/443 dead transitions. [2022-12-06 07:42:18,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 443 transitions, 6069 flow [2022-12-06 07:42:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:42:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:42:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-06 07:42:18,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41509433962264153 [2022-12-06 07:42:18,019 INFO L175 Difference]: Start difference. First operand has 94 places, 267 transitions, 3186 flow. Second operand 5 states and 110 transitions. [2022-12-06 07:42:18,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 443 transitions, 6069 flow [2022-12-06 07:42:18,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 443 transitions, 5999 flow, removed 35 selfloop flow, removed 1 redundant places. [2022-12-06 07:42:18,101 INFO L231 Difference]: Finished difference. Result has 99 places, 314 transitions, 4022 flow [2022-12-06 07:42:18,101 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3136, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4022, PETRI_PLACES=99, PETRI_TRANSITIONS=314} [2022-12-06 07:42:18,101 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 74 predicate places. [2022-12-06 07:42:18,101 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:42:18,101 INFO L89 Accepts]: Start accepts. Operand has 99 places, 314 transitions, 4022 flow [2022-12-06 07:42:18,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:42:18,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:42:18,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 314 transitions, 4022 flow [2022-12-06 07:42:18,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 314 transitions, 4022 flow [2022-12-06 07:42:18,254 INFO L130 PetriNetUnfolder]: 560/1589 cut-off events. [2022-12-06 07:42:18,254 INFO L131 PetriNetUnfolder]: For 11169/11269 co-relation queries the response was YES. [2022-12-06 07:42:18,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8854 conditions, 1589 events. 560/1589 cut-off events. For 11169/11269 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 12618 event pairs, 36 based on Foata normal form. 16/1586 useless extension candidates. Maximal degree in co-relation 8675. Up to 530 conditions per place. [2022-12-06 07:42:18,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 314 transitions, 4022 flow [2022-12-06 07:42:18,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 1136 [2022-12-06 07:42:18,329 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:42:18,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 07:42:18,329 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 314 transitions, 4031 flow [2022-12-06 07:42:18,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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:42:18,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:18,330 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:42:18,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 07:42:18,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 07:42:18,534 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:42:18,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:42:18,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1276393230, now seen corresponding path program 1 times [2022-12-06 07:42:18,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:42:18,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831573399] [2022-12-06 07:42:18,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:18,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:42:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:19,549 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:42:19,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:42:19,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831573399] [2022-12-06 07:42:19,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831573399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:42:19,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531240774] [2022-12-06 07:42:19,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:19,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:19,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:42:19,550 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:42:19,552 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:42:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:19,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 07:42:19,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:42:19,788 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-06 07:42:19,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2022-12-06 07:42:19,804 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:42:19,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:42:24,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:42:24,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 126 [2022-12-06 07:42:24,119 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:42:24,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531240774] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:42:24,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:42:24,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 21 [2022-12-06 07:42:24,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465178073] [2022-12-06 07:42:24,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:42:24,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 07:42:24,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:42:24,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 07:42:24,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=382, Unknown=1, NotChecked=0, Total=506 [2022-12-06 07:42:24,121 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 07:42:24,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 314 transitions, 4031 flow. Second operand has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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:42:24,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:42:24,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 07:42:24,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:42:28,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:42:31,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:42:33,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:42:35,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:42:37,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:42:40,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:42:42,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:42:44,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:42:46,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:42:47,084 INFO L130 PetriNetUnfolder]: 3823/6856 cut-off events. [2022-12-06 07:42:47,084 INFO L131 PetriNetUnfolder]: For 46837/46837 co-relation queries the response was YES. [2022-12-06 07:42:47,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39725 conditions, 6856 events. 3823/6856 cut-off events. For 46837/46837 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 47519 event pairs, 299 based on Foata normal form. 5/6855 useless extension candidates. Maximal degree in co-relation 37461. Up to 2185 conditions per place. [2022-12-06 07:42:47,117 INFO L137 encePairwiseOnDemand]: 15/54 looper letters, 330 selfloop transitions, 280 changer transitions 29/639 dead transitions. [2022-12-06 07:42:47,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 639 transitions, 8727 flow [2022-12-06 07:42:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 07:42:47,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 07:42:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 199 transitions. [2022-12-06 07:42:47,119 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18425925925925926 [2022-12-06 07:42:47,119 INFO L175 Difference]: Start difference. First operand has 99 places, 314 transitions, 4031 flow. Second operand 20 states and 199 transitions. [2022-12-06 07:42:47,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 639 transitions, 8727 flow [2022-12-06 07:42:47,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 639 transitions, 8613 flow, removed 57 selfloop flow, removed 0 redundant places. [2022-12-06 07:42:47,256 INFO L231 Difference]: Finished difference. Result has 125 places, 433 transitions, 6351 flow [2022-12-06 07:42:47,256 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3981, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6351, PETRI_PLACES=125, PETRI_TRANSITIONS=433} [2022-12-06 07:42:47,256 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 100 predicate places. [2022-12-06 07:42:47,256 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:42:47,256 INFO L89 Accepts]: Start accepts. Operand has 125 places, 433 transitions, 6351 flow [2022-12-06 07:42:47,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:42:47,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:42:47,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 433 transitions, 6351 flow [2022-12-06 07:42:47,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 433 transitions, 6351 flow [2022-12-06 07:42:47,488 INFO L130 PetriNetUnfolder]: 829/2298 cut-off events. [2022-12-06 07:42:47,489 INFO L131 PetriNetUnfolder]: For 22171/22288 co-relation queries the response was YES. [2022-12-06 07:42:47,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14063 conditions, 2298 events. 829/2298 cut-off events. For 22171/22288 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 19510 event pairs, 41 based on Foata normal form. 13/2287 useless extension candidates. Maximal degree in co-relation 14012. Up to 765 conditions per place. [2022-12-06 07:42:47,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 433 transitions, 6351 flow [2022-12-06 07:42:47,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 1640 [2022-12-06 07:42:52,970 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:42:52,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5714 [2022-12-06 07:42:52,971 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 433 transitions, 6385 flow [2022-12-06 07:42:52,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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:42:52,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:52,971 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:42:52,987 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:42:53,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:53,171 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:42:53,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:42:53,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1749153037, now seen corresponding path program 1 times [2022-12-06 07:42:53,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:42:53,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949331466] [2022-12-06 07:42:53,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:53,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:42:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:54,531 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:42:54,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:42:54,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949331466] [2022-12-06 07:42:54,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949331466] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:42:54,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34107215] [2022-12-06 07:42:54,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:54,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:54,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:42:54,533 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:42:54,536 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:42:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:54,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 07:42:54,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:42:54,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:42:54,743 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 07:42:54,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-06 07:42:54,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-06 07:42:54,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 07:42:54,854 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:42:54,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:42:55,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:42:55,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 140 [2022-12-06 07:42:55,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-12-06 07:42:55,300 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:42:55,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34107215] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:42:55,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:42:55,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 07:42:55,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152482523] [2022-12-06 07:42:55,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:42:55,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 07:42:55,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:42:55,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 07:42:55,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-12-06 07:42:55,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 07:42:55,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 433 transitions, 6385 flow. Second operand has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 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:42:55,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:42:55,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 07:42:55,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:42:58,082 INFO L130 PetriNetUnfolder]: 5632/9942 cut-off events. [2022-12-06 07:42:58,082 INFO L131 PetriNetUnfolder]: For 96322/96322 co-relation queries the response was YES. [2022-12-06 07:42:58,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63392 conditions, 9942 events. 5632/9942 cut-off events. For 96322/96322 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 72385 event pairs, 495 based on Foata normal form. 9/9946 useless extension candidates. Maximal degree in co-relation 63335. Up to 3609 conditions per place. [2022-12-06 07:42:58,138 INFO L137 encePairwiseOnDemand]: 18/57 looper letters, 412 selfloop transitions, 373 changer transitions 29/814 dead transitions. [2022-12-06 07:42:58,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 814 transitions, 12803 flow [2022-12-06 07:42:58,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 07:42:58,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 07:42:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 195 transitions. [2022-12-06 07:42:58,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22807017543859648 [2022-12-06 07:42:58,140 INFO L175 Difference]: Start difference. First operand has 124 places, 433 transitions, 6385 flow. Second operand 15 states and 195 transitions. [2022-12-06 07:42:58,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 814 transitions, 12803 flow [2022-12-06 07:42:58,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 814 transitions, 12686 flow, removed 42 selfloop flow, removed 2 redundant places. [2022-12-06 07:42:58,514 INFO L231 Difference]: Finished difference. Result has 147 places, 582 transitions, 10078 flow [2022-12-06 07:42:58,514 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=6193, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=10078, PETRI_PLACES=147, PETRI_TRANSITIONS=582} [2022-12-06 07:42:58,515 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 122 predicate places. [2022-12-06 07:42:58,515 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:42:58,515 INFO L89 Accepts]: Start accepts. Operand has 147 places, 582 transitions, 10078 flow [2022-12-06 07:42:58,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:42:58,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:42:58,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 582 transitions, 10078 flow [2022-12-06 07:42:58,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 582 transitions, 10078 flow [2022-12-06 07:42:58,985 INFO L130 PetriNetUnfolder]: 1267/3378 cut-off events. [2022-12-06 07:42:58,986 INFO L131 PetriNetUnfolder]: For 46745/46898 co-relation queries the response was YES. [2022-12-06 07:42:58,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23672 conditions, 3378 events. 1267/3378 cut-off events. For 46745/46898 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 30261 event pairs, 55 based on Foata normal form. 17/3370 useless extension candidates. Maximal degree in co-relation 22386. Up to 1166 conditions per place. [2022-12-06 07:42:59,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 582 transitions, 10078 flow [2022-12-06 07:42:59,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 2322 [2022-12-06 07:42:59,030 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:42:59,883 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:42:59,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1368 [2022-12-06 07:42:59,883 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 582 transitions, 10087 flow [2022-12-06 07:42:59,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 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:42:59,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:59,884 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:42:59,892 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:43:00,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:43:00,090 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:43:00,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:43:00,090 INFO L85 PathProgramCache]: Analyzing trace with hash 833817497, now seen corresponding path program 1 times [2022-12-06 07:43:00,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:43:00,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655356261] [2022-12-06 07:43:00,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:43:00,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:43:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:43:01,166 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:43:01,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:43:01,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655356261] [2022-12-06 07:43:01,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655356261] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:43:01,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789246252] [2022-12-06 07:43:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:43:01,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:43:01,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:43:01,168 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:43:01,169 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:43:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:43:01,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 07:43:01,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:43:01,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 07:43:01,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:43:01,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:43:01,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:43:01,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:43:01,430 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-06 07:43:01,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-12-06 07:43:01,446 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:43:01,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:43:05,652 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_~i~0 4))) (.cse2 (* c_~end~0 4))) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_521 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_521))) (= (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 ~queue~0.base) (+ .cse2 ~queue~0.offset))))))) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_521))) (let ((.cse3 (select .cse4 ~queue~0.base))) (or (< c_~v_old~0 (+ (select .cse3 (+ (* c_~start~0 4) ~queue~0.offset)) 1)) (not (= (select (select .cse4 c_~A~0.base) .cse1) (select .cse3 (+ .cse2 ~queue~0.offset)))))))))) is different from false [2022-12-06 07:43:05,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:43:05,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 97 [2022-12-06 07:43:05,743 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:43:05,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1359 treesize of output 1319 [2022-12-06 07:43:05,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:43:05,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1166 treesize of output 1113 [2022-12-06 07:43:05,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:43:05,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1034 treesize of output 891 [2022-12-06 07:43:05,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:43:05,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 850 treesize of output 785 [2022-12-06 07:43:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 07:43:30,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789246252] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:43:30,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:43:30,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 07:43:30,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071469665] [2022-12-06 07:43:30,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:43:30,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:43:30,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:43:30,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:43:30,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=260, Unknown=2, NotChecked=34, Total=380 [2022-12-06 07:43:30,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 07:43:30,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 582 transitions, 10087 flow. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 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:43:30,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:43:30,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 07:43:30,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:43:33,678 INFO L130 PetriNetUnfolder]: 7286/12780 cut-off events. [2022-12-06 07:43:33,678 INFO L131 PetriNetUnfolder]: For 174733/174733 co-relation queries the response was YES. [2022-12-06 07:43:33,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92030 conditions, 12780 events. 7286/12780 cut-off events. For 174733/174733 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 96687 event pairs, 632 based on Foata normal form. 26/12802 useless extension candidates. Maximal degree in co-relation 84803. Up to 5769 conditions per place. [2022-12-06 07:43:33,780 INFO L137 encePairwiseOnDemand]: 25/59 looper letters, 494 selfloop transitions, 441 changer transitions 24/959 dead transitions. [2022-12-06 07:43:33,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 959 transitions, 17374 flow [2022-12-06 07:43:33,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 07:43:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 07:43:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 205 transitions. [2022-12-06 07:43:33,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23163841807909605 [2022-12-06 07:43:33,782 INFO L175 Difference]: Start difference. First operand has 146 places, 582 transitions, 10087 flow. Second operand 15 states and 205 transitions. [2022-12-06 07:43:33,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 959 transitions, 17374 flow [2022-12-06 07:43:34,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 959 transitions, 17081 flow, removed 140 selfloop flow, removed 2 redundant places. [2022-12-06 07:43:34,913 INFO L231 Difference]: Finished difference. Result has 165 places, 723 transitions, 13989 flow [2022-12-06 07:43:34,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=9178, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13989, PETRI_PLACES=165, PETRI_TRANSITIONS=723} [2022-12-06 07:43:34,914 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 140 predicate places. [2022-12-06 07:43:34,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:43:34,915 INFO L89 Accepts]: Start accepts. Operand has 165 places, 723 transitions, 13989 flow [2022-12-06 07:43:34,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:43:34,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:43:34,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 723 transitions, 13989 flow [2022-12-06 07:43:34,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 723 transitions, 13989 flow [2022-12-06 07:43:35,707 INFO L130 PetriNetUnfolder]: 1660/4406 cut-off events. [2022-12-06 07:43:35,708 INFO L131 PetriNetUnfolder]: For 71565/71701 co-relation queries the response was YES. [2022-12-06 07:43:35,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32547 conditions, 4406 events. 1660/4406 cut-off events. For 71565/71701 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 41665 event pairs, 74 based on Foata normal form. 9/4390 useless extension candidates. Maximal degree in co-relation 32478. Up to 1519 conditions per place. [2022-12-06 07:43:35,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 723 transitions, 13989 flow [2022-12-06 07:43:35,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 3090 [2022-12-06 07:43:35,798 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:43:35,799 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 885 [2022-12-06 07:43:35,799 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 723 transitions, 13989 flow [2022-12-06 07:43:35,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 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:43:35,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:43:35,799 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:43:35,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 07:43:36,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 07:43:36,001 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:43:36,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:43:36,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1941938235, now seen corresponding path program 2 times [2022-12-06 07:43:36,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:43:36,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232427408] [2022-12-06 07:43:36,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:43:36,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:43:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:43:36,692 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:43:36,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:43:36,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232427408] [2022-12-06 07:43:36,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232427408] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:43:36,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704799736] [2022-12-06 07:43:36,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:43:36,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:43:36,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:43:36,704 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:43:36,732 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:43:36,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:43:36,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:43:36,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 07:43:36,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:43:36,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 07:43:36,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:43:36,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:43:36,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:43:36,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:43:36,991 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 07:43:36,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2022-12-06 07:43:37,075 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-06 07:43:37,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-12-06 07:43:37,116 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:43:37,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:43:37,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:43:37,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 85 [2022-12-06 07:43:37,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:43:37,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 281 treesize of output 355 [2022-12-06 07:43:37,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:43:37,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 208 treesize of output 241 [2022-12-06 07:43:37,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 150 [2022-12-06 07:43:41,220 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:43:41,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704799736] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:43:41,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:43:41,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-12-06 07:43:41,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851073606] [2022-12-06 07:43:41,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:43:41,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 07:43:41,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:43:41,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 07:43:41,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=316, Unknown=3, NotChecked=0, Total=420 [2022-12-06 07:43:41,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 07:43:41,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 723 transitions, 13989 flow. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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:43:41,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:43:41,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 07:43:41,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:43:45,312 INFO L130 PetriNetUnfolder]: 8045/14039 cut-off events. [2022-12-06 07:43:45,312 INFO L131 PetriNetUnfolder]: For 228335/228335 co-relation queries the response was YES. [2022-12-06 07:43:45,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107186 conditions, 14039 events. 8045/14039 cut-off events. For 228335/228335 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 107021 event pairs, 655 based on Foata normal form. 10/14045 useless extension candidates. Maximal degree in co-relation 107111. Up to 4909 conditions per place. [2022-12-06 07:43:45,408 INFO L137 encePairwiseOnDemand]: 17/58 looper letters, 474 selfloop transitions, 620 changer transitions 25/1119 dead transitions. [2022-12-06 07:43:45,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1119 transitions, 21460 flow [2022-12-06 07:43:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 07:43:45,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 07:43:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 272 transitions. [2022-12-06 07:43:45,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19540229885057472 [2022-12-06 07:43:45,410 INFO L175 Difference]: Start difference. First operand has 163 places, 723 transitions, 13989 flow. Second operand 24 states and 272 transitions. [2022-12-06 07:43:45,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1119 transitions, 21460 flow [2022-12-06 07:43:46,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 1119 transitions, 21336 flow, removed 62 selfloop flow, removed 2 redundant places. [2022-12-06 07:43:46,503 INFO L231 Difference]: Finished difference. Result has 198 places, 824 transitions, 17976 flow [2022-12-06 07:43:46,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=13705, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=508, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=17976, PETRI_PLACES=198, PETRI_TRANSITIONS=824} [2022-12-06 07:43:46,504 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 173 predicate places. [2022-12-06 07:43:46,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:43:46,504 INFO L89 Accepts]: Start accepts. Operand has 198 places, 824 transitions, 17976 flow [2022-12-06 07:43:46,508 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:43:46,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:43:46,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 824 transitions, 17976 flow [2022-12-06 07:43:46,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 824 transitions, 17976 flow [2022-12-06 07:43:47,322 INFO L130 PetriNetUnfolder]: 1825/4792 cut-off events. [2022-12-06 07:43:47,322 INFO L131 PetriNetUnfolder]: For 99220/99362 co-relation queries the response was YES. [2022-12-06 07:43:47,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38320 conditions, 4792 events. 1825/4792 cut-off events. For 99220/99362 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 45739 event pairs, 93 based on Foata normal form. 13/4788 useless extension candidates. Maximal degree in co-relation 38238. Up to 1668 conditions per place. [2022-12-06 07:43:47,404 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 824 transitions, 17976 flow [2022-12-06 07:43:47,404 INFO L188 LiptonReduction]: Number of co-enabled transitions 3514 [2022-12-06 07:43:47,407 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:43:47,407 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 903 [2022-12-06 07:43:47,407 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 824 transitions, 17976 flow [2022-12-06 07:43:47,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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:43:47,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:43:47,408 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:43:47,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 07:43:47,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 07:43:47,613 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:43:47,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:43:47,613 INFO L85 PathProgramCache]: Analyzing trace with hash -890640307, now seen corresponding path program 1 times [2022-12-06 07:43:47,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:43:47,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510564380] [2022-12-06 07:43:47,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:43:47,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:43:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:43:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:43:47,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:43:47,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510564380] [2022-12-06 07:43:47,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510564380] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:43:47,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371225934] [2022-12-06 07:43:47,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:43:47,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:43:47,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:43:47,683 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:43:47,686 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:43:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:43:47,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:43:47,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:43:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:43:47,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:43:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:43:47,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371225934] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:43:47,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:43:47,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 07:43:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103070644] [2022-12-06 07:43:47,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:43:47,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:43:47,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:43:47,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:43:47,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:43:47,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 07:43:47,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 824 transitions, 17976 flow. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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:43:47,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:43:47,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 07:43:47,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:43:51,751 INFO L130 PetriNetUnfolder]: 8516/14842 cut-off events. [2022-12-06 07:43:51,752 INFO L131 PetriNetUnfolder]: For 307562/307562 co-relation queries the response was YES. [2022-12-06 07:43:51,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122043 conditions, 14842 events. 8516/14842 cut-off events. For 307562/307562 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 113979 event pairs, 905 based on Foata normal form. 66/14904 useless extension candidates. Maximal degree in co-relation 121955. Up to 5518 conditions per place. [2022-12-06 07:43:51,865 INFO L137 encePairwiseOnDemand]: 26/56 looper letters, 991 selfloop transitions, 199 changer transitions 0/1190 dead transitions. [2022-12-06 07:43:51,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1190 transitions, 28192 flow [2022-12-06 07:43:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:43:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:43:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-12-06 07:43:51,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29591836734693877 [2022-12-06 07:43:51,867 INFO L175 Difference]: Start difference. First operand has 197 places, 824 transitions, 17976 flow. Second operand 7 states and 116 transitions. [2022-12-06 07:43:51,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1190 transitions, 28192 flow [2022-12-06 07:43:53,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 1190 transitions, 27210 flow, removed 83 selfloop flow, removed 8 redundant places. [2022-12-06 07:43:53,672 INFO L231 Difference]: Finished difference. Result has 197 places, 853 transitions, 18395 flow [2022-12-06 07:43:53,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=17301, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=824, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=18395, PETRI_PLACES=197, PETRI_TRANSITIONS=853} [2022-12-06 07:43:53,673 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 172 predicate places. [2022-12-06 07:43:53,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:43:53,673 INFO L89 Accepts]: Start accepts. Operand has 197 places, 853 transitions, 18395 flow [2022-12-06 07:43:53,676 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:43:53,676 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:43:53,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 853 transitions, 18395 flow [2022-12-06 07:43:53,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 853 transitions, 18395 flow [2022-12-06 07:43:54,704 INFO L130 PetriNetUnfolder]: 1969/5143 cut-off events. [2022-12-06 07:43:54,705 INFO L131 PetriNetUnfolder]: For 114920/115104 co-relation queries the response was YES. [2022-12-06 07:43:54,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42846 conditions, 5143 events. 1969/5143 cut-off events. For 114920/115104 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 49764 event pairs, 112 based on Foata normal form. 16/5145 useless extension candidates. Maximal degree in co-relation 42339. Up to 1804 conditions per place. [2022-12-06 07:43:54,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 853 transitions, 18395 flow [2022-12-06 07:43:54,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 3614 [2022-12-06 07:44:01,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:44:01,376 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7703 [2022-12-06 07:44:01,376 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 853 transitions, 18429 flow [2022-12-06 07:44:01,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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:44:01,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:01,377 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:01,389 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:44:01,588 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,SelfDestructingSolverStorable14 [2022-12-06 07:44:01,588 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:44:01,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1509109138, now seen corresponding path program 1 times [2022-12-06 07:44:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:01,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599696200] [2022-12-06 07:44:01,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:01,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:44:01,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:01,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599696200] [2022-12-06 07:44:01,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599696200] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:01,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429019648] [2022-12-06 07:44:01,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:01,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:01,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:01,665 INFO L229 MonitoredProcess]: Starting monitored process 12 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:44:01,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 07:44:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:01,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:44:01,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:44:01,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:44:01,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429019648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:01,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:44:01,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 07:44:01,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406609617] [2022-12-06 07:44:01,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:01,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:44:01,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:01,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:44:01,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:44:01,820 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 07:44:01,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 853 transitions, 18429 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 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:44:01,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:01,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 07:44:01,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:05,228 INFO L130 PetriNetUnfolder]: 7293/12969 cut-off events. [2022-12-06 07:44:05,228 INFO L131 PetriNetUnfolder]: For 284260/284260 co-relation queries the response was YES. [2022-12-06 07:44:05,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107254 conditions, 12969 events. 7293/12969 cut-off events. For 284260/284260 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 99907 event pairs, 3149 based on Foata normal form. 234/13199 useless extension candidates. Maximal degree in co-relation 106205. Up to 11944 conditions per place. [2022-12-06 07:44:05,334 INFO L137 encePairwiseOnDemand]: 46/58 looper letters, 667 selfloop transitions, 0 changer transitions 124/791 dead transitions. [2022-12-06 07:44:05,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 791 transitions, 18300 flow [2022-12-06 07:44:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:44:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:44:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-06 07:44:05,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-06 07:44:05,339 INFO L175 Difference]: Start difference. First operand has 197 places, 853 transitions, 18429 flow. Second operand 4 states and 86 transitions. [2022-12-06 07:44:05,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 791 transitions, 18300 flow [2022-12-06 07:44:06,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 791 transitions, 18088 flow, removed 71 selfloop flow, removed 2 redundant places. [2022-12-06 07:44:06,829 INFO L231 Difference]: Finished difference. Result has 200 places, 667 transitions, 13792 flow [2022-12-06 07:44:06,830 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=15937, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=757, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13792, PETRI_PLACES=200, PETRI_TRANSITIONS=667} [2022-12-06 07:44:06,830 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 175 predicate places. [2022-12-06 07:44:06,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:06,830 INFO L89 Accepts]: Start accepts. Operand has 200 places, 667 transitions, 13792 flow [2022-12-06 07:44:06,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:06,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:06,833 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 667 transitions, 13792 flow [2022-12-06 07:44:06,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 667 transitions, 13792 flow [2022-12-06 07:44:07,498 INFO L130 PetriNetUnfolder]: 1570/4131 cut-off events. [2022-12-06 07:44:07,498 INFO L131 PetriNetUnfolder]: For 85139/85272 co-relation queries the response was YES. [2022-12-06 07:44:07,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33454 conditions, 4131 events. 1570/4131 cut-off events. For 85139/85272 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 38516 event pairs, 96 based on Foata normal form. 12/4131 useless extension candidates. Maximal degree in co-relation 33040. Up to 1468 conditions per place. [2022-12-06 07:44:07,559 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 667 transitions, 13792 flow [2022-12-06 07:44:07,559 INFO L188 LiptonReduction]: Number of co-enabled transitions 2744 [2022-12-06 07:44:07,561 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:07,562 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 732 [2022-12-06 07:44:07,562 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 667 transitions, 13792 flow [2022-12-06 07:44:07,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 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:44:07,562 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:07,562 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:44:07,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 07:44:07,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 07:44:07,767 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:44:07,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:07,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1932074843, now seen corresponding path program 1 times [2022-12-06 07:44:07,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:07,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237103155] [2022-12-06 07:44:07,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:07,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:44:09,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:09,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237103155] [2022-12-06 07:44:09,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237103155] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:09,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846333597] [2022-12-06 07:44:09,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:09,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:09,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:09,385 INFO L229 MonitoredProcess]: Starting monitored process 13 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:44:09,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 07:44:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:09,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 07:44:09,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:09,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-06 07:44:09,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 07:44:09,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 10 [2022-12-06 07:44:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:44:09,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:44:10,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:44:10,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 259 treesize of output 229 [2022-12-06 07:44:10,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:44:10,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 189 [2022-12-06 07:44:10,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:44:10,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 137 [2022-12-06 07:44:10,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:44:10,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846333597] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:44:10,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:44:10,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2022-12-06 07:44:10,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680303769] [2022-12-06 07:44:10,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:44:10,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 07:44:10,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:10,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 07:44:10,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=463, Unknown=1, NotChecked=0, Total=600 [2022-12-06 07:44:10,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 07:44:10,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 667 transitions, 13792 flow. Second operand has 25 states, 24 states have (on average 2.5) internal successors, (60), 24 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:44:10,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:10,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 07:44:10,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:15,854 INFO L130 PetriNetUnfolder]: 8871/15367 cut-off events. [2022-12-06 07:44:15,855 INFO L131 PetriNetUnfolder]: For 316122/316122 co-relation queries the response was YES. [2022-12-06 07:44:15,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124653 conditions, 15367 events. 8871/15367 cut-off events. For 316122/316122 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 118401 event pairs, 1019 based on Foata normal form. 21/15384 useless extension candidates. Maximal degree in co-relation 123615. Up to 6298 conditions per place. [2022-12-06 07:44:15,970 INFO L137 encePairwiseOnDemand]: 17/54 looper letters, 505 selfloop transitions, 589 changer transitions 30/1124 dead transitions. [2022-12-06 07:44:15,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 1124 transitions, 23615 flow [2022-12-06 07:44:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 07:44:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 07:44:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 223 transitions. [2022-12-06 07:44:15,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1966490299823633 [2022-12-06 07:44:15,971 INFO L175 Difference]: Start difference. First operand has 189 places, 667 transitions, 13792 flow. Second operand 21 states and 223 transitions. [2022-12-06 07:44:15,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 1124 transitions, 23615 flow [2022-12-06 07:44:17,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 1124 transitions, 23361 flow, removed 125 selfloop flow, removed 6 redundant places. [2022-12-06 07:44:17,546 INFO L231 Difference]: Finished difference. Result has 216 places, 863 transitions, 20178 flow [2022-12-06 07:44:17,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=13357, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=387, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=20178, PETRI_PLACES=216, PETRI_TRANSITIONS=863} [2022-12-06 07:44:17,552 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 191 predicate places. [2022-12-06 07:44:17,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:17,552 INFO L89 Accepts]: Start accepts. Operand has 216 places, 863 transitions, 20178 flow [2022-12-06 07:44:17,555 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:17,555 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:17,555 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 863 transitions, 20178 flow [2022-12-06 07:44:17,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 863 transitions, 20178 flow [2022-12-06 07:44:18,435 INFO L130 PetriNetUnfolder]: 2098/5284 cut-off events. [2022-12-06 07:44:18,436 INFO L131 PetriNetUnfolder]: For 140941/141045 co-relation queries the response was YES. [2022-12-06 07:44:18,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47298 conditions, 5284 events. 2098/5284 cut-off events. For 140941/141045 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 50098 event pairs, 86 based on Foata normal form. 11/5285 useless extension candidates. Maximal degree in co-relation 46742. Up to 1922 conditions per place. [2022-12-06 07:44:18,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 863 transitions, 20178 flow [2022-12-06 07:44:18,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 3606 [2022-12-06 07:44:18,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:44:18,675 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:44:18,747 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:44:18,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:44:18,813 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:44:18,830 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:44:18,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:44:18,930 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:44:19,001 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:44:19,044 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:44:19,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [698] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_80| (ite (= (ite (or (< v_~start~0_157 v_~end~0_188) (< v_~i~0_193 v_~N~0_159)) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= v_~start~0_157 (+ v_~start~0_158 1)) (= (+ v_~i~0_193 1) v_~i~0_192) (= v_~new~0_68 v_~v_old~0_92) (= (ite (= (ite (and (<= v_~v_old~0_93 v_~new~0_68) (not (= (mod v_~ok~0_105 256) 0))) 1 0) 0) 0 1) v_~ok~0_104) (= v_~new~0_68 (select (select |v_#memory_int_266| v_~queue~0.base_106) (+ v_~queue~0.offset_106 (* v_~start~0_158 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= (ite (and (< v_~start~0_158 v_~end~0_188) (< v_~start~0_158 v_~n~0_110) (<= 0 v_~start~0_158)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|)) InVars {~start~0=v_~start~0_158, ~queue~0.offset=v_~queue~0.offset_106, ~ok~0=v_~ok~0_105, ~i~0=v_~i~0_193, #memory_int=|v_#memory_int_266|, ~end~0=v_~end~0_188, ~N~0=v_~N~0_159, ~v_old~0=v_~v_old~0_93, ~queue~0.base=v_~queue~0.base_106, ~n~0=v_~n~0_110} OutVars{~start~0=v_~start~0_157, ~new~0=v_~new~0_68, ~queue~0.offset=v_~queue~0.offset_106, ~ok~0=v_~ok~0_104, ~i~0=v_~i~0_192, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~N~0=v_~N~0_159, ~queue~0.base=v_~queue~0.base_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_47|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_80|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_35|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_266|, ~end~0=v_~end~0_188, ~v_old~0=v_~v_old~0_92, ~n~0=v_~n~0_110} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:44:19,198 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [695] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_70| (ite (= (ite (or (< v_~i~0_183 v_~N~0_153) (< v_~start~0_147 v_~end~0_182)) 1 0) 0) 0 1)) (= (+ v_~i~0_183 1) v_~i~0_182)) InVars {~start~0=v_~start~0_147, ~i~0=v_~i~0_183, ~end~0=v_~end~0_182, ~N~0=v_~N~0_153} OutVars{~start~0=v_~start~0_147, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_43|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_70|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_31|, ~i~0=v_~i~0_182, ~end~0=v_~end~0_182, ~N~0=v_~N~0_153} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:44:19,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:44:19,318 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:44:19,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [699] L79-->L59: Formula: (and (= (ite (and (<= 0 v_~start~0_162) (< v_~start~0_162 v_~n~0_112) (< v_~start~0_162 v_~end~0_190)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|) (= v_~new~0_70 v_~v_old~0_96) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_83| 256) 0)) (= |v_thread2Thread1of1ForFork1_~cond~0#1_82| (ite (= (ite (or (< v_~i~0_197 v_~N~0_161) (< v_~start~0_161 v_~end~0_190)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= (+ v_~start~0_162 1) v_~start~0_161) (= (ite (= (ite (and (not (= (mod v_~ok~0_109 256) 0)) (<= v_~v_old~0_97 v_~new~0_70)) 1 0) 0) 0 1) v_~ok~0_108) (= v_~i~0_196 (+ v_~i~0_197 1)) (= v_~new~0_70 (select (select |v_#memory_int_268| v_~queue~0.base_108) (+ (* v_~start~0_162 4) v_~queue~0.offset_108))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|)) InVars {~start~0=v_~start~0_162, ~queue~0.offset=v_~queue~0.offset_108, ~ok~0=v_~ok~0_109, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_83|, ~i~0=v_~i~0_197, #memory_int=|v_#memory_int_268|, ~end~0=v_~end~0_190, ~N~0=v_~N~0_161, ~v_old~0=v_~v_old~0_97, ~queue~0.base=v_~queue~0.base_108, ~n~0=v_~n~0_112} OutVars{~start~0=v_~start~0_161, ~new~0=v_~new~0_70, ~queue~0.offset=v_~queue~0.offset_108, ~ok~0=v_~ok~0_108, ~i~0=v_~i~0_196, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~N~0=v_~N~0_161, ~queue~0.base=v_~queue~0.base_108, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_49|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_82|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_37|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_268|, ~end~0=v_~end~0_190, ~v_old~0=v_~v_old~0_96, ~n~0=v_~n~0_112} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:44:19,552 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:44:19,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2000 [2022-12-06 07:44:19,552 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 862 transitions, 20482 flow [2022-12-06 07:44:19,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 24 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:44:19,553 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:19,553 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:19,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 07:44:19,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 07:44:19,758 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:44:19,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:19,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1710797201, now seen corresponding path program 1 times [2022-12-06 07:44:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:19,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791248078] [2022-12-06 07:44:19,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:19,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:44:19,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:19,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791248078] [2022-12-06 07:44:19,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791248078] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:19,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246652391] [2022-12-06 07:44:19,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:19,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:19,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:19,833 INFO L229 MonitoredProcess]: Starting monitored process 14 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:44:19,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 07:44:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:19,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 07:44:19,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:44:19,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:44:19,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246652391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:19,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:44:19,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 07:44:19,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749039709] [2022-12-06 07:44:19,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:19,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:44:19,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:19,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:44:19,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:44:19,961 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 85 [2022-12-06 07:44:19,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 862 transitions, 20482 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 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:44:19,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:19,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 85 [2022-12-06 07:44:19,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:24,045 INFO L130 PetriNetUnfolder]: 7815/13543 cut-off events. [2022-12-06 07:44:24,045 INFO L131 PetriNetUnfolder]: For 373254/373254 co-relation queries the response was YES. [2022-12-06 07:44:24,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122344 conditions, 13543 events. 7815/13543 cut-off events. For 373254/373254 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 102819 event pairs, 2898 based on Foata normal form. 76/13615 useless extension candidates. Maximal degree in co-relation 120892. Up to 11226 conditions per place. [2022-12-06 07:44:24,242 INFO L137 encePairwiseOnDemand]: 80/85 looper letters, 612 selfloop transitions, 0 changer transitions 212/824 dead transitions. [2022-12-06 07:44:24,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 824 transitions, 21290 flow [2022-12-06 07:44:24,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:44:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:44:24,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-06 07:44:24,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32941176470588235 [2022-12-06 07:44:24,243 INFO L175 Difference]: Start difference. First operand has 215 places, 862 transitions, 20482 flow. Second operand 4 states and 112 transitions. [2022-12-06 07:44:24,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 824 transitions, 21290 flow [2022-12-06 07:44:26,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 824 transitions, 19665 flow, removed 404 selfloop flow, removed 8 redundant places. [2022-12-06 07:44:26,398 INFO L231 Difference]: Finished difference. Result has 208 places, 612 transitions, 13238 flow [2022-12-06 07:44:26,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=17587, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=786, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13238, PETRI_PLACES=208, PETRI_TRANSITIONS=612} [2022-12-06 07:44:26,399 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 183 predicate places. [2022-12-06 07:44:26,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:26,399 INFO L89 Accepts]: Start accepts. Operand has 208 places, 612 transitions, 13238 flow [2022-12-06 07:44:26,402 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:26,402 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:26,402 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 612 transitions, 13238 flow [2022-12-06 07:44:26,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 612 transitions, 13238 flow [2022-12-06 07:44:27,121 INFO L130 PetriNetUnfolder]: 1624/3937 cut-off events. [2022-12-06 07:44:27,121 INFO L131 PetriNetUnfolder]: For 88735/88820 co-relation queries the response was YES. [2022-12-06 07:44:27,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33439 conditions, 3937 events. 1624/3937 cut-off events. For 88735/88820 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 34643 event pairs, 81 based on Foata normal form. 12/3944 useless extension candidates. Maximal degree in co-relation 33070. Up to 1400 conditions per place. [2022-12-06 07:44:27,180 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 612 transitions, 13238 flow [2022-12-06 07:44:27,180 INFO L188 LiptonReduction]: Number of co-enabled transitions 2626 [2022-12-06 07:44:27,344 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:44:31,159 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:44:31,160 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4761 [2022-12-06 07:44:31,160 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 611 transitions, 13302 flow [2022-12-06 07:44:31,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 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:44:31,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:31,160 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:31,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 07:44:31,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 07:44:31,366 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:44:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1251396153, now seen corresponding path program 1 times [2022-12-06 07:44:31,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:31,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388369502] [2022-12-06 07:44:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:44:31,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:31,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388369502] [2022-12-06 07:44:31,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388369502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:31,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:31,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:44:31,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827899120] [2022-12-06 07:44:31,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:31,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:44:31,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:31,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:44:31,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:44:31,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 07:44:31,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 611 transitions, 13302 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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:44:31,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:31,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 07:44:31,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:33,608 INFO L130 PetriNetUnfolder]: 6000/10267 cut-off events. [2022-12-06 07:44:33,608 INFO L131 PetriNetUnfolder]: For 233390/233390 co-relation queries the response was YES. [2022-12-06 07:44:33,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87520 conditions, 10267 events. 6000/10267 cut-off events. For 233390/233390 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 73274 event pairs, 1992 based on Foata normal form. 84/10351 useless extension candidates. Maximal degree in co-relation 86554. Up to 8294 conditions per place. [2022-12-06 07:44:33,701 INFO L137 encePairwiseOnDemand]: 45/57 looper letters, 628 selfloop transitions, 6 changer transitions 99/733 dead transitions. [2022-12-06 07:44:33,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 733 transitions, 17346 flow [2022-12-06 07:44:33,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:44:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:44:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-06 07:44:33,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2736842105263158 [2022-12-06 07:44:33,702 INFO L175 Difference]: Start difference. First operand has 177 places, 611 transitions, 13302 flow. Second operand 5 states and 78 transitions. [2022-12-06 07:44:33,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 733 transitions, 17346 flow [2022-12-06 07:44:34,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 733 transitions, 16097 flow, removed 420 selfloop flow, removed 18 redundant places. [2022-12-06 07:44:34,865 INFO L231 Difference]: Finished difference. Result has 165 places, 543 transitions, 10793 flow [2022-12-06 07:44:34,865 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=11397, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10793, PETRI_PLACES=165, PETRI_TRANSITIONS=543} [2022-12-06 07:44:34,866 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 140 predicate places. [2022-12-06 07:44:34,866 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:34,867 INFO L89 Accepts]: Start accepts. Operand has 165 places, 543 transitions, 10793 flow [2022-12-06 07:44:34,869 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:34,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:34,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 543 transitions, 10793 flow [2022-12-06 07:44:34,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 543 transitions, 10793 flow [2022-12-06 07:44:35,421 INFO L130 PetriNetUnfolder]: 1439/3492 cut-off events. [2022-12-06 07:44:35,421 INFO L131 PetriNetUnfolder]: For 62472/62492 co-relation queries the response was YES. [2022-12-06 07:44:35,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25808 conditions, 3492 events. 1439/3492 cut-off events. For 62472/62492 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 29939 event pairs, 69 based on Foata normal form. 12/3498 useless extension candidates. Maximal degree in co-relation 25098. Up to 1236 conditions per place. [2022-12-06 07:44:35,475 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 543 transitions, 10793 flow [2022-12-06 07:44:35,476 INFO L188 LiptonReduction]: Number of co-enabled transitions 2274 [2022-12-06 07:44:39,914 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:44:39,915 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5049 [2022-12-06 07:44:39,915 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 543 transitions, 10823 flow [2022-12-06 07:44:39,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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:44:39,916 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:39,916 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:39,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 07:44:39,916 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:44:39,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:39,916 INFO L85 PathProgramCache]: Analyzing trace with hash 189020536, now seen corresponding path program 1 times [2022-12-06 07:44:39,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:39,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990330949] [2022-12-06 07:44:39,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:39,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:44:40,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:40,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990330949] [2022-12-06 07:44:40,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990330949] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:40,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402773676] [2022-12-06 07:44:40,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:40,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:40,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:40,024 INFO L229 MonitoredProcess]: Starting monitored process 15 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:44:40,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 07:44:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:40,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 07:44:40,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:40,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:44:40,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:44:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:44:40,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402773676] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:44:40,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:44:40,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-12-06 07:44:40,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870103908] [2022-12-06 07:44:40,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:44:40,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:44:40,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:40,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:44:40,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:44:40,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 07:44:40,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 543 transitions, 10823 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:44:40,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:40,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 07:44:40,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:42,707 INFO L130 PetriNetUnfolder]: 6456/11042 cut-off events. [2022-12-06 07:44:42,708 INFO L131 PetriNetUnfolder]: For 204288/204288 co-relation queries the response was YES. [2022-12-06 07:44:42,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84445 conditions, 11042 events. 6456/11042 cut-off events. For 204288/204288 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 78712 event pairs, 953 based on Foata normal form. 98/11138 useless extension candidates. Maximal degree in co-relation 81782. Up to 4455 conditions per place. [2022-12-06 07:44:42,854 INFO L137 encePairwiseOnDemand]: 25/57 looper letters, 379 selfloop transitions, 330 changer transitions 1/710 dead transitions. [2022-12-06 07:44:42,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 710 transitions, 15151 flow [2022-12-06 07:44:42,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:44:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:44:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2022-12-06 07:44:42,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28362573099415206 [2022-12-06 07:44:42,855 INFO L175 Difference]: Start difference. First operand has 157 places, 543 transitions, 10823 flow. Second operand 6 states and 97 transitions. [2022-12-06 07:44:42,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 710 transitions, 15151 flow [2022-12-06 07:44:43,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 710 transitions, 14324 flow, removed 99 selfloop flow, removed 7 redundant places. [2022-12-06 07:44:43,844 INFO L231 Difference]: Finished difference. Result has 159 places, 630 transitions, 13267 flow [2022-12-06 07:44:43,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=10114, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13267, PETRI_PLACES=159, PETRI_TRANSITIONS=630} [2022-12-06 07:44:43,845 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 134 predicate places. [2022-12-06 07:44:43,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:43,845 INFO L89 Accepts]: Start accepts. Operand has 159 places, 630 transitions, 13267 flow [2022-12-06 07:44:43,864 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:43,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:43,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 630 transitions, 13267 flow [2022-12-06 07:44:43,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 630 transitions, 13267 flow [2022-12-06 07:44:44,463 INFO L130 PetriNetUnfolder]: 1611/3934 cut-off events. [2022-12-06 07:44:44,464 INFO L131 PetriNetUnfolder]: For 73239/73250 co-relation queries the response was YES. [2022-12-06 07:44:44,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31609 conditions, 3934 events. 1611/3934 cut-off events. For 73239/73250 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 34427 event pairs, 63 based on Foata normal form. 5/3933 useless extension candidates. Maximal degree in co-relation 30661. Up to 1436 conditions per place. [2022-12-06 07:44:44,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 630 transitions, 13267 flow [2022-12-06 07:44:44,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 2608 [2022-12-06 07:44:50,519 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [577] L59-->L49-4: Formula: (and (= (select (select |v_#memory_int_75| v_~A~0.base_35) (+ (* v_~i~0_47 4) v_~A~0.offset_35)) |v_thread1Thread1of1ForFork0_#t~mem1#1_25|) (not (<= v_~last~0_20 |v_thread1Thread1of1ForFork0_#t~mem1#1_25|)) (< v_~i~0_47 v_~N~0_29)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_20} OutVars{~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:44:50,567 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [578] L59-->L50: Formula: (and (<= v_~last~0_22 (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37))) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:44:50,608 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [578] L59-->L50: Formula: (and (<= v_~last~0_22 (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37))) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:44:50,645 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [577] L59-->L49-4: Formula: (and (= (select (select |v_#memory_int_75| v_~A~0.base_35) (+ (* v_~i~0_47 4) v_~A~0.offset_35)) |v_thread1Thread1of1ForFork0_#t~mem1#1_25|) (not (<= v_~last~0_20 |v_thread1Thread1of1ForFork0_#t~mem1#1_25|)) (< v_~i~0_47 v_~N~0_29)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_20} OutVars{~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:44:52,024 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] $Ultimate##0-->L117-14: Formula: (let ((.cse3 (store |v_#valid_210| |v_ULTIMATE.start_main_~#t1~0#1.base_71| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_103| 1))) (let ((.cse1 (store .cse2 v_~queue~0.base_174 1)) (.cse0 (select |v_#memory_int_431| 1))) (and (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_281| 2147483648)) (< |v_#StackHeapBarrier_86| |v_ULTIMATE.start_main_~#t1~0#1.base_71|) (= v_~new~0_115 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_71| 0) (= (select .cse0 1) 0) (= v_~N~0_219 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_100|) (= |v_#NULL.offset_40| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_213| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_164| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_233| 0)) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_167|) 0) (= (select .cse2 v_~queue~0.base_174) 0) (< 3 v_~n~0_160) (= 1 (select |v_#valid_210| 1)) (< v_~queue~0.base_174 |v_#StackHeapBarrier_86|) (< |v_#StackHeapBarrier_86| |v_ULTIMATE.start_main_~#t2~0#1.base_103|) (= v_~i~0_319 0) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_280| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_279| 2147483648)) (< 0 |v_#StackHeapBarrier_86|) (= v_~v_old~0_181 0) (< 1 |v_ULTIMATE.start_create_fresh_int_array_~size#1_164|) (= |v_#valid_208| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_167| 1)) (= (select |v_#valid_210| 0) 0) (= v_~A~0.offset_208 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_100| |v_ULTIMATE.start_create_fresh_int_array_~size#1_164|) (<= 0 (+ v_~start~0_242 2147483648)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_213| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_233|) (= (store (store (store (store |v_#length_200| |v_ULTIMATE.start_main_~#t1~0#1.base_71| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_103| 4) v_~queue~0.base_174 (* (mod v_~n~0_160 1073741824) 4)) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_167| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_164| 1073741824) 4)) |v_#length_198|) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_281| 2147483647) (= 2 (select |v_#length_200| 1)) (<= v_~n~0_160 4) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_167| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_103| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_103|) 0) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_277| 2147483648)) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_282| 2147483647) (not (= v_~queue~0.base_174 0)) (= |v_#NULL.base_40| 0) (= (let ((.cse4 (store |v_#memory_int_431| v_~queue~0.base_174 (store (store (store (store (select |v_#memory_int_431| v_~queue~0.base_174) v_~queue~0.offset_174 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_281|) (+ v_~queue~0.offset_174 4) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_280|) (+ 8 v_~queue~0.offset_174) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_279|) (+ 12 v_~queue~0.offset_174) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_282|)))) (store .cse4 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_167| (store (store (select .cse4 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_167|) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_167| |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_277|) (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_167| 4) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_276|))) |v_#memory_int_429|) (= v_~last~0_167 0) (<= v_~start~0_242 2147483647) (<= v_~N~0_219 2147483647) (= v_~ok~0_182 1) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_167| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_167| |v_#StackHeapBarrier_86|) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_279| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_276| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_188| 2) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_276| 2147483647) (= v_~end~0_265 v_~start~0_242) (= (select |v_#length_200| 2) 29) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_280| 2147483648)) (= (select .cse0 0) 48) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_277| 2147483647) (= v_~queue~0.offset_174 0) (= v_~A~0.base_206 0) (= (select |v_#valid_210| |v_ULTIMATE.start_main_~#t1~0#1.base_71|) 0) (= (select |v_#valid_210| 2) 1) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_282| 2147483648)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_86|, #valid=|v_#valid_210|, #memory_int=|v_#memory_int_431|, #length=|v_#length_200|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_167|, ~A~0.base=v_~A~0.base_206, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_103|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_73|, #NULL.offset=|v_#NULL.offset_40|, #length=|v_#length_198|, ~v_old~0=v_~v_old~0_181, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_132|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_82|, ~new~0=v_~new~0_115, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_167|, ~ok~0=v_~ok~0_182, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_82|, ~i~0=v_~i~0_319, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_148|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_118|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_164|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_60|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_131|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_83|, #StackHeapBarrier=|v_#StackHeapBarrier_86|, ~end~0=v_~end~0_265, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_275|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_80|, ~start~0=v_~start~0_242, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_188|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_47|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_131|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_71|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_109|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_80|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_100|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_233|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_80|, ~queue~0.offset=v_~queue~0.offset_174, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_77|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_148|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ~N~0=v_~N~0_219, ~queue~0.base=v_~queue~0.base_174, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_71|, #NULL.base=|v_#NULL.base_40|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_64|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_67|, ~A~0.offset=v_~A~0.offset_208, #valid=|v_#valid_208|, #memory_int=|v_#memory_int_429|, ~n~0=v_~n~0_160, ~last~0=v_~last~0_167, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_103|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_213|} AuxVars[|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_280|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_281|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_282|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_277|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_279|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_276|] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ~queue~0.base, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, #memory_int, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [676] L117-6-->L117-6: Formula: (and (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_66| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_66| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_101| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_102| 1)) (= (store |v_#memory_int_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_97| (store (select |v_#memory_int_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_97|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_102| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_97|) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_66|)) |v_#memory_int_167|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_102| |v_ULTIMATE.start_create_fresh_int_array_~size#1_97|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_97|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_97|, #memory_int=|v_#memory_int_168|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_102|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_97|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_97|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_97|, #memory_int=|v_#memory_int_167|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_101|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_97|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] [2022-12-06 07:44:54,769 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:44:54,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10924 [2022-12-06 07:44:54,770 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 630 transitions, 13382 flow [2022-12-06 07:44:54,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:44:54,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:54,770 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:54,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 07:44:54,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:54,975 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:44:54,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash -581827748, now seen corresponding path program 1 times [2022-12-06 07:44:54,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:54,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644199681] [2022-12-06 07:44:54,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:54,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:44:55,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:55,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644199681] [2022-12-06 07:44:55,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644199681] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:55,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599161890] [2022-12-06 07:44:55,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:55,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:55,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:55,749 INFO L229 MonitoredProcess]: Starting monitored process 16 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:44:55,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 07:44:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:55,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 90 conjunts are in the unsatisfiable core [2022-12-06 07:44:55,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:55,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:44:55,905 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-06 07:44:55,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 96 [2022-12-06 07:44:55,914 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:44:55,915 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2022-12-06 07:44:55,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:44:55,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:44:55,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:44:55,935 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 07:44:55,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 68 [2022-12-06 07:44:55,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 07:44:55,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-06 07:44:56,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:44:56,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2022-12-06 07:44:56,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:44:56,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 26 [2022-12-06 07:44:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:44:56,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:44:56,780 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~start~0 4))) (let ((.cse3 (+ .cse4 c_~queue~0.offset)) (.cse2 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (forall ((~i~0 Int) (v_ArrVal_1073 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1073))) (let ((.cse0 (select (select .cse5 c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4)))) (.cse1 (select .cse5 c_~queue~0.base))) (or (not (<= c_~last~0 .cse0)) (not (= .cse0 (select .cse1 .cse2))) (< (select .cse1 .cse3) (+ (select .cse1 (+ .cse4 c_~queue~0.offset 4)) 1)))))) (forall ((~i~0 Int) (v_ArrVal_1073 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1073))) (let ((.cse6 (select (select .cse8 c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4)))) (.cse7 (select .cse8 c_~queue~0.base))) (or (not (<= c_~last~0 .cse6)) (not (= .cse6 (select .cse7 .cse2))) (<= c_~v_old~0 (select .cse7 .cse3)))))) (or (forall ((~i~0 Int) (v_ArrVal_1073 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1073))) (let ((.cse9 (select (select .cse10 c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (not (<= c_~last~0 .cse9)) (not (= .cse9 (select (select .cse10 c_~queue~0.base) .cse2))))))) (not (= (mod c_~ok~0 256) 0)))))) is different from false [2022-12-06 07:44:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:44:57,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599161890] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:44:57,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:44:57,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-12-06 07:44:57,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392623273] [2022-12-06 07:44:57,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:44:57,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 07:44:57,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:57,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 07:44:57,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=511, Unknown=2, NotChecked=48, Total=702 [2022-12-06 07:44:57,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 07:44:57,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 630 transitions, 13382 flow. Second operand has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 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:44:57,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:57,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 07:44:57,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:02,789 INFO L130 PetriNetUnfolder]: 8232/14145 cut-off events. [2022-12-06 07:45:02,789 INFO L131 PetriNetUnfolder]: For 266222/266222 co-relation queries the response was YES. [2022-12-06 07:45:02,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115309 conditions, 14145 events. 8232/14145 cut-off events. For 266222/266222 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 107433 event pairs, 1220 based on Foata normal form. 3/14146 useless extension candidates. Maximal degree in co-relation 110253. Up to 6209 conditions per place. [2022-12-06 07:45:02,902 INFO L137 encePairwiseOnDemand]: 18/63 looper letters, 570 selfloop transitions, 527 changer transitions 26/1123 dead transitions. [2022-12-06 07:45:02,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1123 transitions, 23322 flow [2022-12-06 07:45:02,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 07:45:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 07:45:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 313 transitions. [2022-12-06 07:45:02,904 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1552579365079365 [2022-12-06 07:45:02,904 INFO L175 Difference]: Start difference. First operand has 158 places, 630 transitions, 13382 flow. Second operand 32 states and 313 transitions. [2022-12-06 07:45:02,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 1123 transitions, 23322 flow [2022-12-06 07:45:03,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 1123 transitions, 23098 flow, removed 106 selfloop flow, removed 3 redundant places. [2022-12-06 07:45:04,008 INFO L231 Difference]: Finished difference. Result has 203 places, 811 transitions, 18882 flow [2022-12-06 07:45:04,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=13231, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=353, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=18882, PETRI_PLACES=203, PETRI_TRANSITIONS=811} [2022-12-06 07:45:04,009 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 178 predicate places. [2022-12-06 07:45:04,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:04,009 INFO L89 Accepts]: Start accepts. Operand has 203 places, 811 transitions, 18882 flow [2022-12-06 07:45:04,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:04,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:04,013 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 811 transitions, 18882 flow [2022-12-06 07:45:04,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 811 transitions, 18882 flow [2022-12-06 07:45:04,866 INFO L130 PetriNetUnfolder]: 2006/4974 cut-off events. [2022-12-06 07:45:04,866 INFO L131 PetriNetUnfolder]: For 116065/116075 co-relation queries the response was YES. [2022-12-06 07:45:04,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43997 conditions, 4974 events. 2006/4974 cut-off events. For 116065/116075 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 46585 event pairs, 72 based on Foata normal form. 4/4972 useless extension candidates. Maximal degree in co-relation 43904. Up to 1901 conditions per place. [2022-12-06 07:45:04,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 811 transitions, 18882 flow [2022-12-06 07:45:04,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 3408 [2022-12-06 07:45:04,946 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:45:05,096 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:45:05,246 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:45:05,393 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:45:05,546 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [776] L50-->L102-3: Formula: (let ((.cse0 (select (select |v_#memory_int_513| v_~A~0.base_277) (+ v_~A~0.offset_279 (* v_~i~0_431 4))))) (and (= .cse0 |v_thread1Thread1of1ForFork0_#t~mem5#1_246|) (= |v_ULTIMATE.start_main_#t~pre17#1_119| |v_#pthreadsForks_161|) (= (+ |v_#pthreadsForks_161| 1) |v_#pthreadsForks_160|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (not (= (ite (and (<= 0 v_~end~0_303) (< v_~end~0_303 v_~n~0_182)) 1 0) 0)) (= (ite (= .cse0 (select (select |v_#memory_int_513| v_~queue~0.base_200) (+ (* v_~end~0_303 4) v_~queue~0.offset_200))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~last~0_239 |v_thread1Thread1of1ForFork0_#t~mem5#1_246|) (= (store |v_#memory_int_513| |v_ULTIMATE.start_main_~#t2~0#1.base_111| (store (select |v_#memory_int_513| |v_ULTIMATE.start_main_~#t2~0#1.base_111|) |v_ULTIMATE.start_main_~#t2~0#1.offset_111| |v_ULTIMATE.start_main_#t~pre17#1_119|)) |v_#memory_int_512|) (= v_~end~0_302 (+ v_~end~0_303 1)))) InVars {~A~0.base=v_~A~0.base_277, ~queue~0.offset=v_~queue~0.offset_200, ~A~0.offset=v_~A~0.offset_279, #pthreadsForks=|v_#pthreadsForks_161|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_111|, ~i~0=v_~i~0_431, #memory_int=|v_#memory_int_513|, ~end~0=v_~end~0_303, ~queue~0.base=v_~queue~0.base_200, ~n~0=v_~n~0_182, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_111|} OutVars{~A~0.base=v_~A~0.base_277, ~queue~0.offset=v_~queue~0.offset_200, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_111|, ~i~0=v_~i~0_431, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_59|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_59|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_130|, ~queue~0.base=v_~queue~0.base_200, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_119|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_92|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_246|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, ~A~0.offset=v_~A~0.offset_279, #pthreadsForks=|v_#pthreadsForks_160|, #memory_int=|v_#memory_int_512|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~end~0=v_~end~0_302, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_59|, ~n~0=v_~n~0_182, ~last~0=v_~last~0_239, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_111|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~mem2#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet16#1, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #pthreadsForks, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, ~last~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:45:05,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [776] L50-->L102-3: Formula: (let ((.cse0 (select (select |v_#memory_int_513| v_~A~0.base_277) (+ v_~A~0.offset_279 (* v_~i~0_431 4))))) (and (= .cse0 |v_thread1Thread1of1ForFork0_#t~mem5#1_246|) (= |v_ULTIMATE.start_main_#t~pre17#1_119| |v_#pthreadsForks_161|) (= (+ |v_#pthreadsForks_161| 1) |v_#pthreadsForks_160|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (not (= (ite (and (<= 0 v_~end~0_303) (< v_~end~0_303 v_~n~0_182)) 1 0) 0)) (= (ite (= .cse0 (select (select |v_#memory_int_513| v_~queue~0.base_200) (+ (* v_~end~0_303 4) v_~queue~0.offset_200))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~last~0_239 |v_thread1Thread1of1ForFork0_#t~mem5#1_246|) (= (store |v_#memory_int_513| |v_ULTIMATE.start_main_~#t2~0#1.base_111| (store (select |v_#memory_int_513| |v_ULTIMATE.start_main_~#t2~0#1.base_111|) |v_ULTIMATE.start_main_~#t2~0#1.offset_111| |v_ULTIMATE.start_main_#t~pre17#1_119|)) |v_#memory_int_512|) (= v_~end~0_302 (+ v_~end~0_303 1)))) InVars {~A~0.base=v_~A~0.base_277, ~queue~0.offset=v_~queue~0.offset_200, ~A~0.offset=v_~A~0.offset_279, #pthreadsForks=|v_#pthreadsForks_161|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_111|, ~i~0=v_~i~0_431, #memory_int=|v_#memory_int_513|, ~end~0=v_~end~0_303, ~queue~0.base=v_~queue~0.base_200, ~n~0=v_~n~0_182, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_111|} OutVars{~A~0.base=v_~A~0.base_277, ~queue~0.offset=v_~queue~0.offset_200, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_111|, ~i~0=v_~i~0_431, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_59|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_59|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_130|, ~queue~0.base=v_~queue~0.base_200, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_119|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_92|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_246|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, ~A~0.offset=v_~A~0.offset_279, #pthreadsForks=|v_#pthreadsForks_160|, #memory_int=|v_#memory_int_512|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~end~0=v_~end~0_302, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_59|, ~n~0=v_~n~0_182, ~last~0=v_~last~0_239, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_111|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~mem2#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet16#1, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #pthreadsForks, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, ~last~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:45:05,684 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:45:05,789 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:45:05,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1781 [2022-12-06 07:45:05,790 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 809 transitions, 18939 flow [2022-12-06 07:45:05,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 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:45:05,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:05,790 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:45:05,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-06 07:45:05,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:05,996 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:45:05,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:05,996 INFO L85 PathProgramCache]: Analyzing trace with hash 316547263, now seen corresponding path program 1 times [2022-12-06 07:45:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:05,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324522756] [2022-12-06 07:45:05,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:05,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:06,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:06,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324522756] [2022-12-06 07:45:06,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324522756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:06,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:06,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:45:06,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644810060] [2022-12-06 07:45:06,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:06,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:45:06,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:06,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:45:06,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:45:06,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 07:45:06,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 809 transitions, 18939 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:45:06,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:06,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 07:45:06,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:09,743 INFO L130 PetriNetUnfolder]: 8285/14300 cut-off events. [2022-12-06 07:45:09,743 INFO L131 PetriNetUnfolder]: For 336748/336748 co-relation queries the response was YES. [2022-12-06 07:45:09,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126136 conditions, 14300 events. 8285/14300 cut-off events. For 336748/336748 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 109031 event pairs, 785 based on Foata normal form. 16/14314 useless extension candidates. Maximal degree in co-relation 126033. Up to 12134 conditions per place. [2022-12-06 07:45:09,877 INFO L137 encePairwiseOnDemand]: 56/69 looper letters, 847 selfloop transitions, 41 changer transitions 5/893 dead transitions. [2022-12-06 07:45:09,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 893 transitions, 22196 flow [2022-12-06 07:45:09,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:45:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:45:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-12-06 07:45:09,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4106280193236715 [2022-12-06 07:45:09,878 INFO L175 Difference]: Start difference. First operand has 198 places, 809 transitions, 18939 flow. Second operand 3 states and 85 transitions. [2022-12-06 07:45:09,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 893 transitions, 22196 flow [2022-12-06 07:45:11,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 893 transitions, 21860 flow, removed 168 selfloop flow, removed 4 redundant places. [2022-12-06 07:45:11,991 INFO L231 Difference]: Finished difference. Result has 198 places, 814 transitions, 18797 flow [2022-12-06 07:45:11,992 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=18511, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=764, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=18797, PETRI_PLACES=198, PETRI_TRANSITIONS=814} [2022-12-06 07:45:11,992 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 173 predicate places. [2022-12-06 07:45:11,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:11,992 INFO L89 Accepts]: Start accepts. Operand has 198 places, 814 transitions, 18797 flow [2022-12-06 07:45:11,995 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:11,995 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:11,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 814 transitions, 18797 flow [2022-12-06 07:45:12,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 814 transitions, 18797 flow [2022-12-06 07:45:12,942 INFO L130 PetriNetUnfolder]: 2084/5287 cut-off events. [2022-12-06 07:45:12,942 INFO L131 PetriNetUnfolder]: For 122125/122420 co-relation queries the response was YES. [2022-12-06 07:45:12,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45752 conditions, 5287 events. 2084/5287 cut-off events. For 122125/122420 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 50858 event pairs, 75 based on Foata normal form. 8/5252 useless extension candidates. Maximal degree in co-relation 44190. Up to 1934 conditions per place. [2022-12-06 07:45:13,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 814 transitions, 18797 flow [2022-12-06 07:45:13,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 3412 [2022-12-06 07:45:13,034 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:13,034 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1042 [2022-12-06 07:45:13,034 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 814 transitions, 18797 flow [2022-12-06 07:45:13,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:45:13,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:13,059 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:13,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 07:45:13,059 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:45:13,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:13,060 INFO L85 PathProgramCache]: Analyzing trace with hash -376476575, now seen corresponding path program 1 times [2022-12-06 07:45:13,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:13,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321359628] [2022-12-06 07:45:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:13,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:45:13,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:13,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321359628] [2022-12-06 07:45:13,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321359628] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:13,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642172889] [2022-12-06 07:45:13,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:13,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:13,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:13,148 INFO L229 MonitoredProcess]: Starting monitored process 17 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:13,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 07:45:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:13,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:45:13,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:45:13,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:45:13,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642172889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:13,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:45:13,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 07:45:13,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077013468] [2022-12-06 07:45:13,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:13,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:13,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:13,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:13,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:13,295 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 07:45:13,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 814 transitions, 18797 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:13,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:13,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 07:45:13,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:17,176 INFO L130 PetriNetUnfolder]: 8120/14119 cut-off events. [2022-12-06 07:45:17,176 INFO L131 PetriNetUnfolder]: For 338464/338464 co-relation queries the response was YES. [2022-12-06 07:45:17,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125140 conditions, 14119 events. 8120/14119 cut-off events. For 338464/338464 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 108855 event pairs, 3011 based on Foata normal form. 94/14211 useless extension candidates. Maximal degree in co-relation 122938. Up to 13717 conditions per place. [2022-12-06 07:45:17,311 INFO L137 encePairwiseOnDemand]: 55/65 looper letters, 751 selfloop transitions, 0 changer transitions 68/819 dead transitions. [2022-12-06 07:45:17,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 819 transitions, 20386 flow [2022-12-06 07:45:17,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:45:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:45:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-06 07:45:17,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2022-12-06 07:45:17,312 INFO L175 Difference]: Start difference. First operand has 198 places, 814 transitions, 18797 flow. Second operand 4 states and 90 transitions. [2022-12-06 07:45:17,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 819 transitions, 20386 flow [2022-12-06 07:45:19,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 819 transitions, 20266 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 07:45:19,068 INFO L231 Difference]: Finished difference. Result has 194 places, 751 transitions, 17205 flow [2022-12-06 07:45:19,069 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=18059, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=17205, PETRI_PLACES=194, PETRI_TRANSITIONS=751} [2022-12-06 07:45:19,069 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 169 predicate places. [2022-12-06 07:45:19,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:19,069 INFO L89 Accepts]: Start accepts. Operand has 194 places, 751 transitions, 17205 flow [2022-12-06 07:45:19,072 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:19,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:19,072 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 751 transitions, 17205 flow [2022-12-06 07:45:19,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 751 transitions, 17205 flow [2022-12-06 07:45:20,003 INFO L130 PetriNetUnfolder]: 1987/5071 cut-off events. [2022-12-06 07:45:20,003 INFO L131 PetriNetUnfolder]: For 114055/114336 co-relation queries the response was YES. [2022-12-06 07:45:20,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43615 conditions, 5071 events. 1987/5071 cut-off events. For 114055/114336 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 49052 event pairs, 75 based on Foata normal form. 8/5037 useless extension candidates. Maximal degree in co-relation 43300. Up to 1856 conditions per place. [2022-12-06 07:45:20,106 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 751 transitions, 17205 flow [2022-12-06 07:45:20,107 INFO L188 LiptonReduction]: Number of co-enabled transitions 3208 [2022-12-06 07:45:20,110 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:20,110 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1041 [2022-12-06 07:45:20,110 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 751 transitions, 17205 flow [2022-12-06 07:45:20,110 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:20,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:20,111 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:20,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-06 07:45:20,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-06 07:45:20,317 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:45:20,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:20,317 INFO L85 PathProgramCache]: Analyzing trace with hash 349954973, now seen corresponding path program 1 times [2022-12-06 07:45:20,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:20,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73642720] [2022-12-06 07:45:20,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:20,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:21,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:21,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73642720] [2022-12-06 07:45:21,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73642720] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:21,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315652300] [2022-12-06 07:45:21,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:21,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:21,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:21,133 INFO L229 MonitoredProcess]: Starting monitored process 18 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:21,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 07:45:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:21,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 07:45:21,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:21,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-12-06 07:45:21,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 94 [2022-12-06 07:45:21,284 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 07:45:21,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-06 07:45:21,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:21,378 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 07:45:21,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 54 [2022-12-06 07:45:21,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2022-12-06 07:45:21,837 INFO L321 Elim1Store]: treesize reduction 37, result has 57.5 percent of original size [2022-12-06 07:45:21,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 65 [2022-12-06 07:45:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:21,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:22,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315652300] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:22,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:22,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2022-12-06 07:45:22,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066044551] [2022-12-06 07:45:22,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:22,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 07:45:22,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:22,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 07:45:22,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2022-12-06 07:45:22,379 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 07:45:22,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 751 transitions, 17205 flow. Second operand has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 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:22,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:22,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 07:45:22,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:22,447 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (* c_~start~0 4)) (.cse27 (* c_~end~0 4))) (let ((.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ .cse27 c_~queue~0.offset))) (.cse16 (< c_~end~0 0)) (.cse4 (+ .cse28 c_~queue~0.offset)) (.cse14 (+ .cse28 c_~queue~0.offset 4)) (.cse5 (+ .cse27 c_~queue~0.offset 4)) (.cse7 (not (= (mod c_~ok~0 256) 0))) (.cse17 (<= c_~n~0 (+ c_~end~0 1)))) (and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse0 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (<= c_~last~0 .cse0)) (not (= .cse1 .cse0)) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse2 (select (select .cse6 ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4)))) (.cse3 (select .cse6 c_~queue~0.base))) (or (< .cse2 .cse0) (<= c_~v_old~0 (select .cse3 .cse4)) (not (= .cse2 (select .cse3 .cse5)))))))))) (or .cse7 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int) (~A~0.base Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse9 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (.cse8 (select (select .cse10 ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (or (< .cse8 .cse9) (not (<= c_~last~0 .cse9)) (not (= .cse1 .cse9)) (not (= .cse8 (select (select .cse10 c_~queue~0.base) .cse5)))))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse12 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse11 (select (select .cse15 ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4)))) (.cse13 (select .cse15 c_~queue~0.base))) (or (< .cse11 .cse12) (not (= .cse11 (select .cse13 .cse5))) (< (select .cse13 .cse4) (+ (select .cse13 .cse14) 1)))))) (not (<= c_~last~0 .cse12)) (not (= .cse1 .cse12)))))) .cse16 .cse17) (let ((.cse18 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (or (not (= .cse1 .cse18)) .cse16 (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse20 (select (select .cse21 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_492 4)))) (.cse19 (select .cse21 c_~queue~0.base))) (or (<= c_~v_old~0 (select .cse19 .cse4)) (< .cse20 .cse18) (not (= .cse20 (select .cse19 .cse5))))))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse22 (select (select .cse24 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_492 4)))) (.cse23 (select .cse24 c_~queue~0.base))) (or (< .cse22 .cse18) (< (select .cse23 .cse4) (+ (select .cse23 .cse14) 1)) (not (= .cse22 (select .cse23 .cse5))))))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse25 (select (select .cse26 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_492 4))))) (or (< .cse25 .cse18) (not (= .cse25 (select (select .cse26 c_~queue~0.base) .cse5))))))) .cse7)) .cse17)) (= c_~ok~0 1)))) is different from false [2022-12-06 07:45:23,549 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (* c_~start~0 4)) (.cse27 (select |c_#memory_int| c_~queue~0.base)) (.cse29 (* c_~end~0 4))) (let ((.cse1 (select .cse27 (+ .cse29 c_~queue~0.offset))) (.cse16 (< c_~end~0 0)) (.cse14 (+ .cse28 c_~queue~0.offset 4)) (.cse5 (+ .cse29 c_~queue~0.offset 4)) (.cse17 (<= c_~n~0 (+ c_~end~0 1))) (.cse7 (not (= (mod c_~ok~0 256) 0))) (.cse4 (+ .cse28 c_~queue~0.offset))) (and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse0 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (<= c_~last~0 .cse0)) (not (= .cse1 .cse0)) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse2 (select (select .cse6 ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4)))) (.cse3 (select .cse6 c_~queue~0.base))) (or (< .cse2 .cse0) (<= c_~v_old~0 (select .cse3 .cse4)) (not (= .cse2 (select .cse3 .cse5)))))))))) (or .cse7 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int) (~A~0.base Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse9 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (.cse8 (select (select .cse10 ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (or (< .cse8 .cse9) (not (<= c_~last~0 .cse9)) (not (= .cse1 .cse9)) (not (= .cse8 (select (select .cse10 c_~queue~0.base) .cse5)))))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse12 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse11 (select (select .cse15 ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4)))) (.cse13 (select .cse15 c_~queue~0.base))) (or (< .cse11 .cse12) (not (= .cse11 (select .cse13 .cse5))) (< (select .cse13 .cse4) (+ (select .cse13 .cse14) 1)))))) (not (<= c_~last~0 .cse12)) (not (= .cse1 .cse12)))))) .cse16 .cse17) (let ((.cse18 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (or (not (= .cse1 .cse18)) .cse16 (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse20 (select (select .cse21 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_492 4)))) (.cse19 (select .cse21 c_~queue~0.base))) (or (<= c_~v_old~0 (select .cse19 .cse4)) (< .cse20 .cse18) (not (= .cse20 (select .cse19 .cse5))))))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse22 (select (select .cse24 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_492 4)))) (.cse23 (select .cse24 c_~queue~0.base))) (or (< .cse22 .cse18) (< (select .cse23 .cse4) (+ (select .cse23 .cse14) 1)) (not (= .cse22 (select .cse23 .cse5))))))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse25 (select (select .cse26 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_492 4))))) (or (< .cse25 .cse18) (not (= .cse25 (select (select .cse26 c_~queue~0.base) .cse5))))))) .cse7)) .cse17)) .cse7 (= c_~ok~0 1) (< c_~v_old~0 (+ (select .cse27 .cse4) 1))))) is different from false [2022-12-06 07:45:23,833 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse30 (* c_~end~0 4))) (let ((.cse31 (* c_~start~0 4)) (.cse8 (select .cse4 (+ .cse30 c_~queue~0.offset))) (.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse1 (not (= .cse8 .cse0))) (.cse20 (< c_~end~0 0)) (.cse6 (+ .cse31 c_~queue~0.offset)) (.cse5 (+ .cse31 c_~queue~0.offset 4)) (.cse11 (+ .cse30 c_~queue~0.offset 4)) (.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse21 (<= c_~n~0 (+ c_~end~0 1)))) (and (or (not (<= c_~last~0 .cse0)) (not (< c_~end~0 c_~n~0)) .cse1 (not (< c_~i~0 c_~N~0)) (not (<= 0 c_~end~0)) (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse3 (select .cse4 .cse6))) (and .cse2 (<= c_~v_old~0 .cse3) (< .cse3 (+ (select .cse4 .cse5) 1))))) (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse7 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (<= c_~last~0 .cse7)) (not (= .cse8 .cse7)) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse9 (select (select .cse12 ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4)))) (.cse10 (select .cse12 c_~queue~0.base))) (or (< .cse9 .cse7) (<= c_~v_old~0 (select .cse10 .cse6)) (not (= .cse9 (select .cse10 .cse11)))))))))) (or .cse2 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int) (~A~0.base Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse14 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (.cse13 (select (select .cse15 ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (or (< .cse13 .cse14) (not (<= c_~last~0 .cse14)) (not (= .cse8 .cse14)) (not (= .cse13 (select (select .cse15 c_~queue~0.base) .cse11)))))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse17 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse16 (select (select .cse19 ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4)))) (.cse18 (select .cse19 c_~queue~0.base))) (or (< .cse16 .cse17) (not (= .cse16 (select .cse18 .cse11))) (< (select .cse18 .cse6) (+ (select .cse18 .cse5) 1)))))) (not (<= c_~last~0 .cse17)) (not (= .cse8 .cse17)))))) .cse20 .cse21) (or .cse1 .cse20 (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse23 (select (select .cse24 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_492 4)))) (.cse22 (select .cse24 c_~queue~0.base))) (or (<= c_~v_old~0 (select .cse22 .cse6)) (< .cse23 .cse0) (not (= .cse23 (select .cse22 .cse11))))))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse25 (select (select .cse27 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_492 4)))) (.cse26 (select .cse27 c_~queue~0.base))) (or (< .cse25 .cse0) (< (select .cse26 .cse6) (+ (select .cse26 .cse5) 1)) (not (= .cse25 (select .cse26 .cse11))))))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294))) (let ((.cse28 (select (select .cse29 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_492 4))))) (or (< .cse28 .cse0) (not (= .cse28 (select (select .cse29 c_~queue~0.base) .cse11))))))) .cse2)) .cse21) (= c_~ok~0 1))))) is different from false [2022-12-06 07:45:33,258 INFO L130 PetriNetUnfolder]: 10482/18290 cut-off events. [2022-12-06 07:45:33,258 INFO L131 PetriNetUnfolder]: For 440790/440790 co-relation queries the response was YES. [2022-12-06 07:45:33,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160949 conditions, 18290 events. 10482/18290 cut-off events. For 440790/440790 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 148622 event pairs, 1940 based on Foata normal form. 4/18293 useless extension candidates. Maximal degree in co-relation 160244. Up to 10652 conditions per place. [2022-12-06 07:45:33,430 INFO L137 encePairwiseOnDemand]: 11/56 looper letters, 845 selfloop transitions, 911 changer transitions 105/1861 dead transitions. [2022-12-06 07:45:33,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 1861 transitions, 44025 flow [2022-12-06 07:45:33,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-06 07:45:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-06 07:45:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 307 transitions. [2022-12-06 07:45:33,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14056776556776557 [2022-12-06 07:45:33,432 INFO L175 Difference]: Start difference. First operand has 189 places, 751 transitions, 17205 flow. Second operand 39 states and 307 transitions. [2022-12-06 07:45:33,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 1861 transitions, 44025 flow [2022-12-06 07:45:35,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 1861 transitions, 43888 flow, removed 65 selfloop flow, removed 5 redundant places. [2022-12-06 07:45:35,775 INFO L231 Difference]: Finished difference. Result has 250 places, 1566 transitions, 39833 flow [2022-12-06 07:45:35,776 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=17170, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=39833, PETRI_PLACES=250, PETRI_TRANSITIONS=1566} [2022-12-06 07:45:35,777 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 225 predicate places. [2022-12-06 07:45:35,777 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:35,777 INFO L89 Accepts]: Start accepts. Operand has 250 places, 1566 transitions, 39833 flow [2022-12-06 07:45:35,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:35,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:35,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 1566 transitions, 39833 flow [2022-12-06 07:45:35,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 1566 transitions, 39833 flow [2022-12-06 07:45:38,314 INFO L130 PetriNetUnfolder]: 4494/10077 cut-off events. [2022-12-06 07:45:38,314 INFO L131 PetriNetUnfolder]: For 276794/277379 co-relation queries the response was YES. [2022-12-06 07:45:38,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97849 conditions, 10077 events. 4494/10077 cut-off events. For 276794/277379 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 99111 event pairs, 315 based on Foata normal form. 19/9795 useless extension candidates. Maximal degree in co-relation 97289. Up to 3789 conditions per place. [2022-12-06 07:45:38,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 1566 transitions, 39833 flow [2022-12-06 07:45:38,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 4272 [2022-12-06 07:45:38,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] L50-->L102-3: Formula: (and (not (= (ite (and (< v_~end~0_307 v_~n~0_184) (<= 0 v_~end~0_307)) 1 0) 0)) (= (+ v_~end~0_307 1) v_~end~0_306) (= (+ |v_#pthreadsForks_165| 1) |v_#pthreadsForks_164|) (= |v_ULTIMATE.start_main_#t~pre17#1_121| |v_#pthreadsForks_165|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (= (select (select |v_#memory_int_517| v_~queue~0.base_202) (+ (* v_~end~0_307 4) v_~queue~0.offset_202)) (select (select |v_#memory_int_517| v_~A~0.base_279) (+ (* v_~i~0_433 4) v_~A~0.offset_281))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| 0)) (= (store |v_#memory_int_517| |v_ULTIMATE.start_main_~#t2~0#1.base_113| (store (select |v_#memory_int_517| |v_ULTIMATE.start_main_~#t2~0#1.base_113|) |v_ULTIMATE.start_main_~#t2~0#1.offset_113| |v_ULTIMATE.start_main_#t~pre17#1_121|)) |v_#memory_int_516|)) InVars {~A~0.base=v_~A~0.base_279, ~queue~0.offset=v_~queue~0.offset_202, ~A~0.offset=v_~A~0.offset_281, #pthreadsForks=|v_#pthreadsForks_165|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_113|, ~i~0=v_~i~0_433, #memory_int=|v_#memory_int_517|, ~end~0=v_~end~0_307, ~queue~0.base=v_~queue~0.base_202, ~n~0=v_~n~0_184, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_113|} OutVars{~A~0.base=v_~A~0.base_279, ~queue~0.offset=v_~queue~0.offset_202, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_113|, ~i~0=v_~i~0_433, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_61|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_61|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_132|, ~queue~0.base=v_~queue~0.base_202, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_121|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_94|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, ~A~0.offset=v_~A~0.offset_281, #pthreadsForks=|v_#pthreadsForks_164|, #memory_int=|v_#memory_int_516|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, ~end~0=v_~end~0_306, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_61|, ~n~0=v_~n~0_184, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_113|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post4#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, ULTIMATE.start_main_#t~pre15#1, thread1Thread1of1ForFork0_#t~mem3#1, ULTIMATE.start_main_#t~pre17#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:45:38,574 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:45:39,153 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:45:39,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L59-->L50: Formula: (and (<= v_~last~0_22 (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37))) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:45:39,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:45:39,808 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 07:45:39,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4031 [2022-12-06 07:45:39,809 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 1563 transitions, 39930 flow [2022-12-06 07:45:39,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 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:39,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:39,809 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:39,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 07:45:40,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:40,010 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:45:40,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1564875135, now seen corresponding path program 1 times [2022-12-06 07:45:40,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:40,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179326388] [2022-12-06 07:45:40,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:40,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:40,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:40,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179326388] [2022-12-06 07:45:40,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179326388] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:40,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818948881] [2022-12-06 07:45:40,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:40,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:40,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:40,095 INFO L229 MonitoredProcess]: Starting monitored process 19 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,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 07:45:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:40,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:45:40,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:40,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:40,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818948881] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:40,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:40,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 10 [2022-12-06 07:45:40,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399451234] [2022-12-06 07:45:40,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:40,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:45:40,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:40,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:45:40,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:45:40,307 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 07:45:40,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 1563 transitions, 39930 flow. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 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,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:40,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 07:45:40,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:50,593 INFO L130 PetriNetUnfolder]: 14820/25784 cut-off events. [2022-12-06 07:45:50,593 INFO L131 PetriNetUnfolder]: For 742941/742941 co-relation queries the response was YES. [2022-12-06 07:45:50,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261864 conditions, 25784 events. 14820/25784 cut-off events. For 742941/742941 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 211637 event pairs, 1285 based on Foata normal form. 76/25860 useless extension candidates. Maximal degree in co-relation 260856. Up to 9463 conditions per place. [2022-12-06 07:45:50,927 INFO L137 encePairwiseOnDemand]: 39/65 looper letters, 1309 selfloop transitions, 1200 changer transitions 38/2547 dead transitions. [2022-12-06 07:45:50,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 2547 transitions, 69301 flow [2022-12-06 07:45:50,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-06 07:45:50,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3569230769230769 [2022-12-06 07:45:50,929 INFO L175 Difference]: Start difference. First operand has 247 places, 1563 transitions, 39930 flow. Second operand 5 states and 116 transitions. [2022-12-06 07:45:50,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 2547 transitions, 69301 flow [2022-12-06 07:45:56,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 2547 transitions, 67697 flow, removed 792 selfloop flow, removed 3 redundant places. [2022-12-06 07:45:56,470 INFO L231 Difference]: Finished difference. Result has 250 places, 2247 transitions, 62769 flow [2022-12-06 07:45:56,471 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=39031, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=653, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62769, PETRI_PLACES=250, PETRI_TRANSITIONS=2247} [2022-12-06 07:45:56,471 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 225 predicate places. [2022-12-06 07:45:56,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:56,472 INFO L89 Accepts]: Start accepts. Operand has 250 places, 2247 transitions, 62769 flow [2022-12-06 07:45:56,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:56,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:56,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 2247 transitions, 62769 flow [2022-12-06 07:45:56,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 2247 transitions, 62769 flow [2022-12-06 07:46:00,930 INFO L130 PetriNetUnfolder]: 6613/14642 cut-off events. [2022-12-06 07:46:00,930 INFO L131 PetriNetUnfolder]: For 426128/427109 co-relation queries the response was YES. [2022-12-06 07:46:01,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145361 conditions, 14642 events. 6613/14642 cut-off events. For 426128/427109 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 146773 event pairs, 525 based on Foata normal form. 34/14156 useless extension candidates. Maximal degree in co-relation 143415. Up to 5619 conditions per place. [2022-12-06 07:46:01,376 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 249 places, 2247 transitions, 62769 flow [2022-12-06 07:46:01,376 INFO L188 LiptonReduction]: Number of co-enabled transitions 6514 [2022-12-06 07:46:01,381 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:01,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4917 [2022-12-06 07:46:01,390 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 2247 transitions, 62769 flow [2022-12-06 07:46:01,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 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:01,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:01,390 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:01,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-06 07:46:01,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:46:01,596 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:46:01,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:01,600 INFO L85 PathProgramCache]: Analyzing trace with hash -587835423, now seen corresponding path program 1 times [2022-12-06 07:46:01,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:01,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836473232] [2022-12-06 07:46:01,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:01,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:03,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:03,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836473232] [2022-12-06 07:46:03,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836473232] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:46:03,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273912081] [2022-12-06 07:46:03,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:03,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:46:03,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:46:03,007 INFO L229 MonitoredProcess]: Starting monitored process 20 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:03,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 07:46:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:03,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-06 07:46:03,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:46:03,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-12-06 07:46:03,180 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 07:46:03,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-06 07:46:03,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-06 07:46:03,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:46:03,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2022-12-06 07:46:03,632 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:46:03,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 28 [2022-12-06 07:46:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:03,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:46:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:04,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273912081] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:46:04,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:46:04,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2022-12-06 07:46:04,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509983550] [2022-12-06 07:46:04,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:46:04,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 07:46:04,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:04,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 07:46:04,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=469, Unknown=8, NotChecked=0, Total=600 [2022-12-06 07:46:04,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 07:46:04,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 2247 transitions, 62769 flow. Second operand has 25 states, 24 states have (on average 2.375) internal successors, (57), 24 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:04,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:04,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 07:46:04,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:04,495 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (* c_~start~0 4)) (.cse29 (* c_~end~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_~queue~0.base) (+ .cse29 c_~queue~0.offset))) (.cse17 (< c_~end~0 0)) (.cse18 (<= c_~n~0 (+ c_~end~0 1))) (.cse16 (+ .cse28 c_~queue~0.offset 4)) (.cse6 (not (= (mod c_~ok~0 256) 0))) (.cse4 (+ .cse29 c_~queue~0.offset 4)) (.cse10 (+ .cse28 c_~queue~0.offset)) (.cse5 (select |c_#memory_int| c_~A~0.base))) (and (or (and (or (forall ((~A~0.offset Int) (v_~i~0_514 Int) (~i~0 Int) (v_ArrVal_1485 (Array Int Int))) (let ((.cse3 (+ (* v_~i~0_514 4) ~A~0.offset)) (.cse1 (select .cse5 (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse0 .cse1)) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485))) (= (select (select .cse2 c_~A~0.base) .cse3) (select (select .cse2 c_~queue~0.base) .cse4)))) (< (select .cse5 .cse3) .cse1) (not (<= c_~last~0 .cse1))))) .cse6) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse7 (select .cse5 (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse0 .cse7)) (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485))) (let ((.cse9 (select .cse11 c_~queue~0.base)) (.cse8 (+ (* v_~i~0_515 4) ~A~0.offset))) (or (< (select .cse5 .cse8) .cse7) (<= c_~v_old~0 (select .cse9 .cse10)) (not (= (select .cse9 .cse4) (select (select .cse11 c_~A~0.base) .cse8))))))) (not (<= c_~last~0 .cse7))))) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse12 (select .cse5 (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse0 .cse12)) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485))) (let ((.cse13 (+ ~A~0.offset (* v_~i~0_513 4))) (.cse15 (select .cse14 c_~queue~0.base))) (or (< (select .cse5 .cse13) .cse12) (not (= (select (select .cse14 c_~A~0.base) .cse13) (select .cse15 .cse4))) (< (select .cse15 .cse10) (+ (select .cse15 .cse16) 1)))))) (not (<= c_~last~0 .cse12)))))) .cse17 .cse18) (= c_~ok~0 1) (let ((.cse19 (select .cse5 (+ c_~A~0.offset (* c_~i~0 4))))) (or (not (= .cse0 .cse19)) .cse17 .cse18 (and (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485))) (let ((.cse20 (+ c_~A~0.offset (* v_~i~0_513 4))) (.cse22 (select .cse21 c_~queue~0.base))) (or (< (select .cse5 .cse20) .cse19) (not (= (select (select .cse21 c_~A~0.base) .cse20) (select .cse22 .cse4))) (< (select .cse22 .cse10) (+ (select .cse22 .cse16) 1)))))) (or (forall ((v_~i~0_514 Int) (v_ArrVal_1485 (Array Int Int))) (let ((.cse23 (+ c_~A~0.offset (* v_~i~0_514 4)))) (or (< (select .cse5 .cse23) .cse19) (not (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485))) (= (select (select .cse24 c_~A~0.base) .cse23) (select (select .cse24 c_~queue~0.base) .cse4))))))) .cse6) (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485))) (let ((.cse27 (select .cse25 c_~queue~0.base)) (.cse26 (+ c_~A~0.offset (* v_~i~0_515 4)))) (or (not (= (select (select .cse25 c_~A~0.base) .cse26) (select .cse27 .cse4))) (<= c_~v_old~0 (select .cse27 .cse10)) (< (select .cse5 .cse26) .cse19))))))))))) is different from false [2022-12-06 07:46:05,808 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse29 (* c_~start~0 4)) (.cse19 (select |c_#memory_int| c_~queue~0.base)) (.cse30 (* c_~end~0 4))) (let ((.cse0 (select .cse19 (+ .cse30 c_~queue~0.offset))) (.cse17 (< c_~end~0 0)) (.cse18 (<= c_~n~0 (+ c_~end~0 1))) (.cse16 (+ .cse29 c_~queue~0.offset 4)) (.cse6 (not (= (mod c_~ok~0 256) 0))) (.cse4 (+ .cse30 c_~queue~0.offset 4)) (.cse10 (+ .cse29 c_~queue~0.offset)) (.cse5 (select |c_#memory_int| c_~A~0.base))) (and (or (and (or (forall ((~A~0.offset Int) (v_~i~0_514 Int) (~i~0 Int) (v_ArrVal_1485 (Array Int Int))) (let ((.cse3 (+ (* v_~i~0_514 4) ~A~0.offset)) (.cse1 (select .cse5 (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse0 .cse1)) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485))) (= (select (select .cse2 c_~A~0.base) .cse3) (select (select .cse2 c_~queue~0.base) .cse4)))) (< (select .cse5 .cse3) .cse1) (not (<= c_~last~0 .cse1))))) .cse6) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse7 (select .cse5 (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse0 .cse7)) (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485))) (let ((.cse9 (select .cse11 c_~queue~0.base)) (.cse8 (+ (* v_~i~0_515 4) ~A~0.offset))) (or (< (select .cse5 .cse8) .cse7) (<= c_~v_old~0 (select .cse9 .cse10)) (not (= (select .cse9 .cse4) (select (select .cse11 c_~A~0.base) .cse8))))))) (not (<= c_~last~0 .cse7))))) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse12 (select .cse5 (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse0 .cse12)) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485))) (let ((.cse13 (+ ~A~0.offset (* v_~i~0_513 4))) (.cse15 (select .cse14 c_~queue~0.base))) (or (< (select .cse5 .cse13) .cse12) (not (= (select (select .cse14 c_~A~0.base) .cse13) (select .cse15 .cse4))) (< (select .cse15 .cse10) (+ (select .cse15 .cse16) 1)))))) (not (<= c_~last~0 .cse12)))))) .cse17 .cse18) .cse6 (= c_~ok~0 1) (< c_~v_old~0 (+ (select .cse19 .cse10) 1)) (let ((.cse20 (select .cse5 (+ c_~A~0.offset (* c_~i~0 4))))) (or (not (= .cse0 .cse20)) .cse17 .cse18 (and (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485))) (let ((.cse21 (+ c_~A~0.offset (* v_~i~0_513 4))) (.cse23 (select .cse22 c_~queue~0.base))) (or (< (select .cse5 .cse21) .cse20) (not (= (select (select .cse22 c_~A~0.base) .cse21) (select .cse23 .cse4))) (< (select .cse23 .cse10) (+ (select .cse23 .cse16) 1)))))) (or (forall ((v_~i~0_514 Int) (v_ArrVal_1485 (Array Int Int))) (let ((.cse24 (+ c_~A~0.offset (* v_~i~0_514 4)))) (or (< (select .cse5 .cse24) .cse20) (not (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485))) (= (select (select .cse25 c_~A~0.base) .cse24) (select (select .cse25 c_~queue~0.base) .cse4))))))) .cse6) (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485))) (let ((.cse28 (select .cse26 c_~queue~0.base)) (.cse27 (+ c_~A~0.offset (* v_~i~0_515 4)))) (or (not (= (select (select .cse26 c_~A~0.base) .cse27) (select .cse28 .cse4))) (<= c_~v_old~0 (select .cse28 .cse10)) (< (select .cse5 .cse27) .cse20))))))))))) is different from false [2022-12-06 07:46:09,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:46:11,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:46:31,604 INFO L130 PetriNetUnfolder]: 17153/30310 cut-off events. [2022-12-06 07:46:31,604 INFO L131 PetriNetUnfolder]: For 965033/965033 co-relation queries the response was YES. [2022-12-06 07:46:32,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317004 conditions, 30310 events. 17153/30310 cut-off events. For 965033/965033 co-relation queries the response was YES. Maximal size of possible extension queue 1448. Compared 260666 event pairs, 4511 based on Foata normal form. 52/30362 useless extension candidates. Maximal degree in co-relation 314877. Up to 17820 conditions per place. [2022-12-06 07:46:32,263 INFO L137 encePairwiseOnDemand]: 16/65 looper letters, 1747 selfloop transitions, 1438 changer transitions 179/3364 dead transitions. [2022-12-06 07:46:32,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 3364 transitions, 95508 flow [2022-12-06 07:46:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-06 07:46:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-06 07:46:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 318 transitions. [2022-12-06 07:46:32,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11377459749552772 [2022-12-06 07:46:32,264 INFO L175 Difference]: Start difference. First operand has 249 places, 2247 transitions, 62769 flow. Second operand 43 states and 318 transitions. [2022-12-06 07:46:32,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 3364 transitions, 95508 flow [2022-12-06 07:46:39,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 3364 transitions, 93398 flow, removed 1055 selfloop flow, removed 0 redundant places. [2022-12-06 07:46:39,067 INFO L231 Difference]: Finished difference. Result has 323 places, 2908 transitions, 85276 flow [2022-12-06 07:46:39,069 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=60412, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=813, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=906, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=85276, PETRI_PLACES=323, PETRI_TRANSITIONS=2908} [2022-12-06 07:46:39,069 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 298 predicate places. [2022-12-06 07:46:39,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:39,069 INFO L89 Accepts]: Start accepts. Operand has 323 places, 2908 transitions, 85276 flow [2022-12-06 07:46:39,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:39,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:39,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 323 places, 2908 transitions, 85276 flow [2022-12-06 07:46:39,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 302 places, 2908 transitions, 85276 flow [2022-12-06 07:46:47,580 INFO L130 PetriNetUnfolder]: 10181/21134 cut-off events. [2022-12-06 07:46:47,581 INFO L131 PetriNetUnfolder]: For 707353/708066 co-relation queries the response was YES. [2022-12-06 07:46:47,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226495 conditions, 21134 events. 10181/21134 cut-off events. For 707353/708066 co-relation queries the response was YES. Maximal size of possible extension queue 1405. Compared 213847 event pairs, 1842 based on Foata normal form. 50/19829 useless extension candidates. Maximal degree in co-relation 226305. Up to 7305 conditions per place. [2022-12-06 07:46:48,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 302 places, 2908 transitions, 85276 flow [2022-12-06 07:46:48,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 7308 [2022-12-06 07:46:48,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:46:48,712 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:46:48,847 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:46:48,915 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:46:48,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9847 [2022-12-06 07:46:48,916 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 2906 transitions, 85473 flow [2022-12-06 07:46:48,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 24 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:48,916 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:48,916 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:48,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 07:46:49,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:46:49,124 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:46:49,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:49,124 INFO L85 PathProgramCache]: Analyzing trace with hash -651355035, now seen corresponding path program 1 times [2022-12-06 07:46:49,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:49,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608369589] [2022-12-06 07:46:49,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:49,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:50,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:50,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608369589] [2022-12-06 07:46:50,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608369589] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:46:50,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256024793] [2022-12-06 07:46:50,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:50,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:46:50,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:46:50,224 INFO L229 MonitoredProcess]: Starting monitored process 21 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:50,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 07:46:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:50,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-06 07:46:50,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:46:50,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-12-06 07:46:50,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 838 treesize of output 822 [2022-12-06 07:46:50,401 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 07:46:50,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-06 07:46:50,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:46:50,537 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 07:46:50,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 53 [2022-12-06 07:46:50,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 18 [2022-12-06 07:46:51,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:46:51,055 INFO L321 Elim1Store]: treesize reduction 73, result has 42.1 percent of original size [2022-12-06 07:46:51,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 68 [2022-12-06 07:46:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:51,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:46:56,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:56,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256024793] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:46:56,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:46:56,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-06 07:46:56,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496505463] [2022-12-06 07:46:56,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:46:56,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 07:46:56,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:56,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 07:46:56,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2022-12-06 07:46:56,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 07:46:56,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 2906 transitions, 85473 flow. Second operand has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 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:56,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:56,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 07:46:56,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:03,721 WARN L233 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 109 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:47:16,717 WARN L233 SmtUtils]: Spent 12.46s on a formula simplification. DAG size of input: 123 DAG size of output: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:47:29,223 WARN L233 SmtUtils]: Spent 12.31s on a formula simplification. DAG size of input: 124 DAG size of output: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:47:44,719 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 87 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:47:53,943 WARN L233 SmtUtils]: Spent 7.11s on a formula simplification. DAG size of input: 114 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:48:05,865 WARN L233 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 110 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:48:17,215 WARN L233 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 100 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:48:25,522 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 81 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:48:39,051 WARN L233 SmtUtils]: Spent 10.19s on a formula simplification. DAG size of input: 113 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:48:51,593 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 86 DAG size of output: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:48:58,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:49:18,488 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 113 DAG size of output: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:49:30,154 WARN L233 SmtUtils]: Spent 8.65s on a formula simplification. DAG size of input: 111 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:49:47,782 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:49:55,497 WARN L233 SmtUtils]: Spent 5.49s on a formula simplification. DAG size of input: 99 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:50:12,020 INFO L130 PetriNetUnfolder]: 18378/32707 cut-off events. [2022-12-06 07:50:12,020 INFO L131 PetriNetUnfolder]: For 1224360/1224360 co-relation queries the response was YES. [2022-12-06 07:50:12,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381894 conditions, 32707 events. 18378/32707 cut-off events. For 1224360/1224360 co-relation queries the response was YES. Maximal size of possible extension queue 1645. Compared 288269 event pairs, 979 based on Foata normal form. 176/32883 useless extension candidates. Maximal degree in co-relation 381579. Up to 12220 conditions per place. [2022-12-06 07:50:12,704 INFO L137 encePairwiseOnDemand]: 6/72 looper letters, 888 selfloop transitions, 2774 changer transitions 401/4063 dead transitions. [2022-12-06 07:50:12,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 4063 transitions, 118987 flow [2022-12-06 07:50:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-12-06 07:50:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2022-12-06 07:50:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 522 transitions. [2022-12-06 07:50:12,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10069444444444445 [2022-12-06 07:50:12,706 INFO L175 Difference]: Start difference. First operand has 300 places, 2906 transitions, 85473 flow. Second operand 72 states and 522 transitions. [2022-12-06 07:50:12,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 4063 transitions, 118987 flow [2022-12-06 07:50:23,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 4063 transitions, 117661 flow, removed 663 selfloop flow, removed 15 redundant places. [2022-12-06 07:50:23,581 INFO L231 Difference]: Finished difference. Result has 405 places, 3333 transitions, 105293 flow [2022-12-06 07:50:23,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=80571, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=105293, PETRI_PLACES=405, PETRI_TRANSITIONS=3333} [2022-12-06 07:50:23,583 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 380 predicate places. [2022-12-06 07:50:23,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:23,583 INFO L89 Accepts]: Start accepts. Operand has 405 places, 3333 transitions, 105293 flow [2022-12-06 07:50:23,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:23,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:23,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 405 places, 3333 transitions, 105293 flow [2022-12-06 07:50:23,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 389 places, 3333 transitions, 105293 flow [2022-12-06 07:50:34,591 INFO L130 PetriNetUnfolder]: 10117/21480 cut-off events. [2022-12-06 07:50:34,591 INFO L131 PetriNetUnfolder]: For 968075/968588 co-relation queries the response was YES. [2022-12-06 07:50:35,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263728 conditions, 21480 events. 10117/21480 cut-off events. For 968075/968588 co-relation queries the response was YES. Maximal size of possible extension queue 1487. Compared 222197 event pairs, 1924 based on Foata normal form. 41/20057 useless extension candidates. Maximal degree in co-relation 263048. Up to 7488 conditions per place. [2022-12-06 07:50:35,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 389 places, 3333 transitions, 105293 flow [2022-12-06 07:50:35,650 INFO L188 LiptonReduction]: Number of co-enabled transitions 8070 [2022-12-06 07:50:36,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L59-->L50: Formula: (and (<= v_~last~0_22 (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37))) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:50:36,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:36,392 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:36,470 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:36,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:36,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:36,715 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:36,817 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:37,021 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:37,101 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:37,174 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:37,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [798] $Ultimate##0-->L79: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_239| (ite (= (ite (or (< v_~start~0_328 v_~end~0_360) (< v_~i~0_487 v_~N~0_283)) 1 0) 0) 0 1)) (= (ite (= (ite (and (<= v_~v_old~0_265 v_~new~0_164) (not (= (mod v_~ok~0_259 256) 0))) 1 0) 0) 0 1) v_~ok~0_258) (= (ite (and (< v_~start~0_329 v_~n~0_216) (<= 0 v_~start~0_329) (< v_~start~0_329 v_~end~0_360)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94| 0)) (= (+ v_~start~0_329 1) v_~start~0_328) (= v_~new~0_164 v_~v_old~0_264) (= (select (select |v_#memory_int_599| v_~queue~0.base_234) (+ (* v_~start~0_329 4) v_~queue~0.offset_234)) v_~new~0_164)) InVars {~start~0=v_~start~0_329, ~queue~0.offset=v_~queue~0.offset_234, ~ok~0=v_~ok~0_259, ~i~0=v_~i~0_487, #memory_int=|v_#memory_int_599|, ~end~0=v_~end~0_360, ~N~0=v_~N~0_283, ~v_old~0=v_~v_old~0_265, ~queue~0.base=v_~queue~0.base_234, ~n~0=v_~n~0_216} OutVars{~start~0=v_~start~0_328, ~new~0=v_~new~0_164, ~queue~0.offset=v_~queue~0.offset_234, ~ok~0=v_~ok~0_258, ~i~0=v_~i~0_487, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, ~N~0=v_~N~0_283, ~queue~0.base=v_~queue~0.base_234, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_94|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_239|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_94|, #memory_int=|v_#memory_int_599|, ~end~0=v_~end~0_360, ~v_old~0=v_~v_old~0_264, ~n~0=v_~n~0_216} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:37,311 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:37,386 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:37,461 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:37,543 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:37,626 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:37,870 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:50:37,959 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [803] L50-->L55-1: Formula: (let ((.cse0 (select (select |v_#memory_int_620| v_~A~0.base_335) (+ (* v_~i~0_499 4) v_~A~0.offset_337)))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_88|) (= v_~last~0_290 |v_thread1Thread1of1ForFork0_#t~mem5#1_274|) (= (ite (= .cse0 (select (select |v_#memory_int_620| v_~queue~0.base_244) (+ (* v_~end~0_376 4) v_~queue~0.offset_244))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_88|) (not (= (ite (and (<= 0 v_~end~0_376) (< v_~end~0_376 v_~n~0_224)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_274| .cse0) (= v_~end~0_375 (+ v_~end~0_376 1)))) InVars {~A~0.base=v_~A~0.base_335, ~queue~0.offset=v_~queue~0.offset_244, ~A~0.offset=v_~A~0.offset_337, ~i~0=v_~i~0_499, #memory_int=|v_#memory_int_620|, ~end~0=v_~end~0_376, ~queue~0.base=v_~queue~0.base_244, ~n~0=v_~n~0_224} OutVars{~A~0.base=v_~A~0.base_335, ~queue~0.offset=v_~queue~0.offset_244, ~i~0=v_~i~0_499, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_88|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_88|, ~queue~0.base=v_~queue~0.base_244, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_274|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_88|, ~A~0.offset=v_~A~0.offset_337, #memory_int=|v_#memory_int_620|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88|, ~end~0=v_~end~0_375, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_88|, ~n~0=v_~n~0_224, ~last~0=v_~last~0_290} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:50:38,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:50:38,265 INFO L203 LiptonReduction]: Total number of compositions: 11 [2022-12-06 07:50:38,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14683 [2022-12-06 07:50:38,266 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 3326 transitions, 105594 flow [2022-12-06 07:50:38,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 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:50:38,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:38,266 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:38,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 07:50:38,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 07:50:38,470 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:38,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:38,471 INFO L85 PathProgramCache]: Analyzing trace with hash 724573157, now seen corresponding path program 1 times [2022-12-06 07:50:38,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:38,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107151454] [2022-12-06 07:50:38,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:38,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:39,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:39,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107151454] [2022-12-06 07:50:39,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107151454] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:39,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121740101] [2022-12-06 07:50:39,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:39,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:39,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:39,732 INFO L229 MonitoredProcess]: Starting monitored process 22 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:50:39,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 07:50:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:39,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 105 conjunts are in the unsatisfiable core [2022-12-06 07:50:39,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:39,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:39,980 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-06 07:50:39,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 96 [2022-12-06 07:50:39,985 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:39,986 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2022-12-06 07:50:39,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:39,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:39,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:39,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:39,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 64 [2022-12-06 07:50:39,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-12-06 07:50:40,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 07:50:40,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:40,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-12-06 07:50:40,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:40,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 26 [2022-12-06 07:50:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:40,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:40,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121740101] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:40,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:40,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2022-12-06 07:50:40,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545142881] [2022-12-06 07:50:40,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:40,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 07:50:40,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:40,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 07:50:40,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-12-06 07:50:40,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 92 [2022-12-06 07:50:40,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 3326 transitions, 105594 flow. Second operand has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 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:50:40,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:40,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 92 [2022-12-06 07:50:40,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:41,006 WARN L837 $PredicateComparison]: unable to prove that (and (= c_~ok~0 1) (let ((.cse1 (+ c_~A~0.offset (* c_~i~0 4))) (.cse0 (* c_~end~0 4))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ .cse0 c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) .cse1))) (< c_~end~0 0) (<= c_~n~0 (+ c_~end~0 1)) (let ((.cse7 (* c_~start~0 4))) (let ((.cse6 (+ .cse7 c_~queue~0.offset)) (.cse5 (+ .cse0 c_~queue~0.offset 4))) (and (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706))) (let ((.cse3 (select .cse8 c_~A~0.base))) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* v_~i~0_605 4)))) (.cse4 (select .cse8 c_~queue~0.base))) (or (< .cse2 (select .cse3 .cse1)) (not (= .cse2 (select .cse4 .cse5))) (< (select .cse4 .cse6) (+ (select .cse4 (+ .cse7 c_~queue~0.offset 4)) 1))))))) (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706))) (let ((.cse10 (select .cse12 c_~A~0.base))) (let ((.cse9 (select .cse10 (+ c_~A~0.offset (* v_~i~0_605 4)))) (.cse11 (select .cse12 c_~queue~0.base))) (or (< .cse9 (select .cse10 .cse1)) (not (= .cse9 (select .cse11 .cse5))) (<= c_~v_old~0 (select .cse11 .cse6))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706))) (let ((.cse14 (select .cse15 c_~A~0.base))) (let ((.cse13 (select .cse14 (+ c_~A~0.offset (* v_~i~0_605 4))))) (or (< .cse13 (select .cse14 .cse1)) (not (= .cse13 (select (select .cse15 c_~queue~0.base) .cse5))))))))))))))) is different from false [2022-12-06 07:51:23,241 INFO L130 PetriNetUnfolder]: 18511/32677 cut-off events. [2022-12-06 07:51:23,241 INFO L131 PetriNetUnfolder]: For 1635229/1635229 co-relation queries the response was YES. [2022-12-06 07:51:23,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428573 conditions, 32677 events. 18511/32677 cut-off events. For 1635229/1635229 co-relation queries the response was YES. Maximal size of possible extension queue 1500. Compared 284023 event pairs, 4346 based on Foata normal form. 13/32690 useless extension candidates. Maximal degree in co-relation 426596. Up to 15713 conditions per place. [2022-12-06 07:51:24,017 INFO L137 encePairwiseOnDemand]: 41/92 looper letters, 2223 selfloop transitions, 1751 changer transitions 68/4042 dead transitions. [2022-12-06 07:51:24,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 4042 transitions, 132049 flow [2022-12-06 07:51:24,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 07:51:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 07:51:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 266 transitions. [2022-12-06 07:51:24,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12047101449275362 [2022-12-06 07:51:24,018 INFO L175 Difference]: Start difference. First operand has 382 places, 3326 transitions, 105594 flow. Second operand 24 states and 266 transitions. [2022-12-06 07:51:24,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 4042 transitions, 132049 flow [2022-12-06 07:51:43,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 4042 transitions, 129431 flow, removed 1144 selfloop flow, removed 29 redundant places. [2022-12-06 07:51:44,087 INFO L231 Difference]: Finished difference. Result has 380 places, 3573 transitions, 116815 flow [2022-12-06 07:51:44,090 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=103446, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1510, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1750, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=116815, PETRI_PLACES=380, PETRI_TRANSITIONS=3573} [2022-12-06 07:51:44,090 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 355 predicate places. [2022-12-06 07:51:44,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:44,090 INFO L89 Accepts]: Start accepts. Operand has 380 places, 3573 transitions, 116815 flow [2022-12-06 07:51:44,125 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:44,125 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:44,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 380 places, 3573 transitions, 116815 flow [2022-12-06 07:51:44,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 379 places, 3573 transitions, 116815 flow [2022-12-06 07:51:49,373 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([677] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< v_~i~0_In_7 v_~N~0_In_12)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~i~0=v_~i~0_In_7, ~N~0=v_~N~0_In_12} OutVars{~N~0=v_~N~0_In_12, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~i~0=v_~i~0_In_7, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base][302], [Black: 1790#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1)), Black: 1782#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~A~0.offset 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 1)))), Black: 1770#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 2739#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_~i~0_514 Int) (v_ArrVal_1485 (Array Int Int))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_514 Int) (~i~0 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))) (= ~ok~0 1)), Black: 1713#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 2698#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))), Black: 1778#(and (= ~A~0.offset 0) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 1)))), Black: 2759#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)))), Black: 1786#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (or (not (= ~start~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 1)))), Black: 2711#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 1677#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2628#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (exists ((v_~i~0_511 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4))) ~last~0) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))))) (= ~queue~0.offset 0) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (<= 1 ~end~0)), Black: 1768#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 1764#(and (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~n~0 4) (<= ~start~0 3)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 2679#(not (= (mod ~ok~0 256) 0)), Black: 1774#(and (= ~A~0.offset 0) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (or (not (= ~start~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1)), Black: 2755#(and (or (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (or (and (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))) (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4)))))) (or (<= 0 ~queue~0.offset) (not (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0))) (= ~ok~0 1)), Black: 2743#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0))) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 1661#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2745#(and (or (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (+ ~last~0 (select (select |#memory_int| ~queue~0.base) 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (and (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4)) (< 0 (+ ~start~0 1))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (<= 0 ~queue~0.offset) (not (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0))) (or (< ~end~0 0) (forall ((~i~0 Int)) (or (forall ((v_ArrVal_1485 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0))) (<= ~n~0 ~end~0)) (= ~ok~0 1) (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))), Black: 1788#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1)), Black: 2730#(or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_~i~0_514 Int) (v_ArrVal_1485 (Array Int Int))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))), Black: 2949#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), 2660#(= ~ok~0 1), Black: 2769#(and (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (and (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4)) (< 0 (+ ~start~0 1))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (<= 0 ~queue~0.offset) (not (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0))) (= ~ok~0 1) (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))), Black: 3021#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2751#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_~i~0_514 Int) (v_ArrVal_1485 (Array Int Int))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_514 Int) (~i~0 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))) (= ~ok~0 1) (not (= (mod ~ok~0 256) 0))), Black: 3033#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4))) (= ~ok~0 1)), Black: 3019#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1479#(and (<= ~i~0 1) (<= 2 ~N~0)), Black: 2975#(and (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 3075#(and (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0) (= ~ok~0 1))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~queue~0.offset 0) (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (~i~0 Int) (v_~end~0_442 Int) (~A~0.base Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 3083#(and (or (and (or (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= 0 ~end~0))) (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (~i~0 Int) (v_~end~0_442 Int) (~A~0.base Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0)))), Black: 3005#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3041#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2964#(or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (~i~0 Int) (v_~end~0_442 Int) (~A~0.base Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))), Black: 2837#(and (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0) (= ~ok~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~queue~0.offset 0)), Black: 2945#(or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 3025#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2977#(and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2981#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3013#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 3049#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (and (or (and (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3069#(and (= ~queue~0.offset 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))), Black: 3031#(and (= ~queue~0.offset 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4))) (= ~ok~0 1)), Black: 3035#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3003#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~ok~0 1)), Black: 2487#(<= ~end~0 (+ ~start~0 1)), 97#thread1EXITtrue, Black: 3065#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0) (= ~ok~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (or (and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (<= ~v_old~0 ~last~0) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= ~queue~0.offset 0)), Black: 3061#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 3029#(and (= ~queue~0.offset 0) (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ (* ~start~0 4) 4) (+ ~queue~0.offset (* ~end~0 4))) (<= (* ~n~0 4) (+ (* ~end~0 4) 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~last~0)) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= ~ok~0 1)), Black: 3011#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (= ~ok~0 1)), Black: 2891#(= ~ok~0 1), Black: 3043#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2993#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3027#(and (= ~queue~0.offset 0) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~ok~0 1)), Black: 3045#(and (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0) (= ~ok~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~queue~0.offset 0) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 2839#(and (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ (* ~start~0 4) 4) (+ ~queue~0.offset (* ~end~0 4))) (<= (* ~n~0 4) (+ (* ~end~0 4) 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~last~0) (= ~ok~0 1)) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= ~queue~0.offset 0)), Black: 3059#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2960#(or (and (or (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= 0 ~end~0))), Black: 2999#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 3001#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (and (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= (* ~n~0 4) 8) (= (* ~start~0 4) (* ~end~0 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0)) (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3057#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), 308#(= ~ok~0 1), 690#true, 633#true, Black: 982#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), Black: 1092#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741824) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (and (= ~i~0 0) (or (<= ~start~0 2) (<= ~n~0 3)) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), Black: 1108#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~ok~0 1)), Black: 1106#(and (<= ~start~0 2) (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1) (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 2)) (or (not (<= ~start~0 0)) (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0))))) (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4)) 7))))), Black: 1104#(and (<= ~start~0 2) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1) (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 2)) (or (not (<= ~start~0 0)) (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0))))) (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4)) 7))))), Black: 1026#(= ~ok~0 1), Black: 1102#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), 122#$Ultimate##0true, Black: 578#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~last~0 ~v_old~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (<= 1 ~end~0)), 2488#(<= ~end~0 (+ ~start~0 2)), Black: 587#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (<= 1 ~end~0)), 1435#true, 2983#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 1179#(= ~ok~0 1), Black: 1327#(= ~ok~0 1), Black: 1416#(and (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1271#(and (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1273#(and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 2160#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~last~0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~end~0 (+ ~start~0 1)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0))), Black: 2404#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (= ~ok~0 1)), Black: 1400#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |#StackHeapBarrier|) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~ok~0 1)), Black: 2424#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4)) 4) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4))) (<= ~n~0 ~end~0)) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (and (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (= ~ok~0 1)), Black: 1396#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |#StackHeapBarrier|) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~ok~0 1)), Black: 2175#(and (or (= (+ (* ~start~0 4) 4) (* ~end~0 4)) (<= ~n~0 ~end~0)) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (<= ~v_old~0 ~last~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~A~0.base) (* ~i~0 4))) (not (= ~A~0.base ~queue~0.base)) (<= (select (select |#memory_int| ~A~0.base) 0) (select (select |#memory_int| ~A~0.base) (* ~i~0 4))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~i~0 ~N~0) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0))), Black: 1398#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |#StackHeapBarrier|) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (<= (+ ~start~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (= ~start~0 1) (= ~start~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), 1877#(and (<= 0 ~i~0) (<= ~N~0 ~i~0)), Black: 2286#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), 1687#(= ~ok~0 1), Black: 2434#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4)) 4) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4))) (<= ~n~0 ~end~0)) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (and (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~ok~0 1)), 48#L103-1true, Black: 2334#(= ~ok~0 1), Black: 2444#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1)), 1274#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 2179#(and (or (= (+ (* ~start~0 4) 4) (* ~end~0 4)) (<= ~n~0 ~end~0)) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~A~0.base) (* ~i~0 4))) (not (= ~A~0.base ~queue~0.base)) (<= (select (select |#memory_int| ~A~0.base) 0) (select (select |#memory_int| ~A~0.base) (* ~i~0 4))))) (< ~i~0 ~N~0) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~ok~0 1)), Black: 2414#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (not (= (mod ~ok~0 256) 0))), 3195#(= ~ok~0 1), Black: 2436#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2211#true, Black: 2422#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))))), Black: 2400#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))))), Black: 2448#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1))) (not (<= 0 ~end~0))) (not (= (mod ~ok~0 256) 0))), Black: 2420#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 171#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 2402#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= ~last~0 ~v_old~0) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2354#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))), Black: 2418#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2373#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 2428#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (= ~ok~0 1)), Black: 636#(<= ~end~0 (+ ~start~0 1)), Black: 2442#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= (mod ~ok~0 256) 0))), Black: 635#(<= ~end~0 ~start~0), 179#true, Black: 181#(or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))), Black: 945#(and (<= ~start~0 2) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (= ~ok~0 1) (exists ((~A~0.offset Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))), Black: 844#(and (< ~i~0 ~N~0) (= ~ok~0 1) (exists ((~A~0.offset Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))), Black: 955#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (< ~i~0 ~N~0) (= ~ok~0 1) (exists ((~A~0.offset Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))), Black: 824#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), 1881#true, Black: 1925#(= |thread2Thread1of1ForFork1_~cond~0#1| 1), Black: 1918#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 1883#(not (<= ~N~0 ~i~0)), Black: 3260#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (or (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))))) (not (= (mod ~ok~0 256) 0))))) (= ~ok~0 1)), Black: 3292#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (= ~ok~0 1)), 2377#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 3274#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1)), 993#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~ok~0 1)), Black: 2779#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2749#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (exists ((v_~i~0_511 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4))) ~last~0) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))))) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((v_~i~0_511 Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1) (<= 1 ~end~0)), 867#(= ~ok~0 1), Black: 200#(<= ~end~0 ~start~0), Black: 2753#(and (or (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (+ ~last~0 (select (select |#memory_int| ~queue~0.base) 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (and (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4)) (< 0 (+ ~start~0 1))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (<= 0 ~queue~0.offset) (not (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0))) (= ~ok~0 1) (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))), 2070#(= ~ok~0 1), Black: 2617#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2741#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (= ~ok~0 1)), Black: 1784#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (or (not (= ~start~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1))]) [2022-12-06 07:51:49,373 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 07:51:49,373 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:51:49,373 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:51:49,373 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:51:49,374 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L59-->L50: Formula: (and (<= v_~last~0_22 (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37))) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][255], [Black: 1790#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1)), Black: 1782#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~A~0.offset 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 1)))), Black: 1770#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 2739#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_~i~0_514 Int) (v_ArrVal_1485 (Array Int Int))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_514 Int) (~i~0 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))) (= ~ok~0 1)), Black: 1713#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 2698#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))), Black: 1778#(and (= ~A~0.offset 0) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 1)))), Black: 2759#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)))), Black: 1786#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (or (not (= ~start~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 1)))), Black: 2711#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 1677#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2628#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (exists ((v_~i~0_511 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4))) ~last~0) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))))) (= ~queue~0.offset 0) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (<= 1 ~end~0)), Black: 1768#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 1764#(and (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~n~0 4) (<= ~start~0 3)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 2679#(not (= (mod ~ok~0 256) 0)), Black: 1774#(and (= ~A~0.offset 0) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (or (not (= ~start~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1)), Black: 2755#(and (or (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (or (and (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))) (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4)))))) (or (<= 0 ~queue~0.offset) (not (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0))) (= ~ok~0 1)), Black: 2743#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0))) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 1661#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2745#(and (or (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (+ ~last~0 (select (select |#memory_int| ~queue~0.base) 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (and (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4)) (< 0 (+ ~start~0 1))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (<= 0 ~queue~0.offset) (not (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0))) (or (< ~end~0 0) (forall ((~i~0 Int)) (or (forall ((v_ArrVal_1485 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0))) (<= ~n~0 ~end~0)) (= ~ok~0 1) (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))), Black: 1788#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1)), Black: 2730#(or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_~i~0_514 Int) (v_ArrVal_1485 (Array Int Int))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))), Black: 2949#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), 2660#(= ~ok~0 1), Black: 2769#(and (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (and (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4)) (< 0 (+ ~start~0 1))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (<= 0 ~queue~0.offset) (not (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0))) (= ~ok~0 1) (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))), Black: 3021#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2751#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_~i~0_514 Int) (v_ArrVal_1485 (Array Int Int))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_514 Int) (~i~0 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))) (= ~ok~0 1) (not (= (mod ~ok~0 256) 0))), Black: 3033#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4))) (= ~ok~0 1)), Black: 3019#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1435#true, Black: 1479#(and (<= ~i~0 1) (<= 2 ~N~0)), Black: 2975#(and (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 181#(or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))), Black: 3075#(and (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0) (= ~ok~0 1))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~queue~0.offset 0) (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (~i~0 Int) (v_~end~0_442 Int) (~A~0.base Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 3083#(and (or (and (or (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= 0 ~end~0))) (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (~i~0 Int) (v_~end~0_442 Int) (~A~0.base Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0)))), Black: 3005#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3041#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2964#(or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (~i~0 Int) (v_~end~0_442 Int) (~A~0.base Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))), Black: 2837#(and (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0) (= ~ok~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~queue~0.offset 0)), Black: 2945#(or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 3025#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2977#(and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2981#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3013#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 690#true, Black: 3049#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (and (or (and (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3069#(and (= ~queue~0.offset 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))), Black: 3031#(and (= ~queue~0.offset 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4))) (= ~ok~0 1)), Black: 3035#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3003#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~ok~0 1)), Black: 2487#(<= ~end~0 (+ ~start~0 1)), Black: 3065#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0) (= ~ok~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (or (and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (<= ~v_old~0 ~last~0) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= ~queue~0.offset 0)), Black: 3061#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 3029#(and (= ~queue~0.offset 0) (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ (* ~start~0 4) 4) (+ ~queue~0.offset (* ~end~0 4))) (<= (* ~n~0 4) (+ (* ~end~0 4) 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~last~0)) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= ~ok~0 1)), Black: 3011#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (= ~ok~0 1)), Black: 3043#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2993#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3027#(and (= ~queue~0.offset 0) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~ok~0 1)), Black: 3045#(and (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0) (= ~ok~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~queue~0.offset 0) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 2839#(and (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ (* ~start~0 4) 4) (+ ~queue~0.offset (* ~end~0 4))) (<= (* ~n~0 4) (+ (* ~end~0 4) 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~last~0) (= ~ok~0 1)) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= ~queue~0.offset 0)), Black: 3059#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2960#(or (and (or (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= 0 ~end~0))), Black: 2999#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2983#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 3001#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (and (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= (* ~n~0 4) 8) (= (* ~start~0 4) (* ~end~0 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0)) (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3057#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), 308#(= ~ok~0 1), 633#true, Black: 982#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), Black: 1092#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741824) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (and (= ~i~0 0) (or (<= ~start~0 2) (<= ~n~0 3)) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), Black: 1108#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~ok~0 1)), Black: 1106#(and (<= ~start~0 2) (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1) (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 2)) (or (not (<= ~start~0 0)) (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0))))) (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4)) 7))))), 2891#(= ~ok~0 1), Black: 1104#(and (<= ~start~0 2) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1) (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 2)) (or (not (<= ~start~0 0)) (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0))))) (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4)) 7))))), Black: 1026#(= ~ok~0 1), Black: 1102#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), 122#$Ultimate##0true, 70#L50true, Black: 578#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~last~0 ~v_old~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (<= 1 ~end~0)), 2488#(<= ~end~0 (+ ~start~0 2)), Black: 587#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (<= 1 ~end~0)), 694#(<= (+ ~i~0 1) ~N~0), 1179#(= ~ok~0 1), 1883#(not (<= ~N~0 ~i~0)), Black: 1327#(= ~ok~0 1), Black: 1416#(and (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1271#(and (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1273#(and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 2160#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~last~0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~end~0 (+ ~start~0 1)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0))), Black: 2404#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (= ~ok~0 1)), Black: 1400#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |#StackHeapBarrier|) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~ok~0 1)), Black: 2424#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4)) 4) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4))) (<= ~n~0 ~end~0)) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (and (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (= ~ok~0 1)), Black: 1396#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |#StackHeapBarrier|) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~ok~0 1)), Black: 2175#(and (or (= (+ (* ~start~0 4) 4) (* ~end~0 4)) (<= ~n~0 ~end~0)) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (<= ~v_old~0 ~last~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~A~0.base) (* ~i~0 4))) (not (= ~A~0.base ~queue~0.base)) (<= (select (select |#memory_int| ~A~0.base) 0) (select (select |#memory_int| ~A~0.base) (* ~i~0 4))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~i~0 ~N~0) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0))), Black: 1398#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |#StackHeapBarrier|) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (<= (+ ~start~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (= ~start~0 1) (= ~start~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 2286#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), 1687#(= ~ok~0 1), Black: 2434#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4)) 4) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4))) (<= ~n~0 ~end~0)) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (and (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~ok~0 1)), 48#L103-1true, Black: 2334#(= ~ok~0 1), Black: 2444#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1)), 1274#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 2179#(and (or (= (+ (* ~start~0 4) 4) (* ~end~0 4)) (<= ~n~0 ~end~0)) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~A~0.base) (* ~i~0 4))) (not (= ~A~0.base ~queue~0.base)) (<= (select (select |#memory_int| ~A~0.base) 0) (select (select |#memory_int| ~A~0.base) (* ~i~0 4))))) (< ~i~0 ~N~0) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~ok~0 1)), Black: 2377#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 2414#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (not (= (mod ~ok~0 256) 0))), 3195#(= ~ok~0 1), Black: 2436#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2422#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))))), Black: 2213#(or (and (<= 1 |thread2Thread1of1ForFork1_~cond~0#1|) (<= (div |thread2Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= ~N~0 ~i~0)), Black: 2400#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))))), Black: 2448#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1))) (not (<= 0 ~end~0))) (not (= (mod ~ok~0 256) 0))), Black: 2420#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 171#(and (= ~i~0 0) (<= 1 ~N~0)), 1440#(<= (+ ~i~0 1) ~N~0), Black: 2402#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= ~last~0 ~v_old~0) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2354#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))), Black: 2418#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2373#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 2428#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (= ~ok~0 1)), Black: 636#(<= ~end~0 (+ ~start~0 1)), Black: 2442#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= (mod ~ok~0 256) 0))), Black: 635#(<= ~end~0 ~start~0), Black: 945#(and (<= ~start~0 2) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (= ~ok~0 1) (exists ((~A~0.offset Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))), Black: 844#(and (< ~i~0 ~N~0) (= ~ok~0 1) (exists ((~A~0.offset Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))), Black: 955#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (< ~i~0 ~N~0) (= ~ok~0 1) (exists ((~A~0.offset Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))), Black: 824#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), Black: 1925#(= |thread2Thread1of1ForFork1_~cond~0#1| 1), Black: 1918#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 1881#true, 2275#true, Black: 3260#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (or (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))))) (not (= (mod ~ok~0 256) 0))))) (= ~ok~0 1)), Black: 3292#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (= ~ok~0 1)), Black: 3274#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1)), 993#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~ok~0 1)), Black: 2779#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2749#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (exists ((v_~i~0_511 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4))) ~last~0) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))))) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((v_~i~0_511 Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1) (<= 1 ~end~0)), 867#(= ~ok~0 1), Black: 200#(<= ~end~0 ~start~0), Black: 2753#(and (or (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (+ ~last~0 (select (select |#memory_int| ~queue~0.base) 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (and (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4)) (< 0 (+ ~start~0 1))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (<= 0 ~queue~0.offset) (not (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0))) (= ~ok~0 1) (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))), 2070#(= ~ok~0 1), Black: 2617#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2741#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (= ~ok~0 1)), Black: 1784#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (or (not (= ~start~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1))]) [2022-12-06 07:51:49,374 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 07:51:49,374 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:51:49,374 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:51:49,374 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:51:49,374 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([577] L59-->L49-4: Formula: (and (= (select (select |v_#memory_int_75| v_~A~0.base_35) (+ (* v_~i~0_47 4) v_~A~0.offset_35)) |v_thread1Thread1of1ForFork0_#t~mem1#1_25|) (not (<= v_~last~0_20 |v_thread1Thread1of1ForFork0_#t~mem1#1_25|)) (< v_~i~0_47 v_~N~0_29)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_20} OutVars{~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][303], [Black: 1790#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1)), Black: 1782#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~A~0.offset 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 1)))), Black: 1770#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 2739#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_~i~0_514 Int) (v_ArrVal_1485 (Array Int Int))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_514 Int) (~i~0 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))) (= ~ok~0 1)), Black: 1713#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 2698#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))), Black: 1778#(and (= ~A~0.offset 0) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 1)))), Black: 2759#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)))), Black: 1786#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (or (not (= ~start~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 1)))), Black: 2711#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 1677#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2628#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (exists ((v_~i~0_511 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4))) ~last~0) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))))) (= ~queue~0.offset 0) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (<= 1 ~end~0)), Black: 1768#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 1764#(and (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~n~0 4) (<= ~start~0 3)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 2679#(not (= (mod ~ok~0 256) 0)), Black: 1774#(and (= ~A~0.offset 0) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (or (not (= ~start~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1)), Black: 2755#(and (or (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (or (and (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))) (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4)))))) (or (<= 0 ~queue~0.offset) (not (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0))) (= ~ok~0 1)), Black: 2743#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0))) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 1661#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2745#(and (or (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (+ ~last~0 (select (select |#memory_int| ~queue~0.base) 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (and (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4)) (< 0 (+ ~start~0 1))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (<= 0 ~queue~0.offset) (not (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0))) (or (< ~end~0 0) (forall ((~i~0 Int)) (or (forall ((v_ArrVal_1485 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0))) (<= ~n~0 ~end~0)) (= ~ok~0 1) (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))), Black: 1788#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1)), Black: 2730#(or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_~i~0_514 Int) (v_ArrVal_1485 (Array Int Int))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))), Black: 2949#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), 2660#(= ~ok~0 1), Black: 2769#(and (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (and (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4)) (< 0 (+ ~start~0 1))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (<= 0 ~queue~0.offset) (not (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0))) (= ~ok~0 1) (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))), Black: 3021#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2751#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_~i~0_514 Int) (v_ArrVal_1485 (Array Int Int))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_514 Int) (~i~0 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_514 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))))) (= ~ok~0 1) (not (= (mod ~ok~0 256) 0))), Black: 3033#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4))) (= ~ok~0 1)), Black: 3019#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1435#true, Black: 1479#(and (<= ~i~0 1) (<= 2 ~N~0)), Black: 2975#(and (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 181#(or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))), Black: 3075#(and (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0) (= ~ok~0 1))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~queue~0.offset 0) (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (~i~0 Int) (v_~end~0_442 Int) (~A~0.base Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 3083#(and (or (and (or (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= 0 ~end~0))) (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (~i~0 Int) (v_~end~0_442 Int) (~A~0.base Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0)))), Black: 3005#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3041#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2964#(or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (~i~0 Int) (v_~end~0_442 Int) (~A~0.base Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))), Black: 2837#(and (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0) (= ~ok~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~queue~0.offset 0)), Black: 2945#(or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 3025#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2977#(and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2981#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3013#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 690#true, Black: 3049#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (and (or (and (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3069#(and (= ~queue~0.offset 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))), Black: 3031#(and (= ~queue~0.offset 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4))) (= ~ok~0 1)), Black: 3035#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3003#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~ok~0 1)), Black: 2487#(<= ~end~0 (+ ~start~0 1)), Black: 3065#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0) (= ~ok~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (or (and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (<= ~v_old~0 ~last~0) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= ~queue~0.offset 0)), Black: 3061#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 3029#(and (= ~queue~0.offset 0) (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ (* ~start~0 4) 4) (+ ~queue~0.offset (* ~end~0 4))) (<= (* ~n~0 4) (+ (* ~end~0 4) 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~last~0)) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= ~ok~0 1)), Black: 3011#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (= ~ok~0 1)), Black: 2891#(= ~ok~0 1), Black: 3043#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2993#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3027#(and (= ~queue~0.offset 0) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~ok~0 1)), Black: 3045#(and (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0) (= ~ok~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (= ~queue~0.offset 0) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 2839#(and (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ (* ~start~0 4) 4) (+ ~queue~0.offset (* ~end~0 4))) (<= (* ~n~0 4) (+ (* ~end~0 4) 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~last~0) (= ~ok~0 1)) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= ~queue~0.offset 0)), Black: 3059#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2960#(or (and (or (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int)) (v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (not (<= (+ ~end~0 1) v_~end~0_442)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= 0 ~end~0))), Black: 2999#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (or (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) 8) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0))) (= (* ~start~0 4) (* ~end~0 4))) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 3001#(and (or (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (not (<= 0 ~end~0))) (or (and (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= (* ~n~0 4) 8) (= (* ~start~0 4) (* ~end~0 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) ~v_old~0)) (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0) (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~end~0 4))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 3057#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442)))) (forall ((v_~end~0_442 Int)) (or (not (< v_~end~0_442 ~n~0)) (forall ((v_~i~0_540 Int) (v_ArrVal_1589 (Array Int Int))) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~queue~0.base) (+ (* v_~end~0_442 4) ~queue~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1589) ~A~0.base) (+ (* v_~i~0_540 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= (+ ~end~0 1) v_~end~0_442))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), 308#(= ~ok~0 1), 633#true, Black: 982#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), Black: 1092#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741824) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (and (= ~i~0 0) (or (<= ~start~0 2) (<= ~n~0 3)) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), Black: 1108#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~ok~0 1)), Black: 1106#(and (<= ~start~0 2) (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1) (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 2)) (or (not (<= ~start~0 0)) (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0))))) (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4)) 7))))), Black: 1104#(and (<= ~start~0 2) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1) (or (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~start~0 2)) (or (not (<= ~start~0 0)) (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0))))) (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4)) 7))))), Black: 1026#(= ~ok~0 1), Black: 1102#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), 122#$Ultimate##0true, Black: 578#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~last~0 ~v_old~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (<= 1 ~end~0)), 2488#(<= ~end~0 (+ ~start~0 2)), Black: 587#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (<= 1 ~end~0)), 2983#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 694#(<= (+ ~i~0 1) ~N~0), 1179#(= ~ok~0 1), 1883#(not (<= ~N~0 ~i~0)), Black: 1327#(= ~ok~0 1), Black: 1416#(and (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1271#(and (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1273#(and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 2160#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~last~0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~end~0 (+ ~start~0 1)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0))), Black: 2404#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (= ~ok~0 1)), Black: 1400#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |#StackHeapBarrier|) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~ok~0 1)), Black: 2424#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4)) 4) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4))) (<= ~n~0 ~end~0)) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (and (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (= ~ok~0 1)), Black: 1396#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |#StackHeapBarrier|) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~ok~0 1)), Black: 2175#(and (or (= (+ (* ~start~0 4) 4) (* ~end~0 4)) (<= ~n~0 ~end~0)) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (<= ~v_old~0 ~last~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~A~0.base) (* ~i~0 4))) (not (= ~A~0.base ~queue~0.base)) (<= (select (select |#memory_int| ~A~0.base) 0) (select (select |#memory_int| ~A~0.base) (* ~i~0 4))))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~i~0 ~N~0) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~ok~0 1) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0))), Black: 2286#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1398#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |#StackHeapBarrier|) (= ~last~0 ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (<= (+ ~start~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (= ~start~0 1) (= ~start~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), 1687#(= ~ok~0 1), Black: 2434#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4)) 4) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4))) (<= ~n~0 ~end~0)) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (and (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~ok~0 1)), 48#L103-1true, Black: 2334#(= ~ok~0 1), Black: 2444#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1)), 1274#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 2179#(and (or (= (+ (* ~start~0 4) 4) (* ~end~0 4)) (<= ~n~0 ~end~0)) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4)) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~A~0.base) (* ~i~0 4))) (not (= ~A~0.base ~queue~0.base)) (<= (select (select |#memory_int| ~A~0.base) 0) (select (select |#memory_int| ~A~0.base) (* ~i~0 4))))) (< ~i~0 ~N~0) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~ok~0 1)), Black: 2414#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (not (= (mod ~ok~0 256) 0))), 3195#(= ~ok~0 1), Black: 2436#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2422#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))))), Black: 2213#(or (and (<= 1 |thread2Thread1of1ForFork1_~cond~0#1|) (<= (div |thread2Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= ~N~0 ~i~0)), Black: 2400#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_~i~0_492 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~A~0.base) (+ ~A~0.offset (* v_~i~0_492 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))))), Black: 2448#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1))) (not (<= 0 ~end~0))) (not (= (mod ~ok~0 256) 0))), Black: 2420#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 171#(and (= ~i~0 0) (<= 1 ~N~0)), 1440#(<= (+ ~i~0 1) ~N~0), Black: 2402#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= ~last~0 ~v_old~0) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)))) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2354#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))), Black: 2418#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2373#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 2428#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (= ~ok~0 1)), Black: 636#(<= ~end~0 (+ ~start~0 1)), Black: 2442#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= (mod ~ok~0 256) 0))), Black: 635#(<= ~end~0 ~start~0), Black: 945#(and (<= ~start~0 2) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (= ~ok~0 1) (exists ((~A~0.offset Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))), Black: 844#(and (< ~i~0 ~N~0) (= ~ok~0 1) (exists ((~A~0.offset Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))), Black: 955#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (< ~i~0 ~N~0) (= ~ok~0 1) (exists ((~A~0.offset Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))), Black: 824#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), Black: 1925#(= |thread2Thread1of1ForFork1_~cond~0#1| 1), Black: 1918#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 1881#true, Black: 3260#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (or (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))))) (not (= (mod ~ok~0 256) 0))))) (= ~ok~0 1)), Black: 3292#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (= ~ok~0 1)), 2377#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (not (= (mod ~ok~0 256) 0))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 3274#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)))) (forall ((v_~i~0_605 Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~A~0.base) (+ ~A~0.offset (* v_~i~0_605 4))))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1706) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1)), 5#L49-4true, 993#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~ok~0 1)), Black: 2779#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2749#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (exists ((v_~i~0_511 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4))) ~last~0) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))))) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((v_~i~0_511 Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_511 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~ok~0 1) (<= 1 ~end~0)), 867#(= ~ok~0 1), Black: 200#(<= ~end~0 ~start~0), Black: 2753#(and (or (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (+ ~last~0 (select (select |#memory_int| ~queue~0.base) 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (and (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) 4)) (< 0 (+ ~start~0 1))) (and (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (<= 0 ~queue~0.offset) (not (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0))) (= ~ok~0 1) (or (and (or (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 ~queue~0.offset) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))), 2070#(= ~ok~0 1), Black: 2617#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2741#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~i~0_513 Int) (v_ArrVal_1485 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_513 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_1485 (Array Int Int)) (v_~i~0_515 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_515 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (= ~ok~0 1)), Black: 1784#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (exists ((~A~0.offset Int) (v_~i~0_324 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_324 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (or (not (= ~start~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1))]) [2022-12-06 07:51:49,375 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 07:51:49,375 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:51:49,375 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:51:49,375 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:51:56,122 INFO L130 PetriNetUnfolder]: 10831/22769 cut-off events. [2022-12-06 07:51:56,122 INFO L131 PetriNetUnfolder]: For 1026369/1027025 co-relation queries the response was YES. [2022-12-06 07:51:56,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279476 conditions, 22769 events. 10831/22769 cut-off events. For 1026369/1027025 co-relation queries the response was YES. Maximal size of possible extension queue 1517. Compared 235387 event pairs, 2060 based on Foata normal form. 49/21258 useless extension candidates. Maximal degree in co-relation 279284. Up to 7867 conditions per place. [2022-12-06 07:51:56,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 379 places, 3573 transitions, 116815 flow [2022-12-06 07:51:56,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 8438 [2022-12-06 07:51:56,888 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [818] $Ultimate##0-->L54: Formula: (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_120| 0)) (= (ite (= (select (select |v_#memory_int_656| v_~A~0.base_363) (+ (* v_~i~0_536 4) v_~A~0.offset_365)) (select (select |v_#memory_int_656| v_~queue~0.base_272) (+ (* v_~end~0_437 4) v_~queue~0.offset_272))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_120|) (= (+ v_~end~0_437 1) v_~end~0_436) (not (= (ite (and (<= 0 v_~end~0_437) (< v_~end~0_437 v_~n~0_252)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_120| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_120|) (= (ite (= (ite (or (< v_~i~0_536 v_~N~0_317) (< v_~start~0_361 v_~end~0_437)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_273|)) InVars {~start~0=v_~start~0_361, ~A~0.base=v_~A~0.base_363, ~queue~0.offset=v_~queue~0.offset_272, ~A~0.offset=v_~A~0.offset_365, ~i~0=v_~i~0_536, #memory_int=|v_#memory_int_656|, ~end~0=v_~end~0_437, ~N~0=v_~N~0_317, ~queue~0.base=v_~queue~0.base_272, ~n~0=v_~n~0_252} OutVars{~start~0=v_~start~0_361, ~A~0.base=v_~A~0.base_363, ~queue~0.offset=v_~queue~0.offset_272, ~i~0=v_~i~0_536, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_120|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_120|, ~N~0=v_~N~0_317, ~queue~0.base=v_~queue~0.base_272, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_120|, ~A~0.offset=v_~A~0.offset_365, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_273|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_120|, #memory_int=|v_#memory_int_656|, ~end~0=v_~end~0_436, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_120|, ~n~0=v_~n~0_252} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:51:57,047 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:51:57,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12957 [2022-12-06 07:51:57,047 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 3573 transitions, 116841 flow [2022-12-06 07:51:57,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 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:57,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:57,048 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:57,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-06 07:51:57,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-06 07:51:57,248 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:57,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:57,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2096278474, now seen corresponding path program 1 times [2022-12-06 07:51:57,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:57,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175621243] [2022-12-06 07:51:57,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:57,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:58,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:58,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175621243] [2022-12-06 07:51:58,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175621243] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:58,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501282730] [2022-12-06 07:51:58,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:58,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:58,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:58,296 INFO L229 MonitoredProcess]: Starting monitored process 23 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:51:58,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 07:51:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:58,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 07:51:58,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:58,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-12-06 07:51:58,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 198 [2022-12-06 07:51:58,520 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 07:51:58,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-06 07:51:58,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:51:58,752 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 07:51:58,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 75 [2022-12-06 07:51:58,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:58,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 42 [2022-12-06 07:51:58,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:58,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 10 [2022-12-06 07:51:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:58,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:59,356 WARN L837 $PredicateComparison]: unable to prove that (or (< c_~end~0 0) (let ((.cse2 (* c_~start~0 4))) (let ((.cse1 (+ .cse2 c_~queue~0.offset))) (and (forall ((v_ArrVal_1805 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1805) c_~queue~0.base))) (< (select .cse0 .cse1) (+ (select .cse0 (+ .cse2 c_~queue~0.offset 4)) 1)))) (forall ((v_ArrVal_1805 (Array Int Int))) (<= c_~v_old~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1805) c_~queue~0.base) .cse1))) (not (= (mod c_~ok~0 256) 0))))) (<= c_~n~0 (+ c_~end~0 1)) (forall ((~A~0.offset Int) (v_~i~0_610 Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse7 (select |c_#memory_int| ~A~0.base))) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse5 (* c_~end~0 4)) (.cse6 (select .cse7 (+ ~A~0.offset (* v_~i~0_610 4)))) (.cse3 (select .cse7 (+ (* ~i~0 4) ~A~0.offset)))) (or (not (<= c_~last~0 .cse3)) (not (= (select .cse4 (+ .cse5 c_~queue~0.offset)) .cse3)) (not (= .cse6 (select .cse4 (+ .cse5 c_~queue~0.offset 4)))) (< .cse6 .cse3)))))) is different from false [2022-12-06 07:51:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 07:51:59,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501282730] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:59,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:59,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2022-12-06 07:51:59,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346460571] [2022-12-06 07:51:59,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:59,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 07:51:59,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:59,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 07:51:59,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=424, Unknown=3, NotChecked=44, Total=600 [2022-12-06 07:51:59,377 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 93 [2022-12-06 07:51:59,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 3573 transitions, 116841 flow. Second operand has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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:59,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:59,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 93 [2022-12-06 07:51:59,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:47,297 INFO L130 PetriNetUnfolder]: 22881/40606 cut-off events. [2022-12-06 07:52:47,298 INFO L131 PetriNetUnfolder]: For 2009726/2009726 co-relation queries the response was YES. [2022-12-06 07:52:48,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534430 conditions, 40606 events. 22881/40606 cut-off events. For 2009726/2009726 co-relation queries the response was YES. Maximal size of possible extension queue 1925. Compared 366257 event pairs, 3501 based on Foata normal form. 18/40624 useless extension candidates. Maximal degree in co-relation 534196. Up to 20397 conditions per place. [2022-12-06 07:52:48,287 INFO L137 encePairwiseOnDemand]: 28/93 looper letters, 2436 selfloop transitions, 2719 changer transitions 253/5408 dead transitions. [2022-12-06 07:52:48,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 5408 transitions, 178820 flow [2022-12-06 07:52:48,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-06 07:52:48,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-06 07:52:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 415 transitions. [2022-12-06 07:52:48,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10883818515604511 [2022-12-06 07:52:48,289 INFO L175 Difference]: Start difference. First operand has 379 places, 3573 transitions, 116841 flow. Second operand 41 states and 415 transitions. [2022-12-06 07:52:48,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 5408 transitions, 178820 flow [2022-12-06 07:53:16,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 5408 transitions, 177696 flow, removed 462 selfloop flow, removed 7 redundant places. [2022-12-06 07:53:16,378 INFO L231 Difference]: Finished difference. Result has 442 places, 4686 transitions, 162331 flow [2022-12-06 07:53:16,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=115822, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1732, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=162331, PETRI_PLACES=442, PETRI_TRANSITIONS=4686} [2022-12-06 07:53:16,381 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 417 predicate places. [2022-12-06 07:53:16,381 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:16,381 INFO L89 Accepts]: Start accepts. Operand has 442 places, 4686 transitions, 162331 flow [2022-12-06 07:53:16,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:16,415 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:16,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 442 places, 4686 transitions, 162331 flow [2022-12-06 07:53:16,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 434 places, 4686 transitions, 162331 flow [2022-12-06 07:53:37,358 INFO L130 PetriNetUnfolder]: 13655/28649 cut-off events. [2022-12-06 07:53:37,359 INFO L131 PetriNetUnfolder]: For 1471314/1472119 co-relation queries the response was YES. [2022-12-06 07:53:37,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374147 conditions, 28649 events. 13655/28649 cut-off events. For 1471314/1472119 co-relation queries the response was YES. Maximal size of possible extension queue 1907. Compared 305877 event pairs, 2677 based on Foata normal form. 57/26874 useless extension candidates. Maximal degree in co-relation 373822. Up to 10013 conditions per place. [2022-12-06 07:53:38,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 434 places, 4686 transitions, 162331 flow [2022-12-06 07:53:38,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 10846 [2022-12-06 07:53:38,396 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:38,397 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22016 [2022-12-06 07:53:38,397 INFO L495 AbstractCegarLoop]: Abstraction has has 434 places, 4686 transitions, 162331 flow [2022-12-06 07:53:38,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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:53:38,397 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:38,397 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:38,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 07:53:38,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 07:53:38,603 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:38,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:38,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1380643433, now seen corresponding path program 1 times [2022-12-06 07:53:38,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:38,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394383832] [2022-12-06 07:53:38,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:38,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:39,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:39,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394383832] [2022-12-06 07:53:39,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394383832] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:39,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626316596] [2022-12-06 07:53:39,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:39,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:39,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:39,436 INFO L229 MonitoredProcess]: Starting monitored process 24 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:53:39,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 07:53:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:39,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-06 07:53:39,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:39,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-12-06 07:53:39,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:53:39,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 41 [2022-12-06 07:53:39,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:39,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 28 [2022-12-06 07:53:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:39,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:53:41,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:41,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 608 treesize of output 1551 [2022-12-06 07:53:41,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:41,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 372 treesize of output 421 [2022-12-06 07:53:41,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:41,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 328 treesize of output 416 [2022-12-06 07:53:41,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:41,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 277 treesize of output 286 Received shutdown request... [2022-12-06 07:55:17,934 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 07:55:17,936 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 07:55:17,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 07:55:17,962 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:55:17,962 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:55:18,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:18,141 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 46ms.. [2022-12-06 07:55:18,142 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 07:55:18,143 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 07:55:18,143 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:18,145 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:55:18,145 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:55:18,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:55:18 BasicIcfg [2022-12-06 07:55:18,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:55:18,148 INFO L158 Benchmark]: Toolchain (without parser) took 819652.32ms. Allocated memory was 190.8MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 166.2MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-06 07:55:18,148 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 105.5MB in the beginning and 105.4MB in the end (delta: 37.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:55:18,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.21ms. Allocated memory is still 190.8MB. Free memory was 165.9MB in the beginning and 153.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 07:55:18,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.26ms. Allocated memory is still 190.8MB. Free memory was 153.3MB in the beginning and 151.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:55:18,148 INFO L158 Benchmark]: Boogie Preprocessor took 30.28ms. Allocated memory is still 190.8MB. Free memory was 151.1MB in the beginning and 149.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:55:18,149 INFO L158 Benchmark]: RCFGBuilder took 508.82ms. Allocated memory is still 190.8MB. Free memory was 149.1MB in the beginning and 157.2MB in the end (delta: -8.0MB). Peak memory consumption was 16.3MB. Max. memory is 8.0GB. [2022-12-06 07:55:18,149 INFO L158 Benchmark]: TraceAbstraction took 818838.50ms. Allocated memory was 190.8MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 156.3MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-06 07:55:18,151 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 127.9MB. Free memory was 105.5MB in the beginning and 105.4MB in the end (delta: 37.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.21ms. Allocated memory is still 190.8MB. Free memory was 165.9MB in the beginning and 153.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.26ms. Allocated memory is still 190.8MB. Free memory was 153.3MB in the beginning and 151.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.28ms. Allocated memory is still 190.8MB. Free memory was 151.1MB in the beginning and 149.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 508.82ms. Allocated memory is still 190.8MB. Free memory was 149.1MB in the beginning and 157.2MB in the end (delta: -8.0MB). Peak memory consumption was 16.3MB. Max. memory is 8.0GB. * TraceAbstraction took 818838.50ms. Allocated memory was 190.8MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 156.3MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 155 PlacesBefore, 25 PlacesAfterwards, 163 TransitionsBefore, 23 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 110 TrivialYvCompositions, 20 ConcurrentYvCompositions, 10 ChoiceCompositions, 140 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 454, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 423, independent: 408, independent conditional: 0, independent unconditional: 408, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 423, independent: 407, independent conditional: 0, independent unconditional: 407, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 482, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 423, unknown conditional: 0, unknown unconditional: 423] , Statistics on independence cache: Total cache size (in pairs): 638, Positive cache size: 623, Positive conditional cache size: 0, Positive unconditional cache size: 623, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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, 25 PlacesBefore, 25 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 21, unknown conditional: 2, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 9, Negative conditional cache size: 2, Negative unconditional cache size: 7, 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, 27 PlacesBefore, 26 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 54, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 11, Negative conditional cache size: 4, Negative unconditional cache size: 7, 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, 30 PlacesBefore, 30 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 12, independent conditional: 7, independent unconditional: 5, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 13, Negative conditional cache size: 4, Negative unconditional cache size: 9, 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, 33 PlacesBefore, 33 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 15, Negative conditional cache size: 4, Negative unconditional cache size: 11, 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, 35 PlacesBefore, 35 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 15, Negative conditional cache size: 4, Negative unconditional cache size: 11, 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.9s, 38 PlacesBefore, 37 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, 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: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 15, Negative conditional cache size: 4, Negative unconditional cache size: 11, 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: 13.2s, 72 PlacesBefore, 66 PlacesAfterwards, 129 TransitionsBefore, 123 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 616, independent: 563, independent conditional: 563, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 616, independent: 563, independent conditional: 404, independent unconditional: 159, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 616, independent: 563, independent conditional: 400, independent unconditional: 163, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 616, independent: 563, independent conditional: 400, independent unconditional: 163, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 9, independent unconditional: 3, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 616, independent: 551, independent conditional: 391, independent unconditional: 160, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 14, unknown conditional: 11, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 34, Positive conditional cache size: 11, Positive unconditional cache size: 23, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 107 PlacesBefore, 101 PlacesAfterwards, 279 TransitionsBefore, 273 TransitionsAfterwards, 1014 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 37, independent conditional: 37, 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: 37, independent: 37, independent conditional: 37, 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: 37, independent: 37, independent conditional: 37, 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: 37, independent: 37, independent conditional: 37, 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: 37, independent: 36, independent conditional: 36, 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): 67, Positive cache size: 50, Positive conditional cache size: 15, Positive unconditional cache size: 35, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 94 PlacesBefore, 94 PlacesAfterwards, 267 TransitionsBefore, 267 TransitionsAfterwards, 992 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): 67, Positive cache size: 50, Positive conditional cache size: 15, Positive unconditional cache size: 35, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 99 PlacesBefore, 99 PlacesAfterwards, 314 TransitionsBefore, 314 TransitionsAfterwards, 1136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 1, independent: 0, independent conditional: 0, 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): 68, Positive cache size: 51, Positive conditional cache size: 16, Positive unconditional cache size: 35, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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: 5.4s, 124 PlacesBefore, 124 PlacesAfterwards, 433 TransitionsBefore, 433 TransitionsAfterwards, 1640 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 68, Positive cache size: 51, Positive conditional cache size: 16, Positive unconditional cache size: 35, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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.9s, 146 PlacesBefore, 146 PlacesAfterwards, 582 TransitionsBefore, 582 TransitionsAfterwards, 2322 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 5, independent unconditional: 7, 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: 12, independent: 12, independent conditional: 5, independent unconditional: 7, 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: 12, independent: 12, independent conditional: 5, independent unconditional: 7, 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: 10, independent: 10, independent conditional: 5, independent unconditional: 5, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 12, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 5, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 163 PlacesBefore, 163 PlacesAfterwards, 723 TransitionsBefore, 723 TransitionsAfterwards, 3090 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): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 197 PlacesBefore, 197 PlacesAfterwards, 824 TransitionsBefore, 824 TransitionsAfterwards, 3514 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): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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: 6.6s, 197 PlacesBefore, 197 PlacesAfterwards, 853 TransitionsBefore, 853 TransitionsAfterwards, 3614 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 189 PlacesBefore, 189 PlacesAfterwards, 667 TransitionsBefore, 667 TransitionsAfterwards, 2744 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): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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.9s, 216 PlacesBefore, 215 PlacesAfterwards, 863 TransitionsBefore, 862 TransitionsAfterwards, 3606 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 62, independent conditional: 62, 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: 62, independent: 62, independent conditional: 62, 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: 62, independent: 62, independent conditional: 62, 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: 62, independent: 62, independent conditional: 62, 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: 62, independent: 62, independent conditional: 62, 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): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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: 4.0s, 178 PlacesBefore, 177 PlacesAfterwards, 612 TransitionsBefore, 611 TransitionsAfterwards, 2626 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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: 4.4s, 157 PlacesBefore, 157 PlacesAfterwards, 543 TransitionsBefore, 543 TransitionsAfterwards, 2274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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: 10.3s, 158 PlacesBefore, 158 PlacesAfterwards, 630 TransitionsBefore, 630 TransitionsAfterwards, 2608 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 200 PlacesBefore, 198 PlacesAfterwards, 811 TransitionsBefore, 809 TransitionsAfterwards, 3408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 7, independent conditional: 7, 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): 87, Positive cache size: 70, Positive conditional cache size: 25, Positive unconditional cache size: 45, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 198 PlacesBefore, 198 PlacesAfterwards, 814 TransitionsBefore, 814 TransitionsAfterwards, 3412 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): 87, Positive cache size: 70, Positive conditional cache size: 25, Positive unconditional cache size: 45, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 189 PlacesBefore, 189 PlacesAfterwards, 751 TransitionsBefore, 751 TransitionsAfterwards, 3208 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): 87, Positive cache size: 70, Positive conditional cache size: 25, Positive unconditional cache size: 45, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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.3s, 250 PlacesBefore, 247 PlacesAfterwards, 1566 TransitionsBefore, 1563 TransitionsAfterwards, 4272 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 3, independent: 2, independent conditional: 2, 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: 73, Positive conditional cache size: 26, Positive unconditional cache size: 47, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 249 PlacesBefore, 249 PlacesAfterwards, 2247 TransitionsBefore, 2247 TransitionsAfterwards, 6514 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: 73, Positive conditional cache size: 26, Positive unconditional cache size: 47, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 302 PlacesBefore, 300 PlacesAfterwards, 2908 TransitionsBefore, 2906 TransitionsAfterwards, 7308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 8, 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: 11, independent: 11, independent conditional: 8, 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: 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] , 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: 11, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 86, Positive conditional cache size: 27, Positive unconditional cache size: 59, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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: 2.6s, 389 PlacesBefore, 382 PlacesAfterwards, 3333 TransitionsBefore, 3326 TransitionsAfterwards, 8070 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 21, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 97, Positive conditional cache size: 33, Positive unconditional cache size: 64, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 379 PlacesBefore, 379 PlacesAfterwards, 3573 TransitionsBefore, 3573 TransitionsAfterwards, 8438 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 1, independent: 0, independent conditional: 0, 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): 116, Positive cache size: 99, Positive conditional cache size: 35, Positive unconditional cache size: 64, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 434 PlacesBefore, 434 PlacesAfterwards, 4686 TransitionsBefore, 4686 TransitionsAfterwards, 10846 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): 116, Positive cache size: 99, Positive conditional cache size: 35, Positive unconditional cache size: 64, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 46ms.. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 46ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 46ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 183 locations, 3 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: 818.8s, OverallIterations: 30, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 505.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 136 mSolverCounterUnknown, 5735 SdHoareTripleChecker+Valid, 45.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5735 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 43.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 638 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 2143 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19125 IncrementalHoareTripleChecker+Invalid, 22042 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2143 mSolverCounterUnsat, 7 mSDtfsCounter, 19125 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1161 GetRequests, 513 SyntacticMatches, 11 SemanticMatches, 637 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 6854 ImplicationChecksByTransitivity, 217.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162331occurred in iteration=29, InterpolantAutomatonStates: 475, 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.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 71.6s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1189 ConstructedInterpolants, 149 QuantifiedInterpolants, 31624 SizeOfPredicates, 349 NumberOfNonLiveVariables, 5794 ConjunctsInSsa, 798 ConjunctsInUnsatCore, 68 InterpolantComputations, 12 PerfectInterpolantSequences, 90/276 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