/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:33:18,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:33:18,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:33:18,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:33:18,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:33:18,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:33:18,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:33:18,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:33:18,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:33:18,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:33:18,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:33:18,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:33:18,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:33:18,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:33:18,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:33:18,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:33:18,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:33:18,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:33:18,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:33:18,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:33:18,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:33:18,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:33:18,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:33:18,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:33:18,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:33:18,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:33:18,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:33:18,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:33:18,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:33:18,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:33:18,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:33:18,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:33:18,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:33:18,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:33:18,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:33:18,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:33:18,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:33:18,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:33:18,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:33:18,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:33:18,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:33:18,489 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:33:18,514 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:33:18,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:33:18,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:33:18,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:33:18,516 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:33:18,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:33:18,516 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:33:18,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:33:18,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:33:18,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:33:18,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:33:18,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:33:18,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:33:18,518 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:33:18,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:33:18,518 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:33:18,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:33:18,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:33:18,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:33:18,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:33:18,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:33:18,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:33:18,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:33:18,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:33:18,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:33:18,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:33:18,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:33:18,519 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:33:18,519 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 05:33:18,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:33:18,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:33:18,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:33:18,794 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:33:18,794 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:33:18,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-12-06 05:33:19,785 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:33:19,984 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:33:19,984 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-12-06 05:33:19,990 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c838f5804/e79de1e019274b56b26856cec18e7e8d/FLAG6b5262aed [2022-12-06 05:33:20,002 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c838f5804/e79de1e019274b56b26856cec18e7e8d [2022-12-06 05:33:20,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:33:20,005 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:33:20,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:33:20,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:33:20,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:33:20,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:33:20" (1/1) ... [2022-12-06 05:33:20,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6915a0c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:33:20, skipping insertion in model container [2022-12-06 05:33:20,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:33:20" (1/1) ... [2022-12-06 05:33:20,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:33:20,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:33:20,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:33:20,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:33:20,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:33:20,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:33:20,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:33:20,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:33:20,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:33:20,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:33:20,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:33:20,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:33:20,173 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-dec-subseq.wvr.c[2924,2937] [2022-12-06 05:33:20,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:33:20,190 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:33:20,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:33:20,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:33:20,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:33:20,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:33:20,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:33:20,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:33:20,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:33:20,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:33:20,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:33:20,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:33:20,206 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-dec-subseq.wvr.c[2924,2937] [2022-12-06 05:33:20,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:33:20,218 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:33:20,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:33:20 WrapperNode [2022-12-06 05:33:20,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:33:20,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:33:20,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:33:20,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:33:20,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:33:20" (1/1) ... [2022-12-06 05:33:20,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:33:20" (1/1) ... [2022-12-06 05:33:20,254 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-12-06 05:33:20,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:33:20,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:33:20,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:33:20,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:33:20,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:33:20" (1/1) ... [2022-12-06 05:33:20,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:33:20" (1/1) ... [2022-12-06 05:33:20,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:33:20" (1/1) ... [2022-12-06 05:33:20,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:33:20" (1/1) ... [2022-12-06 05:33:20,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:33:20" (1/1) ... [2022-12-06 05:33:20,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:33:20" (1/1) ... [2022-12-06 05:33:20,272 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:33:20" (1/1) ... [2022-12-06 05:33:20,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:33:20" (1/1) ... [2022-12-06 05:33:20,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:33:20,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:33:20,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:33:20,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:33:20,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:33:20" (1/1) ... [2022-12-06 05:33:20,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:33:20,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:33:20,323 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 05:33:20,338 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 05:33:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:33:20,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:33:20,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:33:20,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:33:20,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:33:20,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:33:20,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:33:20,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:33:20,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:33:20,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:33:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:33:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:33:20,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:33:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:33:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:33:20,354 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 05:33:20,480 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:33:20,481 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:33:20,771 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:33:20,830 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:33:20,830 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 05:33:20,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:33:20 BoogieIcfgContainer [2022-12-06 05:33:20,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:33:20,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:33:20,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:33:20,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:33:20,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:33:20" (1/3) ... [2022-12-06 05:33:20,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c759be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:33:20, skipping insertion in model container [2022-12-06 05:33:20,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:33:20" (2/3) ... [2022-12-06 05:33:20,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c759be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:33:20, skipping insertion in model container [2022-12-06 05:33:20,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:33:20" (3/3) ... [2022-12-06 05:33:20,838 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-12-06 05:33:20,850 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:33:20,851 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:33:20,851 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:33:20,900 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:33:20,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 173 transitions, 362 flow [2022-12-06 05:33:20,980 INFO L130 PetriNetUnfolder]: 15/171 cut-off events. [2022-12-06 05:33:20,980 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:33:20,994 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 05:33:20,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 173 transitions, 362 flow [2022-12-06 05:33:20,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2022-12-06 05:33:21,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:33:21,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-06 05:33:21,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2022-12-06 05:33:21,058 INFO L130 PetriNetUnfolder]: 15/163 cut-off events. [2022-12-06 05:33:21,058 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:33:21,059 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 05:33:21,062 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-06 05:33:21,062 INFO L188 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-06 05:33:26,716 INFO L203 LiptonReduction]: Total number of compositions: 140 [2022-12-06 05:33:26,732 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:33:26,736 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;@92f6634, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:33:26,737 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:33:26,741 INFO L130 PetriNetUnfolder]: 5/22 cut-off events. [2022-12-06 05:33:26,741 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:33:26,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:33:26,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:33:26,743 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 05:33:26,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:33:26,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1533171233, now seen corresponding path program 1 times [2022-12-06 05:33:26,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:33:26,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399958669] [2022-12-06 05:33:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:33:26,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:33:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:33:27,154 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 05:33:27,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:33:27,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399958669] [2022-12-06 05:33:27,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399958669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:33:27,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:33:27,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:33:27,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28969684] [2022-12-06 05:33:27,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:33:27,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:33:27,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:33:27,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:33:27,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:33:27,177 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:33:27,178 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 05:33:27,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:33:27,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:33:27,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:33:27,264 INFO L130 PetriNetUnfolder]: 146/245 cut-off events. [2022-12-06 05:33:27,264 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 05:33:27,265 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 05:33:27,267 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 31 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-06 05:33:27,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 155 flow [2022-12-06 05:33:27,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:33:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:33:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 05:33:27,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-06 05:33:27,275 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 4 states and 36 transitions. [2022-12-06 05:33:27,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 155 flow [2022-12-06 05:33:27,278 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 05:33:27,279 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 71 flow [2022-12-06 05:33:27,280 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 05:33:27,282 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2022-12-06 05:33:27,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:33:27,283 INFO L89 Accepts]: Start accepts. Operand has 25 places, 25 transitions, 71 flow [2022-12-06 05:33:27,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:33:27,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:33:27,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 25 transitions, 71 flow [2022-12-06 05:33:27,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 71 flow [2022-12-06 05:33:27,290 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-06 05:33:27,290 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:33:27,290 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 05:33:27,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 71 flow [2022-12-06 05:33:27,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 05:33:27,303 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:33:27,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 05:33:27,304 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 71 flow [2022-12-06 05:33:27,304 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 05:33:27,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:33:27,305 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:33:27,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:33:27,305 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 05:33:27,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:33:27,305 INFO L85 PathProgramCache]: Analyzing trace with hash 908602455, now seen corresponding path program 1 times [2022-12-06 05:33:27,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:33:27,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121065277] [2022-12-06 05:33:27,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:33:27,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:33:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:33:27,388 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 05:33:27,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:33:27,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121065277] [2022-12-06 05:33:27,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121065277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:33:27,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:33:27,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:33:27,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502411263] [2022-12-06 05:33:27,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:33:27,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:33:27,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:33:27,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:33:27,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:33:27,391 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:33:27,391 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 05:33:27,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:33:27,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:33:27,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:33:27,475 INFO L130 PetriNetUnfolder]: 146/246 cut-off events. [2022-12-06 05:33:27,476 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 05:33:27,476 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 05:33:27,477 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 31 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2022-12-06 05:33:27,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 36 transitions, 166 flow [2022-12-06 05:33:27,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:33:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:33:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 05:33:27,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2022-12-06 05:33:27,479 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 71 flow. Second operand 4 states and 37 transitions. [2022-12-06 05:33:27,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 36 transitions, 166 flow [2022-12-06 05:33:27,480 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 05:33:27,480 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 84 flow [2022-12-06 05:33:27,480 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 05:33:27,481 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2022-12-06 05:33:27,481 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:33:27,481 INFO L89 Accepts]: Start accepts. Operand has 27 places, 26 transitions, 84 flow [2022-12-06 05:33:27,482 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:33:27,482 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:33:27,482 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 26 transitions, 84 flow [2022-12-06 05:33:27,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 84 flow [2022-12-06 05:33:27,485 INFO L130 PetriNetUnfolder]: 6/30 cut-off events. [2022-12-06 05:33:27,485 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:33:27,486 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 05:33:27,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 26 transitions, 84 flow [2022-12-06 05:33:27,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 05:33:27,741 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:33:27,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 261 [2022-12-06 05:33:27,742 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 80 flow [2022-12-06 05:33:27,742 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 05:33:27,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:33:27,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:33:27,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:33:27,742 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 05:33:27,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:33:27,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1878813032, now seen corresponding path program 1 times [2022-12-06 05:33:27,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:33:27,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391892952] [2022-12-06 05:33:27,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:33:27,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:33:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:33:27,828 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 05:33:27,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:33:27,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391892952] [2022-12-06 05:33:27,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391892952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:33:27,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:33:27,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:33:27,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140177080] [2022-12-06 05:33:27,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:33:27,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:33:27,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:33:27,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:33:27,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:33:27,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:33:27,830 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 05:33:27,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:33:27,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:33:27,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:33:27,935 INFO L130 PetriNetUnfolder]: 228/381 cut-off events. [2022-12-06 05:33:27,935 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 05:33:27,937 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 05:33:27,939 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 36 selfloop transitions, 16 changer transitions 0/52 dead transitions. [2022-12-06 05:33:27,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 52 transitions, 266 flow [2022-12-06 05:33:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:33:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:33:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 05:33:27,941 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-06 05:33:27,941 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 80 flow. Second operand 5 states and 48 transitions. [2022-12-06 05:33:27,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 52 transitions, 266 flow [2022-12-06 05:33:27,943 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 05:33:27,944 INFO L231 Difference]: Finished difference. Result has 30 places, 39 transitions, 181 flow [2022-12-06 05:33:27,944 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 05:33:27,945 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2022-12-06 05:33:27,945 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:33:27,946 INFO L89 Accepts]: Start accepts. Operand has 30 places, 39 transitions, 181 flow [2022-12-06 05:33:27,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:33:27,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:33:27,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 39 transitions, 181 flow [2022-12-06 05:33:27,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 39 transitions, 181 flow [2022-12-06 05:33:27,955 INFO L130 PetriNetUnfolder]: 29/82 cut-off events. [2022-12-06 05:33:27,955 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 05:33:27,955 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 05:33:27,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 39 transitions, 181 flow [2022-12-06 05:33:27,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 05:33:27,964 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:33:27,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 05:33:27,965 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 39 transitions, 181 flow [2022-12-06 05:33:27,965 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 05:33:27,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:33:27,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:33:27,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:33:27,966 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 05:33:27,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:33:27,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1128489956, now seen corresponding path program 2 times [2022-12-06 05:33:27,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:33:27,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005169824] [2022-12-06 05:33:27,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:33:27,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:33:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:33:28,070 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 05:33:28,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:33:28,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005169824] [2022-12-06 05:33:28,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005169824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:33:28,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:33:28,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:33:28,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083794988] [2022-12-06 05:33:28,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:33:28,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:33:28,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:33:28,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:33:28,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:33:28,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 05:33:28,072 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 05:33:28,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:33:28,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 05:33:28,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:33:28,160 INFO L130 PetriNetUnfolder]: 296/490 cut-off events. [2022-12-06 05:33:28,160 INFO L131 PetriNetUnfolder]: For 453/462 co-relation queries the response was YES. [2022-12-06 05:33:28,161 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 05:33:28,163 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 46 selfloop transitions, 5 changer transitions 2/55 dead transitions. [2022-12-06 05:33:28,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 55 transitions, 358 flow [2022-12-06 05:33:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:33:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:33:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 05:33:28,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-06 05:33:28,164 INFO L175 Difference]: Start difference. First operand has 30 places, 39 transitions, 181 flow. Second operand 3 states and 39 transitions. [2022-12-06 05:33:28,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 55 transitions, 358 flow [2022-12-06 05:33:28,166 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 05:33:28,167 INFO L231 Difference]: Finished difference. Result has 33 places, 41 transitions, 207 flow [2022-12-06 05:33:28,167 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 05:33:28,168 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2022-12-06 05:33:28,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:33:28,168 INFO L89 Accepts]: Start accepts. Operand has 33 places, 41 transitions, 207 flow [2022-12-06 05:33:28,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:33:28,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:33:28,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 41 transitions, 207 flow [2022-12-06 05:33:28,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 41 transitions, 207 flow [2022-12-06 05:33:28,179 INFO L130 PetriNetUnfolder]: 37/101 cut-off events. [2022-12-06 05:33:28,179 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-06 05:33:28,180 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 05:33:28,180 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 41 transitions, 207 flow [2022-12-06 05:33:28,180 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 05:33:28,188 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:33:28,189 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 05:33:28,189 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 41 transitions, 207 flow [2022-12-06 05:33:28,189 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 05:33:28,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:33:28,189 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 05:33:28,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:33:28,190 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 05:33:28,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:33:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1026730500, now seen corresponding path program 1 times [2022-12-06 05:33:28,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:33:28,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863960667] [2022-12-06 05:33:28,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:33:28,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:33:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:33:28,356 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 05:33:28,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:33:28,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863960667] [2022-12-06 05:33:28,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863960667] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:33:28,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669331641] [2022-12-06 05:33:28,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:33:28,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:33:28,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:33:28,359 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 05:33:28,360 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 05:33:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:33:28,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:33:28,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:33:28,493 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 05:33:28,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:33:28,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669331641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:33:28,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:33:28,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-06 05:33:28,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615126780] [2022-12-06 05:33:28,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:33:28,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:33:28,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:33:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:33:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:33:28,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:33:28,495 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 05:33:28,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:33:28,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:33:28,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:33:28,583 INFO L130 PetriNetUnfolder]: 304/527 cut-off events. [2022-12-06 05:33:28,584 INFO L131 PetriNetUnfolder]: For 445/445 co-relation queries the response was YES. [2022-12-06 05:33:28,585 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 05:33:28,586 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 50 selfloop transitions, 2 changer transitions 5/57 dead transitions. [2022-12-06 05:33:28,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 57 transitions, 389 flow [2022-12-06 05:33:28,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:33:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:33:28,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 05:33:28,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2022-12-06 05:33:28,587 INFO L175 Difference]: Start difference. First operand has 33 places, 41 transitions, 207 flow. Second operand 3 states and 37 transitions. [2022-12-06 05:33:28,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 57 transitions, 389 flow [2022-12-06 05:33:28,599 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 05:33:28,600 INFO L231 Difference]: Finished difference. Result has 35 places, 41 transitions, 214 flow [2022-12-06 05:33:28,601 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 05:33:28,601 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2022-12-06 05:33:28,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:33:28,601 INFO L89 Accepts]: Start accepts. Operand has 35 places, 41 transitions, 214 flow [2022-12-06 05:33:28,602 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:33:28,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:33:28,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 41 transitions, 214 flow [2022-12-06 05:33:28,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 41 transitions, 214 flow [2022-12-06 05:33:28,611 INFO L130 PetriNetUnfolder]: 37/114 cut-off events. [2022-12-06 05:33:28,611 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 05:33:28,611 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 05:33:28,612 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 41 transitions, 214 flow [2022-12-06 05:33:28,612 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 05:33:28,613 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:33:28,613 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:33:28,613 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 41 transitions, 214 flow [2022-12-06 05:33:28,614 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 05:33:28,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:33:28,614 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 05:33:28,622 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 05:33:28,819 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 05:33:28,819 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 05:33:28,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:33:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1914271914, now seen corresponding path program 1 times [2022-12-06 05:33:28,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:33:28,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928646464] [2022-12-06 05:33:28,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:33:28,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:33:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:33:28,918 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 05:33:28,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:33:28,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928646464] [2022-12-06 05:33:28,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928646464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:33:28,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:33:28,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:33:28,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54240082] [2022-12-06 05:33:28,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:33:28,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:33:28,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:33:28,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:33:28,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:33:28,921 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 05:33:28,921 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 05:33:28,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:33:28,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 05:33:28,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:33:29,009 INFO L130 PetriNetUnfolder]: 344/631 cut-off events. [2022-12-06 05:33:29,010 INFO L131 PetriNetUnfolder]: For 799/816 co-relation queries the response was YES. [2022-12-06 05:33:29,011 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 05:33:29,013 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 38 selfloop transitions, 2 changer transitions 20/62 dead transitions. [2022-12-06 05:33:29,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 62 transitions, 424 flow [2022-12-06 05:33:29,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:33:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:33:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 05:33:29,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2022-12-06 05:33:29,015 INFO L175 Difference]: Start difference. First operand has 35 places, 41 transitions, 214 flow. Second operand 4 states and 43 transitions. [2022-12-06 05:33:29,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 62 transitions, 424 flow [2022-12-06 05:33:29,019 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 05:33:29,019 INFO L231 Difference]: Finished difference. Result has 39 places, 42 transitions, 226 flow [2022-12-06 05:33:29,020 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 05:33:29,021 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2022-12-06 05:33:29,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:33:29,022 INFO L89 Accepts]: Start accepts. Operand has 39 places, 42 transitions, 226 flow [2022-12-06 05:33:29,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:33:29,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:33:29,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 42 transitions, 226 flow [2022-12-06 05:33:29,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 42 transitions, 226 flow [2022-12-06 05:33:29,032 INFO L130 PetriNetUnfolder]: 37/115 cut-off events. [2022-12-06 05:33:29,032 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-06 05:33:29,032 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 05:33:29,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 42 transitions, 226 flow [2022-12-06 05:33:29,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 05:33:29,916 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:33:29,917 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 895 [2022-12-06 05:33:29,917 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 41 transitions, 222 flow [2022-12-06 05:33:29,917 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 05:33:29,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:33:29,917 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 05:33:29,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:33:29,917 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 05:33:29,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:33:29,918 INFO L85 PathProgramCache]: Analyzing trace with hash 788331176, now seen corresponding path program 1 times [2022-12-06 05:33:29,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:33:29,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896436185] [2022-12-06 05:33:29,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:33:29,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:33:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:33:30,910 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 05:33:30,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:33:30,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896436185] [2022-12-06 05:33:30,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896436185] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:33:30,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106217470] [2022-12-06 05:33:30,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:33:30,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:33:30,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:33:30,912 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 05:33:30,917 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 05:33:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:33:30,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 05:33:30,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:33:31,041 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 05:33:31,074 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 7 treesize of output 3 [2022-12-06 05:33:31,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:33:31,157 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 18 treesize of output 20 [2022-12-06 05:33:31,357 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-06 05:33:31,357 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 38 treesize of output 10 [2022-12-06 05:33:31,379 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 05:33:31,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:33:31,769 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-12-06 05:33:31,770 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 259 treesize of output 256 [2022-12-06 05:33:31,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:33:31,794 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 05:33:31,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:33:31,809 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 05:33:32,286 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 05:33:32,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106217470] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:33:32,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:33:32,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-12-06 05:33:32,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802037515] [2022-12-06 05:33:32,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:33:32,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 05:33:32,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:33:32,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 05:33:32,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=545, Unknown=3, NotChecked=0, Total=702 [2022-12-06 05:33:32,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:33:32,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 41 transitions, 222 flow. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 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 05:33:32,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:33:32,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:33:32,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:33:38,972 WARN L233 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 83 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:33:51,597 WARN L233 SmtUtils]: Spent 12.29s on a formula simplification. DAG size of input: 75 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:33:53,657 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 05:33:55,952 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 05:34:13,717 WARN L233 SmtUtils]: Spent 10.29s on a formula simplification. DAG size of input: 90 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:34:24,720 WARN L233 SmtUtils]: Spent 10.80s on a formula simplification. DAG size of input: 89 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:34:35,940 WARN L233 SmtUtils]: Spent 11.12s on a formula simplification. DAG size of input: 82 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:34:45,914 WARN L233 SmtUtils]: Spent 9.85s on a formula simplification. DAG size of input: 87 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:34:46,699 INFO L130 PetriNetUnfolder]: 1632/2867 cut-off events. [2022-12-06 05:34:46,699 INFO L131 PetriNetUnfolder]: For 2876/2876 co-relation queries the response was YES. [2022-12-06 05:34:46,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9658 conditions, 2867 events. 1632/2867 cut-off events. For 2876/2876 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 16998 event pairs, 220 based on Foata normal form. 31/2709 useless extension candidates. Maximal degree in co-relation 9640. Up to 669 conditions per place. [2022-12-06 05:34:46,711 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 265 selfloop transitions, 121 changer transitions 84/470 dead transitions. [2022-12-06 05:34:46,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 470 transitions, 3198 flow [2022-12-06 05:34:46,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-06 05:34:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-06 05:34:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 363 transitions. [2022-12-06 05:34:46,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40468227424749165 [2022-12-06 05:34:46,716 INFO L175 Difference]: Start difference. First operand has 37 places, 41 transitions, 222 flow. Second operand 39 states and 363 transitions. [2022-12-06 05:34:46,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 470 transitions, 3198 flow [2022-12-06 05:34:46,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 470 transitions, 3158 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-06 05:34:46,739 INFO L231 Difference]: Finished difference. Result has 96 places, 165 transitions, 1508 flow [2022-12-06 05:34:46,739 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=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=1508, PETRI_PLACES=96, PETRI_TRANSITIONS=165} [2022-12-06 05:34:46,740 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 71 predicate places. [2022-12-06 05:34:46,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:34:46,740 INFO L89 Accepts]: Start accepts. Operand has 96 places, 165 transitions, 1508 flow [2022-12-06 05:34:46,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:34:46,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:34:46,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 165 transitions, 1508 flow [2022-12-06 05:34:46,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 165 transitions, 1508 flow [2022-12-06 05:34:46,803 INFO L130 PetriNetUnfolder]: 274/735 cut-off events. [2022-12-06 05:34:46,803 INFO L131 PetriNetUnfolder]: For 3652/3692 co-relation queries the response was YES. [2022-12-06 05:34:46,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3123 conditions, 735 events. 274/735 cut-off events. For 3652/3692 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4837 event pairs, 6 based on Foata normal form. 5/716 useless extension candidates. Maximal degree in co-relation 3050. Up to 213 conditions per place. [2022-12-06 05:34:46,810 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 165 transitions, 1508 flow [2022-12-06 05:34:46,810 INFO L188 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-06 05:34:47,016 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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 05:34:54,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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 05:34:54,974 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 05:34:55,001 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 05:34:55,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8261 [2022-12-06 05:34:55,001 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 161 transitions, 1520 flow [2022-12-06 05:34:55,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 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 05:34:55,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:34:55,002 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 05:34:55,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:34:55,202 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 05:34:55,202 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 05:34:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:34:55,203 INFO L85 PathProgramCache]: Analyzing trace with hash -613260868, now seen corresponding path program 1 times [2022-12-06 05:34:55,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:34:55,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581283185] [2022-12-06 05:34:55,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:55,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:34:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:55,291 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 05:34:55,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:34:55,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581283185] [2022-12-06 05:34:55,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581283185] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:34:55,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879598950] [2022-12-06 05:34:55,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:55,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:34:55,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:34:55,293 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 05:34:55,295 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 05:34:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:55,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 05:34:55,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:34:55,398 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 05:34:55,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:34:55,452 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 05:34:55,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879598950] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:34:55,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:34:55,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-12-06 05:34:55,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128501927] [2022-12-06 05:34:55,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:34:55,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:34:55,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:34:55,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:34:55,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:34:55,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:34:55,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 161 transitions, 1520 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 05:34:55,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:34:55,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:34:55,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:34:55,893 INFO L130 PetriNetUnfolder]: 1316/2328 cut-off events. [2022-12-06 05:34:55,893 INFO L131 PetriNetUnfolder]: For 12652/12652 co-relation queries the response was YES. [2022-12-06 05:34:55,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11293 conditions, 2328 events. 1316/2328 cut-off events. For 12652/12652 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13087 event pairs, 206 based on Foata normal form. 66/2393 useless extension candidates. Maximal degree in co-relation 11193. Up to 710 conditions per place. [2022-12-06 05:34:55,908 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 131 selfloop transitions, 108 changer transitions 1/240 dead transitions. [2022-12-06 05:34:55,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 240 transitions, 2674 flow [2022-12-06 05:34:55,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:34:55,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:34:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-06 05:34:55,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-06 05:34:55,910 INFO L175 Difference]: Start difference. First operand has 87 places, 161 transitions, 1520 flow. Second operand 6 states and 68 transitions. [2022-12-06 05:34:55,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 240 transitions, 2674 flow [2022-12-06 05:34:55,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 240 transitions, 2396 flow, removed 114 selfloop flow, removed 7 redundant places. [2022-12-06 05:34:55,982 INFO L231 Difference]: Finished difference. Result has 89 places, 198 transitions, 2181 flow [2022-12-06 05:34:55,983 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2181, PETRI_PLACES=89, PETRI_TRANSITIONS=198} [2022-12-06 05:34:55,985 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 64 predicate places. [2022-12-06 05:34:55,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:34:55,985 INFO L89 Accepts]: Start accepts. Operand has 89 places, 198 transitions, 2181 flow [2022-12-06 05:34:55,988 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:34:55,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:34:55,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 198 transitions, 2181 flow [2022-12-06 05:34:55,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 198 transitions, 2181 flow [2022-12-06 05:34:56,055 INFO L130 PetriNetUnfolder]: 317/832 cut-off events. [2022-12-06 05:34:56,056 INFO L131 PetriNetUnfolder]: For 4478/4560 co-relation queries the response was YES. [2022-12-06 05:34:56,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4075 conditions, 832 events. 317/832 cut-off events. For 4478/4560 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5479 event pairs, 4 based on Foata normal form. 6/816 useless extension candidates. Maximal degree in co-relation 3238. Up to 250 conditions per place. [2022-12-06 05:34:56,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 198 transitions, 2181 flow [2022-12-06 05:34:56,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 740 [2022-12-06 05:34:56,246 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:34:56,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 262 [2022-12-06 05:34:56,247 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 198 transitions, 2187 flow [2022-12-06 05:34:56,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 05:34:56,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:34:56,247 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 05:34:56,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 05:34:56,451 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 05:34:56,452 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 05:34:56,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:34:56,452 INFO L85 PathProgramCache]: Analyzing trace with hash -713760388, now seen corresponding path program 2 times [2022-12-06 05:34:56,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:34:56,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939175085] [2022-12-06 05:34:56,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:56,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:34:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:56,994 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 05:34:56,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:34:56,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939175085] [2022-12-06 05:34:56,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939175085] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:34:56,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815215932] [2022-12-06 05:34:56,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:34:56,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:34:56,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:34:56,996 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 05:34:56,998 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 05:34:57,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:34:57,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:34:57,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 05:34:57,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:34:59,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:34:59,237 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 05:34:59,238 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 05:34:59,247 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 05:34:59,322 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 05:34:59,344 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 05:34:59,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:34:59,474 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_301 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_301) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1)))) is different from false [2022-12-06 05:34:59,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:34:59,577 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 05:34:59,584 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 05:34:59,705 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 05:34:59,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815215932] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:34:59,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:34:59,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 05:34:59,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38261466] [2022-12-06 05:34:59,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:34:59,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 05:34:59,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:34:59,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 05:34:59,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=254, Unknown=1, NotChecked=34, Total=380 [2022-12-06 05:34:59,707 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:34:59,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 198 transitions, 2187 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 05:34:59,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:34:59,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:34:59,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:02,053 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 05:35:03,030 INFO L130 PetriNetUnfolder]: 1995/3478 cut-off events. [2022-12-06 05:35:03,030 INFO L131 PetriNetUnfolder]: For 20240/20240 co-relation queries the response was YES. [2022-12-06 05:35:03,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18444 conditions, 3478 events. 1995/3478 cut-off events. For 20240/20240 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20250 event pairs, 350 based on Foata normal form. 9/3486 useless extension candidates. Maximal degree in co-relation 16394. Up to 1298 conditions per place. [2022-12-06 05:35:03,056 INFO L137 encePairwiseOnDemand]: 13/33 looper letters, 229 selfloop transitions, 144 changer transitions 30/403 dead transitions. [2022-12-06 05:35:03,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 403 transitions, 4955 flow [2022-12-06 05:35:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:35:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:35:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2022-12-06 05:35:03,057 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29004329004329005 [2022-12-06 05:35:03,058 INFO L175 Difference]: Start difference. First operand has 88 places, 198 transitions, 2187 flow. Second operand 14 states and 134 transitions. [2022-12-06 05:35:03,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 403 transitions, 4955 flow [2022-12-06 05:35:03,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 403 transitions, 4813 flow, removed 48 selfloop flow, removed 1 redundant places. [2022-12-06 05:35:03,185 INFO L231 Difference]: Finished difference. Result has 109 places, 282 transitions, 3679 flow [2022-12-06 05:35:03,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3679, PETRI_PLACES=109, PETRI_TRANSITIONS=282} [2022-12-06 05:35:03,187 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 84 predicate places. [2022-12-06 05:35:03,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:03,187 INFO L89 Accepts]: Start accepts. Operand has 109 places, 282 transitions, 3679 flow [2022-12-06 05:35:03,189 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:03,189 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:03,189 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 282 transitions, 3679 flow [2022-12-06 05:35:03,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 282 transitions, 3679 flow [2022-12-06 05:35:03,289 INFO L130 PetriNetUnfolder]: 436/1132 cut-off events. [2022-12-06 05:35:03,289 INFO L131 PetriNetUnfolder]: For 8312/8385 co-relation queries the response was YES. [2022-12-06 05:35:03,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6406 conditions, 1132 events. 436/1132 cut-off events. For 8312/8385 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7745 event pairs, 7 based on Foata normal form. 12/1131 useless extension candidates. Maximal degree in co-relation 6341. Up to 385 conditions per place. [2022-12-06 05:35:03,301 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 282 transitions, 3679 flow [2022-12-06 05:35:03,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 1092 [2022-12-06 05:35:03,433 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 05:35:05,600 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:35:05,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2414 [2022-12-06 05:35:05,601 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 281 transitions, 3687 flow [2022-12-06 05:35:05,601 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 05:35:05,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:05,601 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:05,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 05:35:05,819 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 05:35:05,819 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 05:35:05,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash -677687481, now seen corresponding path program 1 times [2022-12-06 05:35:05,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:05,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083187502] [2022-12-06 05:35:05,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:05,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:35:05,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:05,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083187502] [2022-12-06 05:35:05,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083187502] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:05,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823604079] [2022-12-06 05:35:05,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:05,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:05,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:05,954 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 05:35:05,957 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 05:35:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:06,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 05:35:06,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:06,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:06,152 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 05:35:06,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823604079] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:35:06,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:35:06,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2022-12-06 05:35:06,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957696273] [2022-12-06 05:35:06,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:35:06,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:35:06,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:06,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:35:06,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:35:06,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:35:06,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 281 transitions, 3687 flow. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:06,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:06,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:35:06,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:06,941 INFO L130 PetriNetUnfolder]: 2132/3894 cut-off events. [2022-12-06 05:35:06,942 INFO L131 PetriNetUnfolder]: For 31195/31195 co-relation queries the response was YES. [2022-12-06 05:35:06,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23110 conditions, 3894 events. 2132/3894 cut-off events. For 31195/31195 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 23664 event pairs, 329 based on Foata normal form. 208/4102 useless extension candidates. Maximal degree in co-relation 23014. Up to 1202 conditions per place. [2022-12-06 05:35:06,968 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 266 selfloop transitions, 134 changer transitions 24/424 dead transitions. [2022-12-06 05:35:06,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 424 transitions, 6111 flow [2022-12-06 05:35:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:35:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:35:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-06 05:35:06,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-06 05:35:06,969 INFO L175 Difference]: Start difference. First operand has 107 places, 281 transitions, 3687 flow. Second operand 8 states and 114 transitions. [2022-12-06 05:35:06,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 424 transitions, 6111 flow [2022-12-06 05:35:07,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 424 transitions, 5901 flow, removed 104 selfloop flow, removed 4 redundant places. [2022-12-06 05:35:07,109 INFO L231 Difference]: Finished difference. Result has 112 places, 280 transitions, 4080 flow [2022-12-06 05:35:07,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2898, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4080, PETRI_PLACES=112, PETRI_TRANSITIONS=280} [2022-12-06 05:35:07,110 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 87 predicate places. [2022-12-06 05:35:07,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:07,110 INFO L89 Accepts]: Start accepts. Operand has 112 places, 280 transitions, 4080 flow [2022-12-06 05:35:07,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:07,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:07,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 280 transitions, 4080 flow [2022-12-06 05:35:07,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 280 transitions, 4080 flow [2022-12-06 05:35:07,243 INFO L130 PetriNetUnfolder]: 487/1396 cut-off events. [2022-12-06 05:35:07,243 INFO L131 PetriNetUnfolder]: For 11056/11123 co-relation queries the response was YES. [2022-12-06 05:35:07,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8302 conditions, 1396 events. 487/1396 cut-off events. For 11056/11123 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10150 event pairs, 11 based on Foata normal form. 14/1392 useless extension candidates. Maximal degree in co-relation 7698. Up to 448 conditions per place. [2022-12-06 05:35:07,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 280 transitions, 4080 flow [2022-12-06 05:35:07,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 974 [2022-12-06 05:35:07,258 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] $Ultimate##0-->L79: Formula: (and (= (ite (= (ite (and (<= v_~new~0_66 v_~v_old~0_93) (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_298| v_~queue~0.base_124) (+ v_~queue~0.offset_125 (* v_~start~0_158 4)))) (= (ite (= (ite (or (< v_~i~0_198 v_~N~0_169) (< v_~start~0_157 v_~end~0_214)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_76|) (= |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)) (= v_~start~0_157 (+ v_~start~0_158 1)) (= (ite (and (< v_~start~0_158 v_~end~0_214) (< v_~start~0_158 v_~n~0_123) (<= 0 v_~start~0_158)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~new~0_66 v_~v_old~0_92)) InVars {~start~0=v_~start~0_158, ~queue~0.offset=v_~queue~0.offset_125, ~ok~0=v_~ok~0_101, ~i~0=v_~i~0_198, #memory_int=|v_#memory_int_298|, ~end~0=v_~end~0_214, ~N~0=v_~N~0_169, ~v_old~0=v_~v_old~0_93, ~queue~0.base=v_~queue~0.base_124, ~n~0=v_~n~0_123} OutVars{~start~0=v_~start~0_157, ~new~0=v_~new~0_66, ~queue~0.offset=v_~queue~0.offset_125, ~ok~0=v_~ok~0_100, ~i~0=v_~i~0_198, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~N~0=v_~N~0_169, ~queue~0.base=v_~queue~0.base_124, 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_76|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_298|, ~end~0=v_~end~0_214, ~v_old~0=v_~v_old~0_92, ~n~0=v_~n~0_123} 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 05:35:07,326 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] $Ultimate##0-->L79: Formula: (and (= (ite (= (ite (and (<= v_~new~0_66 v_~v_old~0_93) (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_298| v_~queue~0.base_124) (+ v_~queue~0.offset_125 (* v_~start~0_158 4)))) (= (ite (= (ite (or (< v_~i~0_198 v_~N~0_169) (< v_~start~0_157 v_~end~0_214)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_76|) (= |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)) (= v_~start~0_157 (+ v_~start~0_158 1)) (= (ite (and (< v_~start~0_158 v_~end~0_214) (< v_~start~0_158 v_~n~0_123) (<= 0 v_~start~0_158)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~new~0_66 v_~v_old~0_92)) InVars {~start~0=v_~start~0_158, ~queue~0.offset=v_~queue~0.offset_125, ~ok~0=v_~ok~0_101, ~i~0=v_~i~0_198, #memory_int=|v_#memory_int_298|, ~end~0=v_~end~0_214, ~N~0=v_~N~0_169, ~v_old~0=v_~v_old~0_93, ~queue~0.base=v_~queue~0.base_124, ~n~0=v_~n~0_123} OutVars{~start~0=v_~start~0_157, ~new~0=v_~new~0_66, ~queue~0.offset=v_~queue~0.offset_125, ~ok~0=v_~ok~0_100, ~i~0=v_~i~0_198, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~N~0=v_~N~0_169, ~queue~0.base=v_~queue~0.base_124, 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_76|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_298|, ~end~0=v_~end~0_214, ~v_old~0=v_~v_old~0_92, ~n~0=v_~n~0_123} 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 05:35:07,397 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:35:07,485 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:35:07,570 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:35:07,660 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 (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< 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 05:35:07,710 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_thread1Thread1of1ForFork0_#t~mem1#1_25| v_~last~0_20)) (< 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 05:35:07,781 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:35:07,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 672 [2022-12-06 05:35:07,782 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 279 transitions, 4124 flow [2022-12-06 05:35:07,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:07,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:07,783 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 05:35:07,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:35:07,989 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 05:35:07,989 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 05:35:07,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:07,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1504779699, now seen corresponding path program 1 times [2022-12-06 05:35:07,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:07,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303405503] [2022-12-06 05:35:07,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:07,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:09,310 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 05:35:09,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:09,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303405503] [2022-12-06 05:35:09,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303405503] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:09,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497257600] [2022-12-06 05:35:09,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:09,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:09,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:09,328 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 05:35:09,330 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 05:35:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:09,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 05:35:09,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:09,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:35:09,628 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 05:35:09,628 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 05:35:09,635 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 05:35:09,739 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 05:35:09,766 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 05:35:09,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:10,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:10,101 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 05:35:10,108 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 05:35:10,392 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 05:35:10,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497257600] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:35:10,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:35:10,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 05:35:10,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846303207] [2022-12-06 05:35:10,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:35:10,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 05:35:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:10,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 05:35:10,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=425, Unknown=2, NotChecked=0, Total=552 [2022-12-06 05:35:10,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:35:10,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 279 transitions, 4124 flow. Second operand has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 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 05:35:10,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:10,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:35:10,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:17,856 INFO L130 PetriNetUnfolder]: 4396/7976 cut-off events. [2022-12-06 05:35:17,856 INFO L131 PetriNetUnfolder]: For 63203/63203 co-relation queries the response was YES. [2022-12-06 05:35:17,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50361 conditions, 7976 events. 4396/7976 cut-off events. For 63203/63203 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 53448 event pairs, 395 based on Foata normal form. 32/7972 useless extension candidates. Maximal degree in co-relation 40851. Up to 2418 conditions per place. [2022-12-06 05:35:17,905 INFO L137 encePairwiseOnDemand]: 9/42 looper letters, 555 selfloop transitions, 442 changer transitions 104/1101 dead transitions. [2022-12-06 05:35:17,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1101 transitions, 16198 flow [2022-12-06 05:35:17,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-06 05:35:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-12-06 05:35:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 492 transitions. [2022-12-06 05:35:17,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2210242587601078 [2022-12-06 05:35:17,908 INFO L175 Difference]: Start difference. First operand has 111 places, 279 transitions, 4124 flow. Second operand 53 states and 492 transitions. [2022-12-06 05:35:17,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1101 transitions, 16198 flow [2022-12-06 05:35:18,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 1101 transitions, 16048 flow, removed 75 selfloop flow, removed 0 redundant places. [2022-12-06 05:35:18,257 INFO L231 Difference]: Finished difference. Result has 199 places, 587 transitions, 10215 flow [2022-12-06 05:35:18,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4086, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=10215, PETRI_PLACES=199, PETRI_TRANSITIONS=587} [2022-12-06 05:35:18,257 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 174 predicate places. [2022-12-06 05:35:18,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:18,257 INFO L89 Accepts]: Start accepts. Operand has 199 places, 587 transitions, 10215 flow [2022-12-06 05:35:18,260 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:18,260 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:18,260 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 587 transitions, 10215 flow [2022-12-06 05:35:18,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 587 transitions, 10215 flow [2022-12-06 05:35:18,662 INFO L130 PetriNetUnfolder]: 964/2635 cut-off events. [2022-12-06 05:35:18,662 INFO L131 PetriNetUnfolder]: For 41020/41145 co-relation queries the response was YES. [2022-12-06 05:35:18,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19748 conditions, 2635 events. 964/2635 cut-off events. For 41020/41145 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 21144 event pairs, 10 based on Foata normal form. 23/2632 useless extension candidates. Maximal degree in co-relation 19470. Up to 925 conditions per place. [2022-12-06 05:35:18,699 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 587 transitions, 10215 flow [2022-12-06 05:35:18,699 INFO L188 LiptonReduction]: Number of co-enabled transitions 2018 [2022-12-06 05:35:18,836 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 05:35:18,852 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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 05:35:18,887 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 (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:35:18,983 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 (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:35:19,105 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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 05:35:19,193 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 (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:35:19,310 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 05:35:19,376 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 (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:35:19,461 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 (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:35:19,570 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 (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:35:19,673 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 (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:35:19,791 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 (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:35:19,912 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 05:35:19,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 [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:35:20,040 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 (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:35:21,897 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 05:35:21,898 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3641 [2022-12-06 05:35:21,898 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 581 transitions, 10293 flow [2022-12-06 05:35:21,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 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 05:35:21,898 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:21,899 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 05:35:21,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:35:22,103 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 05:35:22,104 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 05:35:22,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:22,104 INFO L85 PathProgramCache]: Analyzing trace with hash 821817002, now seen corresponding path program 1 times [2022-12-06 05:35:22,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:22,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177803381] [2022-12-06 05:35:22,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:22,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:23,205 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 05:35:23,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:23,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177803381] [2022-12-06 05:35:23,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177803381] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:23,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054754739] [2022-12-06 05:35:23,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:23,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:23,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:23,207 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 05:35:23,211 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 05:35:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:23,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 05:35:23,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:23,563 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-06 05:35:23,564 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 05:35:23,589 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 05:35:23,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:25,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:25,844 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 05:35:25,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 05:35:25,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054754739] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:35:25,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:35:25,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2022-12-06 05:35:25,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624732092] [2022-12-06 05:35:25,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:35:25,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 05:35:25,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:25,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 05:35:25,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2022-12-06 05:35:25,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 05:35:25,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 581 transitions, 10293 flow. Second operand has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 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 05:35:25,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:25,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 05:35:25,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:29,609 INFO L130 PetriNetUnfolder]: 6069/10734 cut-off events. [2022-12-06 05:35:29,609 INFO L131 PetriNetUnfolder]: For 162793/162793 co-relation queries the response was YES. [2022-12-06 05:35:29,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83850 conditions, 10734 events. 6069/10734 cut-off events. For 162793/162793 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 75796 event pairs, 600 based on Foata normal form. 13/10727 useless extension candidates. Maximal degree in co-relation 83551. Up to 3873 conditions per place. [2022-12-06 05:35:29,700 INFO L137 encePairwiseOnDemand]: 21/68 looper letters, 479 selfloop transitions, 492 changer transitions 35/1006 dead transitions. [2022-12-06 05:35:29,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 1006 transitions, 18904 flow [2022-12-06 05:35:29,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:35:29,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:35:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 213 transitions. [2022-12-06 05:35:29,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1957720588235294 [2022-12-06 05:35:29,702 INFO L175 Difference]: Start difference. First operand has 189 places, 581 transitions, 10293 flow. Second operand 16 states and 213 transitions. [2022-12-06 05:35:29,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 1006 transitions, 18904 flow [2022-12-06 05:35:31,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 1006 transitions, 17955 flow, removed 470 selfloop flow, removed 9 redundant places. [2022-12-06 05:35:31,139 INFO L231 Difference]: Finished difference. Result has 207 places, 792 transitions, 15194 flow [2022-12-06 05:35:31,140 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=9650, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=283, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=15194, PETRI_PLACES=207, PETRI_TRANSITIONS=792} [2022-12-06 05:35:31,143 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 182 predicate places. [2022-12-06 05:35:31,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:31,143 INFO L89 Accepts]: Start accepts. Operand has 207 places, 792 transitions, 15194 flow [2022-12-06 05:35:31,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:31,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:31,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 792 transitions, 15194 flow [2022-12-06 05:35:31,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 792 transitions, 15194 flow [2022-12-06 05:35:31,824 INFO L130 PetriNetUnfolder]: 1444/3761 cut-off events. [2022-12-06 05:35:31,824 INFO L131 PetriNetUnfolder]: For 66002/66121 co-relation queries the response was YES. [2022-12-06 05:35:31,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29970 conditions, 3761 events. 1444/3761 cut-off events. For 66002/66121 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 32321 event pairs, 12 based on Foata normal form. 25/3764 useless extension candidates. Maximal degree in co-relation 29808. Up to 1369 conditions per place. [2022-12-06 05:35:31,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 792 transitions, 15194 flow [2022-12-06 05:35:31,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 2850 [2022-12-06 05:35:36,503 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 05:35:36,517 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 05:35:36,641 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:35:36,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5499 [2022-12-06 05:35:36,642 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 791 transitions, 15281 flow [2022-12-06 05:35:36,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 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 05:35:36,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:36,643 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 05:35:36,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 05:35:36,843 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 05:35:36,844 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 05:35:36,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash -138724916, now seen corresponding path program 1 times [2022-12-06 05:35:36,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:36,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797590565] [2022-12-06 05:35:36,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:36,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:37,832 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 05:35:37,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:37,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797590565] [2022-12-06 05:35:37,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797590565] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:37,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872557432] [2022-12-06 05:35:37,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:37,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:37,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:37,834 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 05:35:37,835 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 05:35:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:37,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 05:35:37,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:38,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:35:38,085 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 05:35:38,085 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 05:35:38,092 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 05:35:38,194 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 05:35:38,209 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 05:35:38,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:38,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:38,481 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 05:35:38,487 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 05:35:38,662 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 05:35:38,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872557432] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:35:38,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:35:38,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 05:35:38,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835579675] [2022-12-06 05:35:38,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:35:38,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 05:35:38,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:38,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 05:35:38,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=383, Unknown=1, NotChecked=0, Total=506 [2022-12-06 05:35:38,665 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 05:35:38,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 791 transitions, 15281 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 05:35:38,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:38,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 05:35:38,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:43,198 INFO L130 PetriNetUnfolder]: 7840/13744 cut-off events. [2022-12-06 05:35:43,199 INFO L131 PetriNetUnfolder]: For 239113/239113 co-relation queries the response was YES. [2022-12-06 05:35:43,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113152 conditions, 13744 events. 7840/13744 cut-off events. For 239113/239113 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 100383 event pairs, 1076 based on Foata normal form. 13/13735 useless extension candidates. Maximal degree in co-relation 112969. Up to 4904 conditions per place. [2022-12-06 05:35:43,350 INFO L137 encePairwiseOnDemand]: 26/74 looper letters, 414 selfloop transitions, 687 changer transitions 30/1131 dead transitions. [2022-12-06 05:35:43,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 1131 transitions, 23424 flow [2022-12-06 05:35:43,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:35:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:35:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 184 transitions. [2022-12-06 05:35:43,351 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2072072072072072 [2022-12-06 05:35:43,351 INFO L175 Difference]: Start difference. First operand has 205 places, 791 transitions, 15281 flow. Second operand 12 states and 184 transitions. [2022-12-06 05:35:43,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 1131 transitions, 23424 flow [2022-12-06 05:35:45,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 1131 transitions, 23009 flow, removed 166 selfloop flow, removed 5 redundant places. [2022-12-06 05:35:45,838 INFO L231 Difference]: Finished difference. Result has 219 places, 992 transitions, 21632 flow [2022-12-06 05:35:45,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=15003, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=486, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=21632, PETRI_PLACES=219, PETRI_TRANSITIONS=992} [2022-12-06 05:35:45,839 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 194 predicate places. [2022-12-06 05:35:45,839 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:45,839 INFO L89 Accepts]: Start accepts. Operand has 219 places, 992 transitions, 21632 flow [2022-12-06 05:35:45,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:45,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:45,844 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 992 transitions, 21632 flow [2022-12-06 05:35:45,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 992 transitions, 21632 flow [2022-12-06 05:35:46,861 INFO L130 PetriNetUnfolder]: 1905/4863 cut-off events. [2022-12-06 05:35:46,861 INFO L131 PetriNetUnfolder]: For 103324/103452 co-relation queries the response was YES. [2022-12-06 05:35:46,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42001 conditions, 4863 events. 1905/4863 cut-off events. For 103324/103452 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 43039 event pairs, 9 based on Foata normal form. 15/4854 useless extension candidates. Maximal degree in co-relation 41911. Up to 1796 conditions per place. [2022-12-06 05:35:46,946 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 992 transitions, 21632 flow [2022-12-06 05:35:46,946 INFO L188 LiptonReduction]: Number of co-enabled transitions 3674 [2022-12-06 05:35:47,801 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:35:47,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1963 [2022-12-06 05:35:47,802 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 992 transitions, 21656 flow [2022-12-06 05:35:47,802 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 05:35:47,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:47,803 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 05:35:47,809 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 05:35:48,007 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 05:35:48,007 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 05:35:48,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:48,008 INFO L85 PathProgramCache]: Analyzing trace with hash -556511716, now seen corresponding path program 1 times [2022-12-06 05:35:48,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:48,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686633458] [2022-12-06 05:35:48,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:48,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:49,285 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 05:35:49,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:49,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686633458] [2022-12-06 05:35:49,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686633458] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:49,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585765182] [2022-12-06 05:35:49,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:49,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:49,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:49,287 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 05:35:49,288 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 05:35:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:49,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 05:35:49,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:49,462 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 05:35:49,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:35:49,468 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 05:35:49,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:35:49,532 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 05:35:49,707 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-06 05:35:49,707 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 05:35:49,726 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 05:35:49,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:54,210 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:54,210 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 05:35:54,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:54,286 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 873 treesize of output 897 [2022-12-06 05:35:54,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:54,321 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 744 treesize of output 693 [2022-12-06 05:35:54,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:54,373 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 652 treesize of output 645 [2022-12-06 05:35:54,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:54,412 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 566 treesize of output 501 [2022-12-06 05:36:48,358 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 05:36:48,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585765182] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:36:48,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:36:48,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 05:36:48,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769636380] [2022-12-06 05:36:48,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:36:48,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 05:36:48,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:48,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 05:36:48,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=288, Unknown=3, NotChecked=0, Total=380 [2022-12-06 05:36:48,359 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 05:36:48,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 992 transitions, 21656 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 05:36:48,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:48,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 05:36:48,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:55,246 INFO L130 PetriNetUnfolder]: 10107/17711 cut-off events. [2022-12-06 05:36:55,246 INFO L131 PetriNetUnfolder]: For 369779/369779 co-relation queries the response was YES. [2022-12-06 05:36:55,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156654 conditions, 17711 events. 10107/17711 cut-off events. For 369779/369779 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 134304 event pairs, 1067 based on Foata normal form. 24/17713 useless extension candidates. Maximal degree in co-relation 153925. Up to 7593 conditions per place. [2022-12-06 05:36:55,438 INFO L137 encePairwiseOnDemand]: 31/75 looper letters, 731 selfloop transitions, 671 changer transitions 29/1431 dead transitions. [2022-12-06 05:36:55,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 1431 transitions, 32716 flow [2022-12-06 05:36:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:36:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:36:55,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 225 transitions. [2022-12-06 05:36:55,444 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1875 [2022-12-06 05:36:55,444 INFO L175 Difference]: Start difference. First operand has 218 places, 992 transitions, 21656 flow. Second operand 16 states and 225 transitions. [2022-12-06 05:36:55,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 1431 transitions, 32716 flow [2022-12-06 05:36:59,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 1431 transitions, 32407 flow, removed 134 selfloop flow, removed 5 redundant places. [2022-12-06 05:36:59,629 INFO L231 Difference]: Finished difference. Result has 236 places, 1209 transitions, 28756 flow [2022-12-06 05:36:59,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=21273, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=454, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=28756, PETRI_PLACES=236, PETRI_TRANSITIONS=1209} [2022-12-06 05:36:59,631 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 211 predicate places. [2022-12-06 05:36:59,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:59,631 INFO L89 Accepts]: Start accepts. Operand has 236 places, 1209 transitions, 28756 flow [2022-12-06 05:36:59,636 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:59,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:59,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 1209 transitions, 28756 flow [2022-12-06 05:36:59,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 1209 transitions, 28756 flow [2022-12-06 05:37:01,016 INFO L130 PetriNetUnfolder]: 2504/6418 cut-off events. [2022-12-06 05:37:01,016 INFO L131 PetriNetUnfolder]: For 149478/149661 co-relation queries the response was YES. [2022-12-06 05:37:01,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58253 conditions, 6418 events. 2504/6418 cut-off events. For 149478/149661 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 60474 event pairs, 10 based on Foata normal form. 27/6408 useless extension candidates. Maximal degree in co-relation 57065. Up to 2330 conditions per place. [2022-12-06 05:37:01,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 1209 transitions, 28756 flow [2022-12-06 05:37:01,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 4574 [2022-12-06 05:37:03,969 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:03,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4339 [2022-12-06 05:37:03,970 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 1209 transitions, 28788 flow [2022-12-06 05:37:03,970 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 05:37:03,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:03,970 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 05:37:03,975 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 05:37:04,173 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 05:37:04,174 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 05:37:04,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:04,175 INFO L85 PathProgramCache]: Analyzing trace with hash -188284376, now seen corresponding path program 2 times [2022-12-06 05:37:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:04,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386009154] [2022-12-06 05:37:04,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:04,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:05,182 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 05:37:05,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:05,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386009154] [2022-12-06 05:37:05,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386009154] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:05,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20962858] [2022-12-06 05:37:05,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:37:05,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:05,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:05,184 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 05:37:05,189 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 05:37:05,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:37:05,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:37:05,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 05:37:05,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:05,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:37:05,509 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 05:37:05,509 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 05:37:05,520 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 05:37:05,594 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 05:37:05,612 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 05:37:05,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:05,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:05,882 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 05:37:05,888 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 05:37:06,058 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 05:37:06,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20962858] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:06,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:06,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 05:37:06,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975403049] [2022-12-06 05:37:06,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:06,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 05:37:06,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:06,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 05:37:06,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=428, Unknown=1, NotChecked=0, Total=552 [2022-12-06 05:37:06,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 05:37:06,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 1209 transitions, 28788 flow. Second operand has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 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 05:37:06,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:06,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 05:37:06,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:14,826 INFO L130 PetriNetUnfolder]: 11919/20749 cut-off events. [2022-12-06 05:37:14,826 INFO L131 PetriNetUnfolder]: For 489721/489721 co-relation queries the response was YES. [2022-12-06 05:37:14,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194071 conditions, 20749 events. 11919/20749 cut-off events. For 489721/489721 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 160980 event pairs, 900 based on Foata normal form. 13/20740 useless extension candidates. Maximal degree in co-relation 190462. Up to 7193 conditions per place. [2022-12-06 05:37:15,098 INFO L137 encePairwiseOnDemand]: 25/74 looper letters, 615 selfloop transitions, 983 changer transitions 38/1636 dead transitions. [2022-12-06 05:37:15,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 1636 transitions, 40433 flow [2022-12-06 05:37:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 05:37:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 05:37:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 246 transitions. [2022-12-06 05:37:15,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17496443812233287 [2022-12-06 05:37:15,101 INFO L175 Difference]: Start difference. First operand has 235 places, 1209 transitions, 28788 flow. Second operand 19 states and 246 transitions. [2022-12-06 05:37:15,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 1636 transitions, 40433 flow [2022-12-06 05:37:22,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 1636 transitions, 40113 flow, removed 143 selfloop flow, removed 3 redundant places. [2022-12-06 05:37:22,276 INFO L231 Difference]: Finished difference. Result has 260 places, 1388 transitions, 36598 flow [2022-12-06 05:37:22,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=28544, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=804, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=36598, PETRI_PLACES=260, PETRI_TRANSITIONS=1388} [2022-12-06 05:37:22,278 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 235 predicate places. [2022-12-06 05:37:22,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:22,278 INFO L89 Accepts]: Start accepts. Operand has 260 places, 1388 transitions, 36598 flow [2022-12-06 05:37:22,284 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:22,284 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:22,284 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 260 places, 1388 transitions, 36598 flow [2022-12-06 05:37:22,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 1388 transitions, 36598 flow [2022-12-06 05:37:24,222 INFO L130 PetriNetUnfolder]: 2941/7479 cut-off events. [2022-12-06 05:37:24,222 INFO L131 PetriNetUnfolder]: For 204062/204307 co-relation queries the response was YES. [2022-12-06 05:37:24,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71425 conditions, 7479 events. 2941/7479 cut-off events. For 204062/204307 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 72245 event pairs, 23 based on Foata normal form. 34/7471 useless extension candidates. Maximal degree in co-relation 71259. Up to 2761 conditions per place. [2022-12-06 05:37:24,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 1388 transitions, 36598 flow [2022-12-06 05:37:24,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 5398 [2022-12-06 05:37:24,364 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:24,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2088 [2022-12-06 05:37:24,366 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 1388 transitions, 36598 flow [2022-12-06 05:37:24,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 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 05:37:24,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:24,367 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 05:37:24,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-06 05:37:24,574 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 05:37:24,574 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 05:37:24,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:24,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1893620340, now seen corresponding path program 1 times [2022-12-06 05:37:24,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:24,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091222641] [2022-12-06 05:37:24,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:24,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:24,629 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 05:37:24,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:24,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091222641] [2022-12-06 05:37:24,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091222641] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:24,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026609452] [2022-12-06 05:37:24,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:24,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:24,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:24,631 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 05:37:24,635 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 05:37:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:24,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:37:24,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:24,784 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 05:37:24,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:24,815 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 05:37:24,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026609452] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:24,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:24,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 05:37:24,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80416815] [2022-12-06 05:37:24,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:24,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:37:24,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:24,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:37:24,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:37:24,817 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 05:37:24,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 1388 transitions, 36598 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 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 05:37:24,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:24,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 05:37:24,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:33,913 INFO L130 PetriNetUnfolder]: 12727/22120 cut-off events. [2022-12-06 05:37:33,914 INFO L131 PetriNetUnfolder]: For 610682/610682 co-relation queries the response was YES. [2022-12-06 05:37:34,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217788 conditions, 22120 events. 12727/22120 cut-off events. For 610682/610682 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 173029 event pairs, 1188 based on Foata normal form. 124/22228 useless extension candidates. Maximal degree in co-relation 217601. Up to 10562 conditions per place. [2022-12-06 05:37:34,216 INFO L137 encePairwiseOnDemand]: 36/74 looper letters, 1499 selfloop transitions, 216 changer transitions 1/1716 dead transitions. [2022-12-06 05:37:34,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 1716 transitions, 47827 flow [2022-12-06 05:37:34,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2022-12-06 05:37:34,217 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2702702702702703 [2022-12-06 05:37:34,218 INFO L175 Difference]: Start difference. First operand has 259 places, 1388 transitions, 36598 flow. Second operand 7 states and 140 transitions. [2022-12-06 05:37:34,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 1716 transitions, 47827 flow [2022-12-06 05:37:42,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 1716 transitions, 46253 flow, removed 176 selfloop flow, removed 5 redundant places. [2022-12-06 05:37:42,745 INFO L231 Difference]: Finished difference. Result has 262 places, 1458 transitions, 37313 flow [2022-12-06 05:37:42,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=35259, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=37313, PETRI_PLACES=262, PETRI_TRANSITIONS=1458} [2022-12-06 05:37:42,747 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 237 predicate places. [2022-12-06 05:37:42,747 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:42,747 INFO L89 Accepts]: Start accepts. Operand has 262 places, 1458 transitions, 37313 flow [2022-12-06 05:37:42,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:42,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:42,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 262 places, 1458 transitions, 37313 flow [2022-12-06 05:37:42,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 262 places, 1458 transitions, 37313 flow [2022-12-06 05:37:44,733 INFO L130 PetriNetUnfolder]: 3175/8043 cut-off events. [2022-12-06 05:37:44,733 INFO L131 PetriNetUnfolder]: For 235888/236255 co-relation queries the response was YES. [2022-12-06 05:37:44,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79515 conditions, 8043 events. 3175/8043 cut-off events. For 235888/236255 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 78782 event pairs, 32 based on Foata normal form. 46/8040 useless extension candidates. Maximal degree in co-relation 78126. Up to 2987 conditions per place. [2022-12-06 05:37:44,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 262 places, 1458 transitions, 37313 flow [2022-12-06 05:37:44,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 5592 [2022-12-06 05:37:44,913 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [741] L54-->L59: Formula: (and (= v_~last~0_157 (select (select |v_#memory_int_396| v_~A~0.base_204) (+ v_~A~0.offset_204 (* v_~i~0_318 4)))) (= (+ v_~i~0_318 1) v_~i~0_317)) InVars {~A~0.base=v_~A~0.base_204, ~A~0.offset=v_~A~0.offset_204, ~i~0=v_~i~0_318, #memory_int=|v_#memory_int_396|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_137|, ~A~0.base=v_~A~0.base_204, ~A~0.offset=v_~A~0.offset_204, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_72|, ~i~0=v_~i~0_317, #memory_int=|v_#memory_int_396|, ~last~0=v_~last~0_157} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0, ~last~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 05:37:53,382 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:53,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10636 [2022-12-06 05:37:53,383 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 1458 transitions, 37341 flow [2022-12-06 05:37:53,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 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 05:37:53,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:53,383 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 05:37:53,389 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 05:37:53,586 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 05:37:53,586 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 05:37:53,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:53,587 INFO L85 PathProgramCache]: Analyzing trace with hash 205909963, now seen corresponding path program 1 times [2022-12-06 05:37:53,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:53,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874020012] [2022-12-06 05:37:53,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:53,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:53,667 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 05:37:53,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:53,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874020012] [2022-12-06 05:37:53,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874020012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:53,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:53,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:53,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168201744] [2022-12-06 05:37:53,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:53,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:37:53,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:53,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:37:53,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:37:53,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 77 [2022-12-06 05:37:53,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 1458 transitions, 37341 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:53,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:53,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 77 [2022-12-06 05:37:53,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:02,385 INFO L130 PetriNetUnfolder]: 12904/22605 cut-off events. [2022-12-06 05:38:02,385 INFO L131 PetriNetUnfolder]: For 646758/646758 co-relation queries the response was YES. [2022-12-06 05:38:02,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223450 conditions, 22605 events. 12904/22605 cut-off events. For 646758/646758 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 179184 event pairs, 1124 based on Foata normal form. 18/22621 useless extension candidates. Maximal degree in co-relation 219803. Up to 19160 conditions per place. [2022-12-06 05:38:02,826 INFO L137 encePairwiseOnDemand]: 61/77 looper letters, 1477 selfloop transitions, 82 changer transitions 20/1579 dead transitions. [2022-12-06 05:38:02,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 1579 transitions, 42843 flow [2022-12-06 05:38:02,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:38:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:38:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-12-06 05:38:02,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4025974025974026 [2022-12-06 05:38:02,828 INFO L175 Difference]: Start difference. First operand has 262 places, 1458 transitions, 37341 flow. Second operand 3 states and 93 transitions. [2022-12-06 05:38:02,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 1579 transitions, 42843 flow [2022-12-06 05:38:11,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 1579 transitions, 42600 flow, removed 110 selfloop flow, removed 2 redundant places. [2022-12-06 05:38:11,926 INFO L231 Difference]: Finished difference. Result has 264 places, 1463 transitions, 37536 flow [2022-12-06 05:38:11,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=36889, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=37536, PETRI_PLACES=264, PETRI_TRANSITIONS=1463} [2022-12-06 05:38:11,928 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 239 predicate places. [2022-12-06 05:38:11,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:11,928 INFO L89 Accepts]: Start accepts. Operand has 264 places, 1463 transitions, 37536 flow [2022-12-06 05:38:11,935 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:11,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:11,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 1463 transitions, 37536 flow [2022-12-06 05:38:11,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 1463 transitions, 37536 flow [2022-12-06 05:38:13,966 INFO L130 PetriNetUnfolder]: 3313/8564 cut-off events. [2022-12-06 05:38:13,967 INFO L131 PetriNetUnfolder]: For 248870/249437 co-relation queries the response was YES. [2022-12-06 05:38:14,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82429 conditions, 8564 events. 3313/8564 cut-off events. For 248870/249437 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 85733 event pairs, 42 based on Foata normal form. 42/8513 useless extension candidates. Maximal degree in co-relation 80975. Up to 3021 conditions per place. [2022-12-06 05:38:14,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 264 places, 1463 transitions, 37536 flow [2022-12-06 05:38:14,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 5568 [2022-12-06 05:38:14,143 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:14,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2216 [2022-12-06 05:38:14,144 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 1463 transitions, 37536 flow [2022-12-06 05:38:14,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:14,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:14,144 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 05:38:14,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:38:14,144 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 05:38:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:14,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1431148030, now seen corresponding path program 1 times [2022-12-06 05:38:14,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:14,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315073209] [2022-12-06 05:38:14,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:14,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:16,069 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 05:38:16,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:16,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315073209] [2022-12-06 05:38:16,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315073209] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:38:16,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302593599] [2022-12-06 05:38:16,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:16,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:16,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:38:16,071 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 05:38:16,072 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 05:38:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:16,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 05:38:16,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:38:16,184 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 05:38:16,294 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 05:38:16,494 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 05:38:16,517 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 05:38:16,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:38:16,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:16,869 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 05:38:16,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:16,890 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 05:38:16,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:16,904 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 05:38:17,491 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 05:38:17,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302593599] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:38:17,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:38:17,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 05:38:17,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154958634] [2022-12-06 05:38:17,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:38:17,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 05:38:17,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:17,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 05:38:17,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=435, Unknown=3, NotChecked=0, Total=552 [2022-12-06 05:38:17,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 05:38:17,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 1463 transitions, 37536 flow. Second operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 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 05:38:17,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:17,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 05:38:17,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:30,525 INFO L130 PetriNetUnfolder]: 15777/27609 cut-off events. [2022-12-06 05:38:30,525 INFO L131 PetriNetUnfolder]: For 803030/803030 co-relation queries the response was YES. [2022-12-06 05:38:30,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275198 conditions, 27609 events. 15777/27609 cut-off events. For 803030/803030 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 225788 event pairs, 1781 based on Foata normal form. 13/27620 useless extension candidates. Maximal degree in co-relation 270918. Up to 11663 conditions per place. [2022-12-06 05:38:30,908 INFO L137 encePairwiseOnDemand]: 22/74 looper letters, 751 selfloop transitions, 1197 changer transitions 34/1982 dead transitions. [2022-12-06 05:38:30,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 1982 transitions, 52235 flow [2022-12-06 05:38:30,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:38:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:38:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 224 transitions. [2022-12-06 05:38:30,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16816816816816818 [2022-12-06 05:38:30,910 INFO L175 Difference]: Start difference. First operand has 264 places, 1463 transitions, 37536 flow. Second operand 18 states and 224 transitions. [2022-12-06 05:38:30,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 1982 transitions, 52235 flow [2022-12-06 05:38:42,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 1982 transitions, 51991 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 05:38:42,160 INFO L231 Difference]: Finished difference. Result has 290 places, 1710 transitions, 48228 flow [2022-12-06 05:38:42,161 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=37366, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=962, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=48228, PETRI_PLACES=290, PETRI_TRANSITIONS=1710} [2022-12-06 05:38:42,161 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 265 predicate places. [2022-12-06 05:38:42,161 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:42,161 INFO L89 Accepts]: Start accepts. Operand has 290 places, 1710 transitions, 48228 flow [2022-12-06 05:38:42,170 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:42,170 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:42,170 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 290 places, 1710 transitions, 48228 flow [2022-12-06 05:38:42,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 1710 transitions, 48228 flow [2022-12-06 05:38:45,118 INFO L130 PetriNetUnfolder]: 3996/10468 cut-off events. [2022-12-06 05:38:45,119 INFO L131 PetriNetUnfolder]: For 345227/345931 co-relation queries the response was YES. [2022-12-06 05:38:45,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105462 conditions, 10468 events. 3996/10468 cut-off events. For 345227/345931 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 109493 event pairs, 42 based on Foata normal form. 46/10419 useless extension candidates. Maximal degree in co-relation 104651. Up to 3662 conditions per place. [2022-12-06 05:38:45,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 290 places, 1710 transitions, 48228 flow [2022-12-06 05:38:45,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 6668 [2022-12-06 05:38:45,331 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:45,331 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3170 [2022-12-06 05:38:45,331 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 1710 transitions, 48228 flow [2022-12-06 05:38:45,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 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 05:38:45,331 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:45,332 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 05:38:45,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-06 05:38:45,535 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,SelfDestructingSolverStorable17 [2022-12-06 05:38:45,536 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 05:38:45,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:45,536 INFO L85 PathProgramCache]: Analyzing trace with hash 373276120, now seen corresponding path program 1 times [2022-12-06 05:38:45,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:45,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264965208] [2022-12-06 05:38:45,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:45,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:38:45,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:45,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264965208] [2022-12-06 05:38:45,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264965208] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:38:45,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145058637] [2022-12-06 05:38:45,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:45,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:45,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:38:45,600 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 05:38:45,602 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 05:38:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:45,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:38:45,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:38:45,743 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 05:38:45,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:38:45,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145058637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:45,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:38:45,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-06 05:38:45,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714869371] [2022-12-06 05:38:45,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:45,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:38:45,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:45,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:38:45,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:38:45,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 05:38:45,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 1710 transitions, 48228 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 05:38:45,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:45,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 05:38:45,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:56,850 INFO L130 PetriNetUnfolder]: 13060/23166 cut-off events. [2022-12-06 05:38:56,850 INFO L131 PetriNetUnfolder]: For 777151/777151 co-relation queries the response was YES. [2022-12-06 05:38:57,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241113 conditions, 23166 events. 13060/23166 cut-off events. For 777151/777151 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 187078 event pairs, 4666 based on Foata normal form. 268/23432 useless extension candidates. Maximal degree in co-relation 239007. Up to 22140 conditions per place. [2022-12-06 05:38:57,186 INFO L137 encePairwiseOnDemand]: 55/74 looper letters, 1405 selfloop transitions, 6 changer transitions 138/1549 dead transitions. [2022-12-06 05:38:57,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 1549 transitions, 45920 flow [2022-12-06 05:38:57,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:38:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:38:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-06 05:38:57,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2756756756756757 [2022-12-06 05:38:57,187 INFO L175 Difference]: Start difference. First operand has 290 places, 1710 transitions, 48228 flow. Second operand 5 states and 102 transitions. [2022-12-06 05:38:57,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 1549 transitions, 45920 flow [2022-12-06 05:39:07,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 1549 transitions, 45559 flow, removed 149 selfloop flow, removed 6 redundant places. [2022-12-06 05:39:07,296 INFO L231 Difference]: Finished difference. Result has 290 places, 1411 transitions, 38903 flow [2022-12-06 05:39:07,297 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=41652, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=38903, PETRI_PLACES=290, PETRI_TRANSITIONS=1411} [2022-12-06 05:39:07,298 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 265 predicate places. [2022-12-06 05:39:07,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:07,298 INFO L89 Accepts]: Start accepts. Operand has 290 places, 1411 transitions, 38903 flow [2022-12-06 05:39:07,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:07,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:07,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 290 places, 1411 transitions, 38903 flow [2022-12-06 05:39:07,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 1411 transitions, 38903 flow [2022-12-06 05:39:09,723 INFO L130 PetriNetUnfolder]: 3267/8513 cut-off events. [2022-12-06 05:39:09,723 INFO L131 PetriNetUnfolder]: For 276912/277526 co-relation queries the response was YES. [2022-12-06 05:39:09,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86094 conditions, 8513 events. 3267/8513 cut-off events. For 276912/277526 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 85692 event pairs, 37 based on Foata normal form. 40/8484 useless extension candidates. Maximal degree in co-relation 84637. Up to 2970 conditions per place. [2022-12-06 05:39:09,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 1411 transitions, 38903 flow [2022-12-06 05:39:09,916 INFO L188 LiptonReduction]: Number of co-enabled transitions 5396 [2022-12-06 05:39:10,121 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 05:39:10,142 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:39:10,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2844 [2022-12-06 05:39:10,142 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 1410 transitions, 38935 flow [2022-12-06 05:39:10,143 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 05:39:10,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:10,143 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:39:10,149 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 05:39:10,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:39:10,344 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 05:39:10,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:10,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1588988975, now seen corresponding path program 1 times [2022-12-06 05:39:10,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:10,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904692934] [2022-12-06 05:39:10,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:10,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:39:10,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:10,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904692934] [2022-12-06 05:39:10,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904692934] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:39:10,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039244308] [2022-12-06 05:39:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:10,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:39:10,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:39:10,416 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 05:39:10,418 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 05:39:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:10,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:39:10,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:39:10,567 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 05:39:10,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:39:10,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039244308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:10,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:39:10,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-06 05:39:10,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000511512] [2022-12-06 05:39:10,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:10,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:39:10,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:10,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:39:10,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:39:10,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 05:39:10,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 1410 transitions, 38935 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 05:39:10,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:10,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 05:39:10,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:20,380 INFO L130 PetriNetUnfolder]: 12840/22669 cut-off events. [2022-12-06 05:39:20,380 INFO L131 PetriNetUnfolder]: For 753335/753335 co-relation queries the response was YES. [2022-12-06 05:39:20,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236718 conditions, 22669 events. 12840/22669 cut-off events. For 753335/753335 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 181692 event pairs, 4574 based on Foata normal form. 208/22875 useless extension candidates. Maximal degree in co-relation 233104. Up to 21960 conditions per place. [2022-12-06 05:39:20,687 INFO L137 encePairwiseOnDemand]: 63/74 looper letters, 1396 selfloop transitions, 4 changer transitions 97/1497 dead transitions. [2022-12-06 05:39:20,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 1497 transitions, 44115 flow [2022-12-06 05:39:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:39:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:39:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-06 05:39:20,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2810810810810811 [2022-12-06 05:39:20,688 INFO L175 Difference]: Start difference. First operand has 279 places, 1410 transitions, 38935 flow. Second operand 5 states and 104 transitions. [2022-12-06 05:39:20,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 1497 transitions, 44115 flow [2022-12-06 05:39:29,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 1497 transitions, 42409 flow, removed 188 selfloop flow, removed 15 redundant places. [2022-12-06 05:39:29,806 INFO L231 Difference]: Finished difference. Result has 271 places, 1400 transitions, 37072 flow [2022-12-06 05:39:29,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=37157, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=37072, PETRI_PLACES=271, PETRI_TRANSITIONS=1400} [2022-12-06 05:39:29,808 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 246 predicate places. [2022-12-06 05:39:29,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:29,808 INFO L89 Accepts]: Start accepts. Operand has 271 places, 1400 transitions, 37072 flow [2022-12-06 05:39:29,815 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:29,815 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:29,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 271 places, 1400 transitions, 37072 flow [2022-12-06 05:39:29,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 269 places, 1400 transitions, 37072 flow [2022-12-06 05:39:31,872 INFO L130 PetriNetUnfolder]: 3244/8439 cut-off events. [2022-12-06 05:39:31,872 INFO L131 PetriNetUnfolder]: For 251913/252539 co-relation queries the response was YES. [2022-12-06 05:39:31,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83153 conditions, 8439 events. 3244/8439 cut-off events. For 251913/252539 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 84910 event pairs, 37 based on Foata normal form. 44/8412 useless extension candidates. Maximal degree in co-relation 81713. Up to 2960 conditions per place. [2022-12-06 05:39:32,019 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 269 places, 1400 transitions, 37072 flow [2022-12-06 05:39:32,019 INFO L188 LiptonReduction]: Number of co-enabled transitions 5372 [2022-12-06 05:39:32,022 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:32,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2215 [2022-12-06 05:39:32,023 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 1400 transitions, 37072 flow [2022-12-06 05:39:32,023 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 05:39:32,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:32,023 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 05:39:32,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-06 05:39:32,228 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 05:39:32,229 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 05:39:32,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:32,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2115716718, now seen corresponding path program 1 times [2022-12-06 05:39:32,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:32,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235722888] [2022-12-06 05:39:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:32,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:39:32,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:32,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235722888] [2022-12-06 05:39:32,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235722888] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:39:32,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459046048] [2022-12-06 05:39:32,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:32,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:39:32,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:39:32,292 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 05:39:32,294 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 05:39:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:32,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 05:39:32,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:39:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:39:32,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:39:32,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459046048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:32,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:39:32,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 05:39:32,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734969954] [2022-12-06 05:39:32,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:32,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:39:32,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:32,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:39:32,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:39:32,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 05:39:32,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 1400 transitions, 37072 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:32,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:32,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 05:39:32,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:39,876 INFO L130 PetriNetUnfolder]: 10745/18960 cut-off events. [2022-12-06 05:39:39,877 INFO L131 PetriNetUnfolder]: For 582322/582322 co-relation queries the response was YES. [2022-12-06 05:39:40,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194437 conditions, 18960 events. 10745/18960 cut-off events. For 582322/582322 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 146419 event pairs, 3686 based on Foata normal form. 77/19035 useless extension candidates. Maximal degree in co-relation 191373. Up to 16839 conditions per place. [2022-12-06 05:39:40,090 INFO L137 encePairwiseOnDemand]: 66/73 looper letters, 1014 selfloop transitions, 0 changer transitions 254/1268 dead transitions. [2022-12-06 05:39:40,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 1268 transitions, 35510 flow [2022-12-06 05:39:40,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:39:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:39:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-06 05:39:40,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3150684931506849 [2022-12-06 05:39:40,092 INFO L175 Difference]: Start difference. First operand has 269 places, 1400 transitions, 37072 flow. Second operand 4 states and 92 transitions. [2022-12-06 05:39:40,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 1268 transitions, 35510 flow [2022-12-06 05:39:46,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 1268 transitions, 33914 flow, removed 371 selfloop flow, removed 5 redundant places. [2022-12-06 05:39:46,423 INFO L231 Difference]: Finished difference. Result has 266 places, 1014 transitions, 25071 flow [2022-12-06 05:39:46,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=30508, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=25071, PETRI_PLACES=266, PETRI_TRANSITIONS=1014} [2022-12-06 05:39:46,424 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 241 predicate places. [2022-12-06 05:39:46,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:46,424 INFO L89 Accepts]: Start accepts. Operand has 266 places, 1014 transitions, 25071 flow [2022-12-06 05:39:46,429 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:46,429 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:46,429 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 1014 transitions, 25071 flow [2022-12-06 05:39:46,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 1014 transitions, 25071 flow [2022-12-06 05:39:47,748 INFO L130 PetriNetUnfolder]: 2469/6421 cut-off events. [2022-12-06 05:39:47,749 INFO L131 PetriNetUnfolder]: For 180837/181288 co-relation queries the response was YES. [2022-12-06 05:39:47,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60184 conditions, 6421 events. 2469/6421 cut-off events. For 180837/181288 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 61308 event pairs, 26 based on Foata normal form. 9/6378 useless extension candidates. Maximal degree in co-relation 59043. Up to 2250 conditions per place. [2022-12-06 05:39:47,876 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 1014 transitions, 25071 flow [2022-12-06 05:39:47,877 INFO L188 LiptonReduction]: Number of co-enabled transitions 4090 [2022-12-06 05:39:52,776 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 05:39:54,879 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< 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 [695] L101-4-->L54: Formula: (and (= (store |v_#memory_int_261| |v_ULTIMATE.start_main_~#t2~0#1.base_78| (store (select |v_#memory_int_261| |v_ULTIMATE.start_main_~#t2~0#1.base_78|) |v_ULTIMATE.start_main_~#t2~0#1.offset_76| |v_ULTIMATE.start_main_#t~pre17#1_68|)) |v_#memory_int_260|) (= |v_#pthreadsForks_99| (+ |v_#pthreadsForks_100| 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_43| 0)) (= |v_ULTIMATE.start_main_#t~pre17#1_68| |v_#pthreadsForks_100|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_43| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|) (not (= (ite (and (<= 0 v_~end~0_201) (< v_~end~0_201 v_~n~0_113)) 1 0) 0)) (= v_~end~0_200 (+ v_~end~0_201 1)) (= (ite (= (select (select |v_#memory_int_260| v_~queue~0.base_106) (+ v_~queue~0.offset_107 (* v_~end~0_201 4))) (select (select |v_#memory_int_260| v_~A~0.base_130) (+ v_~A~0.offset_130 (* v_~i~0_188 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|)) InVars {~A~0.base=v_~A~0.base_130, ~queue~0.offset=v_~queue~0.offset_107, ~A~0.offset=v_~A~0.offset_130, #pthreadsForks=|v_#pthreadsForks_100|, ~i~0=v_~i~0_188, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_76|, #memory_int=|v_#memory_int_261|, ~end~0=v_~end~0_201, ~queue~0.base=v_~queue~0.base_106, ~n~0=v_~n~0_113, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_78|} OutVars{~A~0.base=v_~A~0.base_130, ~queue~0.offset=v_~queue~0.offset_107, ~i~0=v_~i~0_188, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_76|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_43|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_43|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_68|, ~queue~0.base=v_~queue~0.base_106, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_49|, ~A~0.offset=v_~A~0.offset_130, #pthreadsForks=|v_#pthreadsForks_99|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_43|, #memory_int=|v_#memory_int_260|, ~end~0=v_~end~0_200, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_43|, ~n~0=v_~n~0_113, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_78|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, ULTIMATE.start_main_#t~pre15#1, thread1Thread1of1ForFork0_#t~mem3#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 05:39:55,029 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:39:55,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8605 [2022-12-06 05:39:55,029 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 1010 transitions, 25099 flow [2022-12-06 05:39:55,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:55,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:55,030 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 05:39:55,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 05:39:55,234 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 05:39:55,234 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 05:39:55,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:55,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1293992770, now seen corresponding path program 1 times [2022-12-06 05:39:55,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:55,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445871748] [2022-12-06 05:39:55,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:55,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:39:55,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:55,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445871748] [2022-12-06 05:39:55,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445871748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:55,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:55,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:39:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323645150] [2022-12-06 05:39:55,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:55,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:39:55,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:55,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:39:55,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:39:55,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:39:55,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 1010 transitions, 25099 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 05:39:55,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:55,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:39:55,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:00,395 INFO L130 PetriNetUnfolder]: 8728/15174 cut-off events. [2022-12-06 05:40:00,396 INFO L131 PetriNetUnfolder]: For 433170/433170 co-relation queries the response was YES. [2022-12-06 05:40:00,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148360 conditions, 15174 events. 8728/15174 cut-off events. For 433170/433170 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 112424 event pairs, 624 based on Foata normal form. 4/15177 useless extension candidates. Maximal degree in co-relation 145615. Up to 14670 conditions per place. [2022-12-06 05:40:00,563 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 887 selfloop transitions, 54 changer transitions 1/942 dead transitions. [2022-12-06 05:40:00,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 942 transitions, 25328 flow [2022-12-06 05:40:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:40:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:40:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 05:40:00,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-06 05:40:00,564 INFO L175 Difference]: Start difference. First operand has 232 places, 1010 transitions, 25099 flow. Second operand 4 states and 65 transitions. [2022-12-06 05:40:00,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 942 transitions, 25328 flow [2022-12-06 05:40:03,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 942 transitions, 24095 flow, removed 317 selfloop flow, removed 29 redundant places. [2022-12-06 05:40:03,866 INFO L231 Difference]: Finished difference. Result has 205 places, 919 transitions, 21862 flow [2022-12-06 05:40:03,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=21662, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=865, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=21862, PETRI_PLACES=205, PETRI_TRANSITIONS=919} [2022-12-06 05:40:03,867 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 180 predicate places. [2022-12-06 05:40:03,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:03,867 INFO L89 Accepts]: Start accepts. Operand has 205 places, 919 transitions, 21862 flow [2022-12-06 05:40:03,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:03,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:03,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 919 transitions, 21862 flow [2022-12-06 05:40:03,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 919 transitions, 21862 flow [2022-12-06 05:40:04,894 INFO L130 PetriNetUnfolder]: 2193/5660 cut-off events. [2022-12-06 05:40:04,895 INFO L131 PetriNetUnfolder]: For 124815/125221 co-relation queries the response was YES. [2022-12-06 05:40:04,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46415 conditions, 5660 events. 2193/5660 cut-off events. For 124815/125221 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 53299 event pairs, 22 based on Foata normal form. 17/5627 useless extension candidates. Maximal degree in co-relation 45439. Up to 2036 conditions per place. [2022-12-06 05:40:04,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 919 transitions, 21862 flow [2022-12-06 05:40:04,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 3724 [2022-12-06 05:40:04,979 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:04,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1113 [2022-12-06 05:40:04,980 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 919 transitions, 21862 flow [2022-12-06 05:40:04,980 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 05:40:04,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:04,980 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 05:40:04,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:40:04,980 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 05:40:04,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash 319630209, now seen corresponding path program 1 times [2022-12-06 05:40:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:04,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800329389] [2022-12-06 05:40:04,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:04,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:05,993 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 05:40:05,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:05,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800329389] [2022-12-06 05:40:05,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800329389] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:05,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129057342] [2022-12-06 05:40:05,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:05,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:05,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:05,995 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 05:40:05,996 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 05:40:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:06,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-06 05:40:06,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:06,130 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 05:40:06,141 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 19 treesize of output 23 [2022-12-06 05:40:06,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:40:06,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 05:40:06,367 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 14 treesize of output 16 [2022-12-06 05:40:06,821 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:06,822 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 05:40:06,852 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 05:40:06,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:07,621 WARN L837 $PredicateComparison]: unable to prove that (or (< c_~end~0 0) (<= c_~n~0 (+ c_~end~0 1)) (let ((.cse17 (* c_~start~0 4)) (.cse20 (* c_~end~0 4))) (let ((.cse2 (+ .cse20 c_~queue~0.offset)) (.cse4 (+ .cse20 c_~queue~0.offset 4)) (.cse11 (+ .cse17 c_~queue~0.offset)) (.cse7 (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_~i~0_389 Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse6 .cse7)) (.cse3 (select .cse6 (+ (* v_~i~0_389 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse1 (select .cse5 c_~queue~0.base))) (or (not (= .cse0 (select .cse1 .cse2))) (< .cse0 .cse3) (not (= .cse3 (select .cse1 .cse4))))))))) (forall ((v_~i~0_389 Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse13 .cse7)) (.cse10 (select .cse13 (+ (* v_~i~0_389 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse9 (select .cse12 c_~queue~0.base))) (or (not (= .cse8 (select .cse9 .cse2))) (< .cse8 .cse10) (< (select .cse9 .cse11) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= .cse10 (select .cse9 .cse4)))))))) (forall ((v_~i~0_389 Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse14 (select .cse19 .cse7)) (.cse16 (select .cse19 (+ (* v_~i~0_389 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse15 (select .cse18 c_~queue~0.base))) (or (not (= .cse14 (select .cse15 .cse2))) (< .cse14 .cse16) (not (= .cse16 (select .cse15 .cse4))) (< (select .cse15 (+ .cse17 c_~queue~0.offset 4)) (+ (select .cse15 .cse11) 1))))))))))) is different from false [2022-12-06 05:40:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:07,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129057342] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:07,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:07,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-12-06 05:40:07,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645750929] [2022-12-06 05:40:07,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:07,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 05:40:07,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:07,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 05:40:07,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=525, Unknown=2, NotChecked=48, Total=702 [2022-12-06 05:40:07,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:40:07,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 919 transitions, 21862 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 05:40:07,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:07,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:40:07,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:22,592 INFO L130 PetriNetUnfolder]: 12807/22307 cut-off events. [2022-12-06 05:40:22,593 INFO L131 PetriNetUnfolder]: For 469365/469365 co-relation queries the response was YES. [2022-12-06 05:40:22,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189897 conditions, 22307 events. 12807/22307 cut-off events. For 469365/469365 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 174815 event pairs, 1743 based on Foata normal form. 45/22351 useless extension candidates. Maximal degree in co-relation 182497. Up to 8139 conditions per place. [2022-12-06 05:40:22,948 INFO L137 encePairwiseOnDemand]: 10/49 looper letters, 793 selfloop transitions, 1169 changer transitions 118/2080 dead transitions. [2022-12-06 05:40:22,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 2080 transitions, 45866 flow [2022-12-06 05:40:22,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-06 05:40:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-12-06 05:40:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 496 transitions. [2022-12-06 05:40:22,950 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1533704390847248 [2022-12-06 05:40:22,950 INFO L175 Difference]: Start difference. First operand has 204 places, 919 transitions, 21862 flow. Second operand 66 states and 496 transitions. [2022-12-06 05:40:22,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 2080 transitions, 45866 flow [2022-12-06 05:40:25,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 2080 transitions, 45062 flow, removed 123 selfloop flow, removed 5 redundant places. [2022-12-06 05:40:26,020 INFO L231 Difference]: Finished difference. Result has 307 places, 1609 transitions, 40245 flow [2022-12-06 05:40:26,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=19976, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=871, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=531, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=40245, PETRI_PLACES=307, PETRI_TRANSITIONS=1609} [2022-12-06 05:40:26,021 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 282 predicate places. [2022-12-06 05:40:26,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:26,021 INFO L89 Accepts]: Start accepts. Operand has 307 places, 1609 transitions, 40245 flow [2022-12-06 05:40:26,028 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:26,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:26,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 307 places, 1609 transitions, 40245 flow [2022-12-06 05:40:26,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 304 places, 1609 transitions, 40245 flow [2022-12-06 05:40:28,417 INFO L130 PetriNetUnfolder]: 3449/8616 cut-off events. [2022-12-06 05:40:28,417 INFO L131 PetriNetUnfolder]: For 279961/280363 co-relation queries the response was YES. [2022-12-06 05:40:28,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87761 conditions, 8616 events. 3449/8616 cut-off events. For 279961/280363 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 84104 event pairs, 99 based on Foata normal form. 17/8566 useless extension candidates. Maximal degree in co-relation 87299. Up to 3273 conditions per place. [2022-12-06 05:40:28,737 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 304 places, 1609 transitions, 40245 flow [2022-12-06 05:40:28,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 5906 [2022-12-06 05:40:28,740 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:40:28,828 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:40:28,918 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 [766] L79-->L55-1: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_215| 256) 0)) (= |v_thread2Thread1of1ForFork1_~cond~0#1_214| (ite (= (ite (or (< v_~start~0_299 v_~end~0_340) (< v_~i~0_390 v_~N~0_267)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= v_~last~0_208 |v_thread1Thread1of1ForFork0_#t~mem5#1_174|) (= (+ v_~start~0_300 1) v_~start~0_299) (= (ite (and (< v_~start~0_300 v_~n~0_203) (<= 0 v_~start~0_300) (< v_~start~0_300 v_~end~0_340)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_90|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_90|) (= v_~new~0_144 v_~v_old~0_231) (= (select (select |v_#memory_int_508| v_~A~0.base_247) (+ (* v_~i~0_390 4) v_~A~0.offset_247)) |v_thread1Thread1of1ForFork0_#t~mem5#1_174|) (= v_~new~0_144 (select (select |v_#memory_int_508| v_~queue~0.base_220) (+ (* v_~start~0_300 4) v_~queue~0.offset_221))) (= v_~ok~0_233 (ite (= (ite (and (<= v_~new~0_144 v_~v_old~0_232) (not (= (mod v_~ok~0_234 256) 0))) 1 0) 0) 0 1))) InVars {~start~0=v_~start~0_300, ~A~0.base=v_~A~0.base_247, ~queue~0.offset=v_~queue~0.offset_221, ~ok~0=v_~ok~0_234, ~i~0=v_~i~0_390, ~N~0=v_~N~0_267, ~queue~0.base=v_~queue~0.base_220, ~A~0.offset=v_~A~0.offset_247, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_215|, #memory_int=|v_#memory_int_508|, ~end~0=v_~end~0_340, ~v_old~0=v_~v_old~0_232, ~n~0=v_~n~0_203} OutVars{~start~0=v_~start~0_299, ~new~0=v_~new~0_144, ~A~0.base=v_~A~0.base_247, ~queue~0.offset=v_~queue~0.offset_221, ~ok~0=v_~ok~0_233, ~i~0=v_~i~0_390, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_90|, ~N~0=v_~N~0_267, ~queue~0.base=v_~queue~0.base_220, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_174|, ~A~0.offset=v_~A~0.offset_247, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_90|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_214|, #memory_int=|v_#memory_int_508|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_90|, ~end~0=v_~end~0_340, ~v_old~0=v_~v_old~0_231, ~n~0=v_~n~0_203, ~last~0=v_~last~0_208} 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, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0, ~last~0] [2022-12-06 05:40:29,132 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 [767] L79-->L55-1: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| 0)) (= v_~new~0_146 (select (select |v_#memory_int_510| v_~queue~0.base_222) (+ (* v_~start~0_304 4) v_~queue~0.offset_223))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_92|) (= (ite (and (< v_~start~0_304 v_~n~0_205) (< v_~start~0_304 v_~end~0_342) (<= 0 v_~start~0_304)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_92|) (= (ite (= (ite (and (not (= (mod v_~ok~0_238 256) 0)) (<= v_~new~0_146 v_~v_old~0_236)) 1 0) 0) 0 1) v_~ok~0_237) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_219| 256) 0)) (= v_~last~0_210 |v_thread1Thread1of1ForFork0_#t~mem5#1_176|) (= v_~new~0_146 v_~v_old~0_235) (= (+ v_~start~0_304 1) v_~start~0_303) (= |v_thread2Thread1of1ForFork1_~cond~0#1_218| (ite (= (ite (or (< v_~start~0_303 v_~end~0_342) (< v_~i~0_392 v_~N~0_269)) 1 0) 0) 0 1)) (= (select (select |v_#memory_int_510| v_~A~0.base_249) (+ v_~A~0.offset_249 (* v_~i~0_392 4))) |v_thread1Thread1of1ForFork0_#t~mem5#1_176|)) InVars {~start~0=v_~start~0_304, ~A~0.base=v_~A~0.base_249, ~queue~0.offset=v_~queue~0.offset_223, ~ok~0=v_~ok~0_238, ~i~0=v_~i~0_392, ~N~0=v_~N~0_269, ~queue~0.base=v_~queue~0.base_222, ~A~0.offset=v_~A~0.offset_249, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_219|, #memory_int=|v_#memory_int_510|, ~end~0=v_~end~0_342, ~v_old~0=v_~v_old~0_236, ~n~0=v_~n~0_205} OutVars{~start~0=v_~start~0_303, ~new~0=v_~new~0_146, ~A~0.base=v_~A~0.base_249, ~queue~0.offset=v_~queue~0.offset_223, ~ok~0=v_~ok~0_237, ~i~0=v_~i~0_392, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_92|, ~N~0=v_~N~0_269, ~queue~0.base=v_~queue~0.base_222, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_176|, ~A~0.offset=v_~A~0.offset_249, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_92|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_218|, #memory_int=|v_#memory_int_510|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_92|, ~end~0=v_~end~0_342, ~v_old~0=v_~v_old~0_235, ~n~0=v_~n~0_205, ~last~0=v_~last~0_210} 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, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0, ~last~0] [2022-12-06 05:40:29,337 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 [716] $Ultimate##0-->L79: Formula: (and (= (ite (and (<= 0 v_~start~0_203) (< v_~start~0_203 v_~end~0_250) (< v_~start~0_203 v_~n~0_145)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ v_~start~0_203 1) v_~start~0_202) (= (ite (= (ite (and (not (= (mod v_~ok~0_141 256) 0)) (<= v_~new~0_88 v_~v_old~0_132)) 1 0) 0) 0 1) v_~ok~0_140) (= v_~new~0_88 v_~v_old~0_131) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (= |v_thread2Thread1of1ForFork1_~cond~0#1_123| (ite (= (ite (or (< v_~i~0_247 v_~N~0_197) (< v_~start~0_202 v_~end~0_250)) 1 0) 0) 0 1)) (= v_~new~0_88 (select (select |v_#memory_int_340| v_~queue~0.base_148) (+ (* v_~start~0_203 4) v_~queue~0.offset_149)))) InVars {~start~0=v_~start~0_203, ~queue~0.offset=v_~queue~0.offset_149, ~ok~0=v_~ok~0_141, ~i~0=v_~i~0_247, #memory_int=|v_#memory_int_340|, ~end~0=v_~end~0_250, ~N~0=v_~N~0_197, ~v_old~0=v_~v_old~0_132, ~queue~0.base=v_~queue~0.base_148, ~n~0=v_~n~0_145} OutVars{~start~0=v_~start~0_202, ~new~0=v_~new~0_88, ~queue~0.offset=v_~queue~0.offset_149, ~ok~0=v_~ok~0_140, ~i~0=v_~i~0_247, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, ~N~0=v_~N~0_197, ~queue~0.base=v_~queue~0.base_148, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_45|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_123|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_45|, #memory_int=|v_#memory_int_340|, ~end~0=v_~end~0_250, ~v_old~0=v_~v_old~0_131, ~n~0=v_~n~0_145} 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 05:40:29,518 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 (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:40:29,604 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 (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:40:29,696 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 [717] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_127| (ite (= (ite (or (< v_~i~0_250 v_~N~0_199) (< v_~start~0_206 v_~end~0_252)) 1 0) 0) 0 1)) (= (+ v_~i~0_250 1) v_~i~0_249)) InVars {~start~0=v_~start~0_206, ~i~0=v_~i~0_250, ~end~0=v_~end~0_252, ~N~0=v_~N~0_199} OutVars{~start~0=v_~start~0_206, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_71|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_127|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_52|, ~i~0=v_~i~0_249, ~end~0=v_~end~0_252, ~N~0=v_~N~0_199} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 05:40:29,733 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 [716] $Ultimate##0-->L79: Formula: (and (= (ite (and (<= 0 v_~start~0_203) (< v_~start~0_203 v_~end~0_250) (< v_~start~0_203 v_~n~0_145)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ v_~start~0_203 1) v_~start~0_202) (= (ite (= (ite (and (not (= (mod v_~ok~0_141 256) 0)) (<= v_~new~0_88 v_~v_old~0_132)) 1 0) 0) 0 1) v_~ok~0_140) (= v_~new~0_88 v_~v_old~0_131) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (= |v_thread2Thread1of1ForFork1_~cond~0#1_123| (ite (= (ite (or (< v_~i~0_247 v_~N~0_197) (< v_~start~0_202 v_~end~0_250)) 1 0) 0) 0 1)) (= v_~new~0_88 (select (select |v_#memory_int_340| v_~queue~0.base_148) (+ (* v_~start~0_203 4) v_~queue~0.offset_149)))) InVars {~start~0=v_~start~0_203, ~queue~0.offset=v_~queue~0.offset_149, ~ok~0=v_~ok~0_141, ~i~0=v_~i~0_247, #memory_int=|v_#memory_int_340|, ~end~0=v_~end~0_250, ~N~0=v_~N~0_197, ~v_old~0=v_~v_old~0_132, ~queue~0.base=v_~queue~0.base_148, ~n~0=v_~n~0_145} OutVars{~start~0=v_~start~0_202, ~new~0=v_~new~0_88, ~queue~0.offset=v_~queue~0.offset_149, ~ok~0=v_~ok~0_140, ~i~0=v_~i~0_247, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, ~N~0=v_~N~0_197, ~queue~0.base=v_~queue~0.base_148, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_45|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_123|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_45|, #memory_int=|v_#memory_int_340|, ~end~0=v_~end~0_250, ~v_old~0=v_~v_old~0_131, ~n~0=v_~n~0_145} 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 05:40:29,812 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [770] L50-->L79: Formula: (let ((.cse0 (select |v_#memory_int_516| v_~queue~0.base_228))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_87| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_87|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_87| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_98| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_98|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_98| 0)) (= v_~start~0_315 (+ v_~start~0_316 1)) (= (ite (= (select (select |v_#memory_int_516| v_~A~0.base_255) (+ v_~A~0.offset_255 (* v_~i~0_398 4))) (select .cse0 (+ (* v_~end~0_353 4) v_~queue~0.offset_229))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_87|) (= v_~new~0_152 v_~v_old~0_247) (= (select .cse0 (+ (* v_~start~0_316 4) v_~queue~0.offset_229)) v_~new~0_152) (= v_~end~0_352 (+ v_~end~0_353 1)) (= (ite (= (ite (or (< v_~i~0_398 v_~N~0_275) (< v_~start~0_315 v_~end~0_352)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_230|) (= (ite (and (<= 0 v_~start~0_316) (< v_~start~0_316 v_~end~0_352) (< v_~start~0_316 v_~n~0_211)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_98|) (not (= (ite (and (<= 0 v_~end~0_353) (< v_~end~0_353 v_~n~0_211)) 1 0) 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_250 256) 0)) (<= v_~new~0_152 v_~v_old~0_248)) 1 0) 0) 0 1) v_~ok~0_249))) InVars {~start~0=v_~start~0_316, ~queue~0.offset=v_~queue~0.offset_229, ~A~0.base=v_~A~0.base_255, ~A~0.offset=v_~A~0.offset_255, ~ok~0=v_~ok~0_250, ~i~0=v_~i~0_398, #memory_int=|v_#memory_int_516|, ~end~0=v_~end~0_353, ~N~0=v_~N~0_275, ~v_old~0=v_~v_old~0_248, ~queue~0.base=v_~queue~0.base_228, ~n~0=v_~n~0_211} OutVars{~start~0=v_~start~0_315, ~new~0=v_~new~0_152, ~queue~0.offset=v_~queue~0.offset_229, ~A~0.base=v_~A~0.base_255, ~ok~0=v_~ok~0_249, ~i~0=v_~i~0_398, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_87|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_98|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_87|, ~N~0=v_~N~0_275, ~queue~0.base=v_~queue~0.base_228, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_98|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_87|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_98|, ~A~0.offset=v_~A~0.offset_255, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_230|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_98|, #memory_int=|v_#memory_int_516|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_87|, ~end~0=v_~end~0_352, ~v_old~0=v_~v_old~0_247, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_87|, ~n~0=v_~n~0_211} AuxVars[] AssignedVars[~start~0, ~new~0, ~ok~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~end~0, ~v_old~0, thread1Thread1of1ForFork0_#t~mem3#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 05:40:29,951 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [716] $Ultimate##0-->L79: Formula: (and (= (ite (and (<= 0 v_~start~0_203) (< v_~start~0_203 v_~end~0_250) (< v_~start~0_203 v_~n~0_145)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ v_~start~0_203 1) v_~start~0_202) (= (ite (= (ite (and (not (= (mod v_~ok~0_141 256) 0)) (<= v_~new~0_88 v_~v_old~0_132)) 1 0) 0) 0 1) v_~ok~0_140) (= v_~new~0_88 v_~v_old~0_131) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (= |v_thread2Thread1of1ForFork1_~cond~0#1_123| (ite (= (ite (or (< v_~i~0_247 v_~N~0_197) (< v_~start~0_202 v_~end~0_250)) 1 0) 0) 0 1)) (= v_~new~0_88 (select (select |v_#memory_int_340| v_~queue~0.base_148) (+ (* v_~start~0_203 4) v_~queue~0.offset_149)))) InVars {~start~0=v_~start~0_203, ~queue~0.offset=v_~queue~0.offset_149, ~ok~0=v_~ok~0_141, ~i~0=v_~i~0_247, #memory_int=|v_#memory_int_340|, ~end~0=v_~end~0_250, ~N~0=v_~N~0_197, ~v_old~0=v_~v_old~0_132, ~queue~0.base=v_~queue~0.base_148, ~n~0=v_~n~0_145} OutVars{~start~0=v_~start~0_202, ~new~0=v_~new~0_88, ~queue~0.offset=v_~queue~0.offset_149, ~ok~0=v_~ok~0_140, ~i~0=v_~i~0_247, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, ~N~0=v_~N~0_197, ~queue~0.base=v_~queue~0.base_148, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_45|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_123|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_45|, #memory_int=|v_#memory_int_340|, ~end~0=v_~end~0_250, ~v_old~0=v_~v_old~0_131, ~n~0=v_~n~0_145} 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 05:40:30,026 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 [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:40:30,208 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [745] $Ultimate##0-->L79: Formula: (and (= v_~new~0_117 v_~v_old~0_183) (= (+ v_~start~0_256 1) v_~start~0_255) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= v_~new~0_117 (select (select |v_#memory_int_419| v_~queue~0.base_179) (+ (* v_~start~0_256 4) v_~queue~0.offset_180))) (= (ite (and (< v_~start~0_256 v_~end~0_281) (< v_~start~0_256 v_~n~0_173) (<= 0 v_~start~0_256)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_193 256) 0)) (<= v_~new~0_117 v_~v_old~0_184)) 1 0) 0) 0 1) v_~ok~0_192) (= |v_thread2Thread1of1ForFork1_~cond~0#1_172| (ite (= 0 (ite (or (< v_~start~0_255 v_~end~0_281) (< v_~i~0_329 v_~N~0_227)) 1 0)) 0 1))) InVars {~start~0=v_~start~0_256, ~queue~0.offset=v_~queue~0.offset_180, ~ok~0=v_~ok~0_193, ~i~0=v_~i~0_329, #memory_int=|v_#memory_int_419|, ~end~0=v_~end~0_281, ~N~0=v_~N~0_227, ~v_old~0=v_~v_old~0_184, ~queue~0.base=v_~queue~0.base_179, ~n~0=v_~n~0_173} OutVars{~start~0=v_~start~0_255, ~new~0=v_~new~0_117, ~queue~0.offset=v_~queue~0.offset_180, ~ok~0=v_~ok~0_192, ~i~0=v_~i~0_329, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, ~N~0=v_~N~0_227, ~queue~0.base=v_~queue~0.base_179, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_69|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_172|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_69|, #memory_int=|v_#memory_int_419|, ~end~0=v_~end~0_281, ~v_old~0=v_~v_old~0_183, ~n~0=v_~n~0_173} 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 05:40:30,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< 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 [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:40:31,087 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 05:40:31,109 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 05:40:31,152 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 [747] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_178| (ite (= (ite (or (< v_~start~0_261 v_~end~0_285) (< v_~i~0_336 v_~N~0_231)) 1 0) 0) 0 1)) (= v_~i~0_335 (+ v_~i~0_336 1))) InVars {~start~0=v_~start~0_261, ~i~0=v_~i~0_336, ~end~0=v_~end~0_285, ~N~0=v_~N~0_231} OutVars{~start~0=v_~start~0_261, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_146|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_178|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_78|, ~i~0=v_~i~0_335, ~end~0=v_~end~0_285, ~N~0=v_~N~0_231} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 05:40:31,191 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 [745] $Ultimate##0-->L79: Formula: (and (= v_~new~0_117 v_~v_old~0_183) (= (+ v_~start~0_256 1) v_~start~0_255) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= v_~new~0_117 (select (select |v_#memory_int_419| v_~queue~0.base_179) (+ (* v_~start~0_256 4) v_~queue~0.offset_180))) (= (ite (and (< v_~start~0_256 v_~end~0_281) (< v_~start~0_256 v_~n~0_173) (<= 0 v_~start~0_256)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_193 256) 0)) (<= v_~new~0_117 v_~v_old~0_184)) 1 0) 0) 0 1) v_~ok~0_192) (= |v_thread2Thread1of1ForFork1_~cond~0#1_172| (ite (= 0 (ite (or (< v_~start~0_255 v_~end~0_281) (< v_~i~0_329 v_~N~0_227)) 1 0)) 0 1))) InVars {~start~0=v_~start~0_256, ~queue~0.offset=v_~queue~0.offset_180, ~ok~0=v_~ok~0_193, ~i~0=v_~i~0_329, #memory_int=|v_#memory_int_419|, ~end~0=v_~end~0_281, ~N~0=v_~N~0_227, ~v_old~0=v_~v_old~0_184, ~queue~0.base=v_~queue~0.base_179, ~n~0=v_~n~0_173} OutVars{~start~0=v_~start~0_255, ~new~0=v_~new~0_117, ~queue~0.offset=v_~queue~0.offset_180, ~ok~0=v_~ok~0_192, ~i~0=v_~i~0_329, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, ~N~0=v_~N~0_227, ~queue~0.base=v_~queue~0.base_179, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_69|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_172|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_69|, #memory_int=|v_#memory_int_419|, ~end~0=v_~end~0_281, ~v_old~0=v_~v_old~0_183, ~n~0=v_~n~0_173} 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 05:40:31,268 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 [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] [2022-12-06 05:40:31,330 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 [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] [2022-12-06 05:40:31,392 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 [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] [2022-12-06 05:40:31,454 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 [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] [2022-12-06 05:40:32,530 INFO L203 LiptonReduction]: Total number of compositions: 13 [2022-12-06 05:40:32,530 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6509 [2022-12-06 05:40:32,530 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 1603 transitions, 40585 flow [2022-12-06 05:40:32,530 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 05:40:32,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:32,531 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 05:40:32,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:32,736 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 05:40:32,736 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 05:40:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash -582794425, now seen corresponding path program 1 times [2022-12-06 05:40:32,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:32,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874958633] [2022-12-06 05:40:32,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:32,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:33,688 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 05:40:33,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:33,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874958633] [2022-12-06 05:40:33,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874958633] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:33,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777326327] [2022-12-06 05:40:33,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:33,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:33,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:33,689 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 05:40:33,690 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 05:40:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:33,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-06 05:40:33,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:33,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:33,818 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 19 treesize of output 23 [2022-12-06 05:40:33,822 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 6 treesize of output 5 [2022-12-06 05:40:33,839 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 05:40:33,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 05:40:34,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:34,042 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 44 treesize of output 45 [2022-12-06 05:40:34,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:34,468 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 05:40:34,493 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 05:40:34,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:35,560 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 05:40:35,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777326327] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:35,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:35,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-12-06 05:40:35,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974322290] [2022-12-06 05:40:35,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:35,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 05:40:35,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:35,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 05:40:35,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=588, Unknown=10, NotChecked=0, Total=756 [2022-12-06 05:40:35,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 05:40:35,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 1603 transitions, 40585 flow. Second operand has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 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 05:40:35,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:35,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 05:40:35,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:35,603 WARN L837 $PredicateComparison]: unable to prove that (and (= c_~ok~0 1) (or (< c_~end~0 0) (<= c_~n~0 (+ c_~end~0 1)) (<= c_~N~0 0) (let ((.cse19 (* c_~end~0 4)) (.cse13 (* c_~start~0 4))) (let ((.cse1 (+ .cse13 c_~queue~0.offset)) (.cse2 (+ .cse19 c_~queue~0.offset 4)) (.cse5 (+ .cse19 c_~queue~0.offset)) (.cse8 (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse0 (select .cse7 c_~queue~0.base)) (.cse6 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse8)) (.cse3 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (select .cse0 .cse1) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select .cse0 .cse2) .cse3)) (not (= (select (select .cse4 c_~queue~0.base) .cse5) .cse6)) (< .cse6 .cse3)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse14 (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse9 (select .cse14 c_~queue~0.base)) (.cse12 (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse8)) (.cse10 (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (= (select .cse9 .cse2) .cse10)) (not (= (select (select .cse11 c_~queue~0.base) .cse5) .cse12)) (< (select .cse9 (+ .cse13 c_~queue~0.offset 4)) (+ (select .cse9 .cse1) 1)) (< .cse12 .cse10)))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse15 (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse8)) (.cse16 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (= (select (select .cse15 c_~queue~0.base) .cse2) .cse16)) (not (= (select (select .cse17 c_~queue~0.base) .cse5) .cse18)) (< .cse18 .cse16)))))))))) (<= c_~N~0 c_~i~0))) is different from false [2022-12-06 05:40:36,650 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse33 (* c_~end~0 4)) (.cse34 (* c_~start~0 4))) (let ((.cse14 (< c_~end~0 0)) (.cse15 (<= c_~n~0 (+ c_~end~0 1))) (.cse1 (+ .cse34 c_~queue~0.offset 4)) (.cse2 (+ .cse34 c_~queue~0.offset)) (.cse7 (not (= (mod c_~ok~0 256) 0))) (.cse4 (+ .cse33 c_~queue~0.offset 4)) (.cse13 (+ .cse33 c_~queue~0.offset)) (.cse17 (* c_~i~0 4)) (.cse16 (<= c_~N~0 c_~i~0))) (and (let ((.cse5 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse17)))) (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse0 (select .cse6 c_~queue~0.base)) (.cse3 (select (select .cse6 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (< (select .cse0 .cse1) (+ (select .cse0 .cse2) 1)) (not (= .cse3 (select .cse0 .cse4))) (< .cse5 .cse3))))) (or .cse7 (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse8 (select (select .cse9 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (not (= .cse8 (select (select .cse9 c_~queue~0.base) .cse4))) (< .cse5 .cse8)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse10 (select .cse12 c_~queue~0.base)) (.cse11 (select (select .cse12 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (<= (select .cse10 .cse2) c_~v_old~0) (not (= .cse11 (select .cse10 .cse4))) (< .cse5 .cse11)))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) .cse13) .cse5)) .cse14 .cse15 .cse16)) (= c_~ok~0 1) (or .cse14 .cse15 (<= c_~N~0 0) (let ((.cse23 (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse22 (store .cse20 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse18 (select .cse22 c_~queue~0.base)) (.cse21 (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse23)) (.cse19 (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (select .cse18 .cse2) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select .cse18 .cse4) .cse19)) (not (= (select (select .cse20 c_~queue~0.base) .cse13) .cse21)) (< .cse21 .cse19)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse28 (store .cse26 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse24 (select .cse28 c_~queue~0.base)) (.cse27 (select (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse23)) (.cse25 (select (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (= (select .cse24 .cse4) .cse25)) (not (= (select (select .cse26 c_~queue~0.base) .cse13) .cse27)) (< (select .cse24 .cse1) (+ (select .cse24 .cse2) 1)) (< .cse27 .cse25)))))) (or .cse7 (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse29 (store .cse31 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse23)) (.cse30 (select (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (= (select (select .cse29 c_~queue~0.base) .cse4) .cse30)) (not (= (select (select .cse31 c_~queue~0.base) .cse13) .cse32)) (< .cse32 .cse30))))))))) .cse16)))) is different from false [2022-12-06 05:40:45,721 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse49 (* c_~end~0 4))) (let ((.cse50 (* c_~start~0 4)) (.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse48 (* c_~i~0 4)) (.cse8 (select |c_#memory_int| c_~queue~0.base)) (.cse26 (+ .cse49 c_~queue~0.offset))) (let ((.cse0 (select .cse8 .cse26)) (.cse3 (not (< c_~end~0 c_~n~0))) (.cse4 (not (<= 0 c_~end~0))) (.cse14 (select .cse2 (+ c_~A~0.offset .cse48))) (.cse5 (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0)))) (.cse21 (< c_~end~0 0)) (.cse22 (<= c_~n~0 (+ c_~end~0 1))) (.cse9 (+ .cse50 c_~queue~0.offset 4)) (.cse10 (+ .cse50 c_~queue~0.offset)) (.cse6 (not (= (mod c_~ok~0 256) 0))) (.cse13 (+ .cse49 c_~queue~0.offset 4)) (.cse23 (<= c_~N~0 c_~i~0))) (and (or (forall ((v_~i~0_484 Int)) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (not (= .cse0 .cse1)) (not (<= .cse1 c_~last~0))))) .cse3 .cse4 .cse5 (let ((.cse7 (select .cse8 .cse10))) (and .cse6 (<= .cse7 c_~v_old~0) (< (select .cse8 .cse9) (+ .cse7 1))))) (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse11 (select .cse15 c_~queue~0.base)) (.cse12 (select (select .cse15 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (< (select .cse11 .cse9) (+ (select .cse11 .cse10) 1)) (not (= .cse12 (select .cse11 .cse13))) (< .cse14 .cse12))))) (or .cse6 (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse16 (select (select .cse17 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (not (= .cse16 (select (select .cse17 c_~queue~0.base) .cse13))) (< .cse14 .cse16)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse18 (select .cse20 c_~queue~0.base)) (.cse19 (select (select .cse20 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (<= (select .cse18 .cse10) c_~v_old~0) (not (= .cse19 (select .cse18 .cse13))) (< .cse14 .cse19)))))) (not (= .cse0 .cse14)) .cse21 .cse22 .cse23) (or .cse3 .cse4 (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse25 (select .cse27 c_~queue~0.base)) (.cse24 (select (select .cse27 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (not (= .cse24 (select .cse25 .cse26))) (<= (select .cse25 .cse10) c_~v_old~0) (< .cse14 .cse24))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse28 (select (select .cse29 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (not (= .cse28 (select (select .cse29 c_~queue~0.base) .cse26))) (< .cse14 .cse28))))) .cse6) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse30 (select .cse32 c_~queue~0.base)) (.cse31 (select (select .cse32 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (< (select .cse30 .cse9) (+ (select .cse30 .cse10) 1)) (not (= .cse31 (select .cse30 .cse26))) (< .cse14 .cse31)))))) .cse5) (= c_~ok~0 1) (or .cse21 .cse22 (<= c_~N~0 0) (let ((.cse38 (+ .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse37 (store .cse35 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse33 (select .cse37 c_~queue~0.base)) (.cse36 (select (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse38)) (.cse34 (select (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (select .cse33 .cse10) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select .cse33 .cse13) .cse34)) (not (= (select (select .cse35 c_~queue~0.base) .cse26) .cse36)) (< .cse36 .cse34)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse43 (store .cse41 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse39 (select .cse43 c_~queue~0.base)) (.cse42 (select (select .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse38)) (.cse40 (select (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (= (select .cse39 .cse13) .cse40)) (not (= (select (select .cse41 c_~queue~0.base) .cse26) .cse42)) (< (select .cse39 .cse9) (+ (select .cse39 .cse10) 1)) (< .cse42 .cse40)))))) (or .cse6 (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse44 (store .cse46 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse47 (select (select .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse38)) (.cse45 (select (select .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (= (select (select .cse44 c_~queue~0.base) .cse13) .cse45)) (not (= (select (select .cse46 c_~queue~0.base) .cse26) .cse47)) (< .cse47 .cse45))))))))) .cse23))))) is different from false [2022-12-06 05:40:50,420 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse33 (* c_~end~0 4)) (.cse34 (* c_~start~0 4))) (let ((.cse14 (< c_~end~0 0)) (.cse15 (<= c_~n~0 (+ c_~end~0 1))) (.cse1 (+ .cse34 c_~queue~0.offset 4)) (.cse2 (+ .cse34 c_~queue~0.offset)) (.cse7 (not (= (mod c_~ok~0 256) 0))) (.cse4 (+ .cse33 c_~queue~0.offset 4)) (.cse13 (+ .cse33 c_~queue~0.offset)) (.cse17 (* c_~i~0 4)) (.cse16 (<= c_~N~0 c_~i~0))) (and (let ((.cse5 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse17)))) (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse0 (select .cse6 c_~queue~0.base)) (.cse3 (select (select .cse6 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (< (select .cse0 .cse1) (+ (select .cse0 .cse2) 1)) (not (= .cse3 (select .cse0 .cse4))) (< .cse5 .cse3))))) (or .cse7 (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse8 (select (select .cse9 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (not (= .cse8 (select (select .cse9 c_~queue~0.base) .cse4))) (< .cse5 .cse8)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse10 (select .cse12 c_~queue~0.base)) (.cse11 (select (select .cse12 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (<= (select .cse10 .cse2) c_~v_old~0) (not (= .cse11 (select .cse10 .cse4))) (< .cse5 .cse11)))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) .cse13) .cse5)) .cse14 .cse15 .cse16)) (or .cse14 .cse15 (<= c_~N~0 0) (let ((.cse23 (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse22 (store .cse20 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse18 (select .cse22 c_~queue~0.base)) (.cse21 (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse23)) (.cse19 (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (select .cse18 .cse2) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select .cse18 .cse4) .cse19)) (not (= (select (select .cse20 c_~queue~0.base) .cse13) .cse21)) (< .cse21 .cse19)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse28 (store .cse26 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse24 (select .cse28 c_~queue~0.base)) (.cse27 (select (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse23)) (.cse25 (select (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (= (select .cse24 .cse4) .cse25)) (not (= (select (select .cse26 c_~queue~0.base) .cse13) .cse27)) (< (select .cse24 .cse1) (+ (select .cse24 .cse2) 1)) (< .cse27 .cse25)))))) (or .cse7 (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse29 (store .cse31 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse23)) (.cse30 (select (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (= (select (select .cse29 c_~queue~0.base) .cse4) .cse30)) (not (= (select (select .cse31 c_~queue~0.base) .cse13) .cse32)) (< .cse32 .cse30))))))))) .cse16)))) is different from false [2022-12-06 05:41:00,690 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse38 (* c_~end~0 4))) (let ((.cse39 (* c_~start~0 4)) (.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse25 (+ .cse38 c_~queue~0.offset))) (let ((.cse0 (select .cse5 .cse25)) (.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse18 (< c_~end~0 0)) (.cse19 (<= c_~n~0 (+ c_~end~0 1))) (.cse6 (+ .cse39 c_~queue~0.offset 4)) (.cse7 (+ .cse39 c_~queue~0.offset)) (.cse3 (not (= (mod c_~ok~0 256) 0))) (.cse10 (+ .cse38 c_~queue~0.offset 4)) (.cse21 (* c_~i~0 4)) (.cse20 (<= c_~N~0 c_~i~0))) (and (or (forall ((v_~i~0_484 Int)) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (not (= .cse0 .cse1)) (not (<= .cse1 c_~last~0))))) (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0)) (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0))) (let ((.cse4 (select .cse5 .cse7))) (and .cse3 (<= .cse4 c_~v_old~0) (< (select .cse5 .cse6) (+ .cse4 1))))) (let ((.cse11 (select .cse2 (+ c_~A~0.offset .cse21)))) (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse8 (select .cse12 c_~queue~0.base)) (.cse9 (select (select .cse12 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (< (select .cse8 .cse6) (+ (select .cse8 .cse7) 1)) (not (= .cse9 (select .cse8 .cse10))) (< .cse11 .cse9))))) (or .cse3 (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse13 (select (select .cse14 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (not (= .cse13 (select (select .cse14 c_~queue~0.base) .cse10))) (< .cse11 .cse13)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse15 (select .cse17 c_~queue~0.base)) (.cse16 (select (select .cse17 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (<= (select .cse15 .cse7) c_~v_old~0) (not (= .cse16 (select .cse15 .cse10))) (< .cse11 .cse16)))))) (not (= .cse0 .cse11)) .cse18 .cse19 .cse20)) (= c_~ok~0 1) (or .cse18 .cse19 (<= c_~N~0 0) (let ((.cse28 (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse27 (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse22 (select .cse27 c_~queue~0.base)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse28)) (.cse23 (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (select .cse22 .cse7) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select .cse22 .cse10) .cse23)) (not (= (select (select .cse24 c_~queue~0.base) .cse25) .cse26)) (< .cse26 .cse23)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse33 (store .cse31 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse29 (select .cse33 c_~queue~0.base)) (.cse32 (select (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse28)) (.cse30 (select (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (= (select .cse29 .cse10) .cse30)) (not (= (select (select .cse31 c_~queue~0.base) .cse25) .cse32)) (< (select .cse29 .cse6) (+ (select .cse29 .cse7) 1)) (< .cse32 .cse30)))))) (or .cse3 (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse34 (store .cse36 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse28)) (.cse35 (select (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (= (select (select .cse34 c_~queue~0.base) .cse10) .cse35)) (not (= (select (select .cse36 c_~queue~0.base) .cse25) .cse37)) (< .cse37 .cse35))))))))) .cse20))))) is different from false [2022-12-06 05:41:07,663 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 101 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:41:14,324 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse41 (* c_~end~0 4)) (.cse42 (* c_~start~0 4)) (.cse40 (* c_~i~0 4))) (let ((.cse5 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse40))) (.cse14 (< c_~end~0 0)) (.cse15 (<= c_~n~0 (+ c_~end~0 1))) (.cse1 (+ .cse42 c_~queue~0.offset 4)) (.cse2 (+ .cse42 c_~queue~0.offset)) (.cse7 (not (= (mod c_~ok~0 256) 0))) (.cse4 (+ .cse41 c_~queue~0.offset 4)) (.cse13 (+ .cse41 c_~queue~0.offset)) (.cse16 (<= c_~N~0 c_~i~0))) (and (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse0 (select .cse6 c_~queue~0.base)) (.cse3 (select (select .cse6 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (< (select .cse0 .cse1) (+ (select .cse0 .cse2) 1)) (not (= .cse3 (select .cse0 .cse4))) (< .cse5 .cse3))))) (or .cse7 (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse8 (select (select .cse9 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (not (= .cse8 (select (select .cse9 c_~queue~0.base) .cse4))) (< .cse5 .cse8)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse10 (select .cse12 c_~queue~0.base)) (.cse11 (select (select .cse12 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (<= (select .cse10 .cse2) c_~v_old~0) (not (= .cse11 (select .cse10 .cse4))) (< .cse5 .cse11)))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) .cse13) .cse5)) .cse14 .cse15 .cse16) (or (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse18 (select .cse19 c_~queue~0.base)) (.cse17 (select (select .cse19 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (not (= .cse17 (select .cse18 .cse13))) (<= (select .cse18 .cse2) c_~v_old~0) (< .cse5 .cse17))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse20 (select (select .cse21 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (not (= .cse20 (select (select .cse21 c_~queue~0.base) .cse13))) (< .cse5 .cse20))))) .cse7) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse22 (select .cse24 c_~queue~0.base)) (.cse23 (select (select .cse24 c_~A~0.base) (+ c_~A~0.offset (* v_~i~0_484 4))))) (or (< (select .cse22 .cse1) (+ (select .cse22 .cse2) 1)) (not (= .cse23 (select .cse22 .cse13))) (< .cse5 .cse23)))))) (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0)))) (= c_~ok~0 1) (or .cse14 .cse15 (<= c_~N~0 0) (let ((.cse30 (+ .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse29 (store .cse27 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse25 (select .cse29 c_~queue~0.base)) (.cse28 (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse30)) (.cse26 (select (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (select .cse25 .cse2) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select .cse25 .cse4) .cse26)) (not (= (select (select .cse27 c_~queue~0.base) .cse13) .cse28)) (< .cse28 .cse26)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse35 (store .cse33 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse31 (select .cse35 c_~queue~0.base)) (.cse34 (select (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse30)) (.cse32 (select (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (= (select .cse31 .cse4) .cse32)) (not (= (select (select .cse33 c_~queue~0.base) .cse13) .cse34)) (< (select .cse31 .cse1) (+ (select .cse31 .cse2) 1)) (< .cse34 .cse32)))))) (or .cse7 (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115))) (let ((.cse36 (store .cse38 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse30)) (.cse37 (select (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (= (select (select .cse36 c_~queue~0.base) .cse4) .cse37)) (not (= (select (select .cse38 c_~queue~0.base) .cse13) .cse39)) (< .cse39 .cse37))))))))) .cse16)))) is different from false [2022-12-06 05:41:32,099 INFO L130 PetriNetUnfolder]: 23013/39365 cut-off events. [2022-12-06 05:41:32,099 INFO L131 PetriNetUnfolder]: For 1343264/1343264 co-relation queries the response was YES. [2022-12-06 05:41:32,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413752 conditions, 39365 events. 23013/39365 cut-off events. For 1343264/1343264 co-relation queries the response was YES. Maximal size of possible extension queue 1558. Compared 332116 event pairs, 3647 based on Foata normal form. 37/39401 useless extension candidates. Maximal degree in co-relation 412729. Up to 22538 conditions per place. [2022-12-06 05:41:32,961 INFO L137 encePairwiseOnDemand]: 11/69 looper letters, 2148 selfloop transitions, 2126 changer transitions 124/4398 dead transitions. [2022-12-06 05:41:32,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 4398 transitions, 118145 flow [2022-12-06 05:41:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-06 05:41:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-12-06 05:41:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 530 transitions. [2022-12-06 05:41:32,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12192316540142627 [2022-12-06 05:41:32,963 INFO L175 Difference]: Start difference. First operand has 298 places, 1603 transitions, 40585 flow. Second operand 63 states and 530 transitions. [2022-12-06 05:41:32,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 4398 transitions, 118145 flow [2022-12-06 05:41:54,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 4398 transitions, 112473 flow, removed 2388 selfloop flow, removed 13 redundant places. [2022-12-06 05:41:54,251 INFO L231 Difference]: Finished difference. Result has 394 places, 3721 transitions, 102116 flow [2022-12-06 05:41:54,252 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=38647, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=534, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=814, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=102116, PETRI_PLACES=394, PETRI_TRANSITIONS=3721} [2022-12-06 05:41:54,253 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 369 predicate places. [2022-12-06 05:41:54,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:54,253 INFO L89 Accepts]: Start accepts. Operand has 394 places, 3721 transitions, 102116 flow [2022-12-06 05:41:54,283 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:54,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:54,283 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 394 places, 3721 transitions, 102116 flow [2022-12-06 05:41:54,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 394 places, 3721 transitions, 102116 flow [2022-12-06 05:42:00,532 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([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][987], [Black: 2730#(and (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (forall ((v_~i~0_484 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), 1836#true, Black: 2720#(and (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (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)) (<= ~last~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))) ~v_old~0) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (= ~ok~0 1)), 1548#true, Black: 2726#(and (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 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)))) (<= ~N~0 ~i~0)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (<= ~start~0 1) (= ~queue~0.offset 0) (exists ((~i~0 Int) (~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~A~0.base) 0)) (not (= ~A~0.base ~queue~0.base)))) (<= 1 ~start~0) (= ~ok~0 1)), Black: 2664#(or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~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)))) (<= ~N~0 ~i~0)), Black: 2706#(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)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~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 (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 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)))) (<= ~N~0 ~i~0)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (forall ((v_~i~0_484 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 1535#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (<= ~end~0 ~start~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2732#(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)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~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 (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (forall ((v_~i~0_484 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), 2017#(<= 0 ~i~0), 1093#true, 1710#true, Black: 1048#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)))) (= ~ok~0 1)), Black: 1753#(and (<= ~i~0 1) (<= 2 ~N~0)), Black: 1054#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0)))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0))) (<= ~end~0 ~start~0))), Black: 896#(= ~ok~0 1), 727#true, Black: 1831#true, Black: 965#(or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0)))), Black: 1042#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (forall ((~queue~0.offset 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_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0))))), Black: 1010#(and (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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 (= ~start~0 0))) (<= ~end~0 0))) (= ~start~0 ~end~0) (= ~i~0 0) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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 (= ~end~0 1))) (or (and (<= 0 ~queue~0.offset) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~end~0 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (or (not (<= ~end~0 1)) (and (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))) (= ~ok~0 1)), Black: 1040#(and (or (< ~start~0 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4))) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), Black: 1000#(and (or (< ~last~0 (+ ~v_old~0 1)) (not (< ~end~0 ~n~0))) (or (forall ((~queue~0.offset 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_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (<= ~n~0 ~start~0) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)))) (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (<= ~end~0 0)) (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)))) (= ~last~0 ~v_old~0)))) (or (not (<= ~end~0 1)) (and (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))) (or (and (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~start~0 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (and (<= ~start~0 1) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< 0 (+ ~start~0 1)) (not (= ~start~0 0)))) (= ~ok~0 1)), Black: 860#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (= ~ok~0 1)), Black: 1034#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 1020#(and (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (or (and (<= 0 ~queue~0.offset) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~end~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (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 (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0) (= ~last~0 ~v_old~0)) (not (= ~start~0 0))) (<= ~end~0 0))) (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)))) (not (= ~end~0 1)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0) (= ~last~0 ~v_old~0))))) (or (< ~start~0 0) (< ~last~0 (+ ~v_old~0 1)) (not (< ~end~0 ~n~0))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (not (<= ~end~0 1)) (and (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))) (or (< ~start~0 0) (forall ((~queue~0.offset 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_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), Black: 1006#(and (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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 (= ~start~0 0))) (<= ~end~0 0))) (= ~start~0 ~end~0) (= ~i~0 0) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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 (= ~end~0 1))) (or (and (<= 0 ~queue~0.offset) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~end~0 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< ~start~0 0) (< ~last~0 (+ ~v_old~0 1)) (not (< ~end~0 ~n~0))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (or (not (<= ~end~0 1)) (and (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))) (= ~ok~0 1)), Black: 992#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (< ~start~0 ~n~0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< 0 (+ ~start~0 1)) (not (= ~start~0 0))) (and (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~start~0 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~end~0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1026#(and (or (<= ~n~0 ~start~0) (<= ~end~0 ~start~0) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)))) (or (and (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~start~0 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (and (<= ~start~0 1) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< 0 (+ ~start~0 1)) (not (= ~start~0 0)))) (= ~ok~0 1)), Black: 1036#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (forall ((~queue~0.offset 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_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)))) (= ~ok~0 1)), Black: 982#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)))) (= ~ok~0 1)), Black: 986#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= ~n~0 2) (= ~i~0 0) (< ~start~0 ~n~0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< 0 (+ ~start~0 1)) (not (= ~start~0 0))) (and (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~start~0 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~end~0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1028#(and (or (< ~start~0 0) (< ~last~0 (+ ~v_old~0 1)) (not (< ~end~0 ~n~0))) (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (or (and (<= 0 ~queue~0.offset) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~end~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (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 (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0) (= ~last~0 ~v_old~0)) (not (= ~start~0 0))) (<= ~end~0 0))) (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)))) (not (= ~end~0 1)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0) (= ~last~0 ~v_old~0))) (= ~ok~0 1))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (not (<= ~end~0 1)) (and (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))) (or (< ~start~0 0) (forall ((~queue~0.offset 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_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0)))), Black: 1052#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (not (= (mod ~ok~0 256) 0)))), Black: 1046#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (forall ((~queue~0.offset 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_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0)))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0))) (<= ~end~0 ~start~0))), Black: 477#true, Black: 479#(not (<= ~N~0 ~i~0)), Black: 508#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 729#(<= ~end~0 ~start~0), Black: 730#(<= ~end~0 (+ ~start~0 1)), 8#L59true, Black: 1310#(= ~ok~0 1), Black: 1386#(and (or (< 3 (+ ~queue~0.offset (* ~start~0 4))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (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|) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~queue~0.offset 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 8) (= ~ok~0 1)), Black: 1376#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 8) (<= ~n~0 3))), Black: 1384#(and (or (< 3 (+ ~queue~0.offset (* ~start~0 4))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~queue~0.offset 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 8) (= ~ok~0 1)), Black: 1378#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 8) (<= ~n~0 3))), Black: 1382#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (or (and (= (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 (* ~start~0 4)) 0)) (and (= (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)))) (< 3 (+ ~queue~0.offset (* ~start~0 4))))) (= ~queue~0.offset 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 8) (= ~ok~0 1)), 46#L79true, 48#L103-1true, Black: 1576#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 1) ~end~0) (= ~ok~0 1)), Black: 1609#(= ~ok~0 1), 2227#true, Black: 171#(and (= ~i~0 0) (<= 1 ~N~0)), 253#true, Black: 2225#(and (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (+ (* ~i~0 4) ~A~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 179#true, Black: 2369#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (forall ((~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 (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2233#(and (= ~queue~0.offset 0) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 181#(or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))), Black: 2458#(and (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), 512#(= |thread2Thread1of1ForFork1_~cond~0#1| 1), Black: 2412#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (<= ~n~0 ~end~0)) (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 190#(= ~ok~0 1), Black: 2408#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (<= ~n~0 ~end~0)) (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), Black: 2382#(and (or (<= ~n~0 ~start~0) (and (<= ~n~0 2) (<= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)))) (<= 0 ~start~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2388#(and (or (<= ~n~0 ~start~0) (and (<= ~n~0 2) (<= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)))) (<= 0 ~start~0) (<= (+ ~start~0 1) ~end~0) (or (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2436#(and (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (= ~ok~0 1)), 2593#(= ~ok~0 1), Black: 2446#(and (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 2396#(and (or (<= ~n~0 ~start~0) (and (<= ~n~0 2) (<= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)))) (<= 0 ~start~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2484#(and (or (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0)))) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 411#(and (or (forall ((~queue~0.base Int)) (or (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~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)))))) (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0))) (or (forall ((~queue~0.base Int) (v_ArrVal_156 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (and (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), Black: 2236#(and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (* ~start~0 4) 4) (= ~queue~0.offset 0)), Black: 2452#(and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (or (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2418#(and (= ~queue~0.offset 0) (or (<= ~n~0 (+ ~end~0 1)) (forall ((v_~i~0_389 Int) (v_ArrVal_1052 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))))) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 2398#(and (or (<= ~n~0 ~start~0) (and (<= ~n~0 2) (<= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (<= 0 ~start~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (<= ~n~0 ~end~0) (= ~ok~0 1)), Black: 2380#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_~i~0_389 Int) (v_ArrVal_1052 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (forall ((v_~i~0_389 Int) (v_ArrVal_1052 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))))) (< ~end~0 0)) (= ~ok~0 1)), Black: 2442#(and (or (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2404#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4)))) (= ~A~0.offset 0) (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (<= ~n~0 2) (= ~start~0 ~end~0) (< ~start~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= ~last~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (<= 1 ~start~0) (not (= ~A~0.base ~queue~0.base)) (= ~ok~0 1)), Black: 2296#(= ~ok~0 1), Black: 1979#(and (or (and (= ~A~0.offset 0) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (and (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))))) (not (<= ~start~0 3))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 4)) (<= ~start~0 3)) (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~queue~0.offset 0) (or (not (<= ~start~0 3)) (and (= ~i~0 0) (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))) (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: 1894#(= ~ok~0 1), Black: 2384#(and (<= 0 ~start~0) (or (<= ~n~0 ~start~0) (and (or (= (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)))) (<= ~n~0 ~end~0)) (<= ~n~0 2) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2390#(and (or (<= ~n~0 ~start~0) (and (or (= (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)))) (<= ~n~0 ~end~0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0))) (or (<= ~n~0 ~start~0) (and (<= ~n~0 2) (<= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)))) (<= 0 ~start~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 1993#(and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~A~0.offset 0) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1)), Black: 2460#(and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))) (or (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= (* ~start~0 4) 4) (or (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1997#(and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~A~0.offset 0) (= ~queue~0.offset 0) (exists ((~A~0.offset Int) (v_~i~0_358 Int) (~A~0.base Int)) (and (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_358 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_358 4) ~A~0.offset)) ~v_old~0) (not (= ~A~0.base ~queue~0.base)))) (<= ~start~0 3) (= ~ok~0 1)), Black: 2454#(and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (or (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (or (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 1981#(and (or (and (= ~A~0.offset 0) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (and (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))))) (not (<= ~start~0 3))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 4)) (<= ~start~0 3)) (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (or (not (<= ~start~0 3)) (and (= ~i~0 0) (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))) (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: 1989#(and (= ~A~0.offset 0) (= ~i~0 0) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))) (not (= ~A~0.base ~queue~0.base)))) (= (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) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (<= ~start~0 3) (= ~ok~0 1)), Black: 2410#(and (or (<= ~n~0 ~start~0) (and (<= ~n~0 2) (<= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (<= 0 ~start~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (<= ~n~0 ~end~0) (= ~ok~0 1)), Black: 2434#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 1991#(and (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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_~#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: 421#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2444#(and (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), Black: 1985#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (<= ~end~0 ~start~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 1224#(and (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (= ~i~0 0) (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 (not (<= ~end~0 0)) (and (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4))))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 2710#(and (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (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)) (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 1234#(and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~ok~0 1)), Black: 1987#(and (= ~start~0 ~end~0) (<= ~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_~#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: 2464#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~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 (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (forall ((~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 (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 409#(and (= ~A~0.offset 0) (= ~i~0 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (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|)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (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) (<= 1 ~end~0)), Black: 1146#(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_323 Int) (~A~0.base Int)) (and (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_323 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_323 4))) ~v_old~0))) (= ~ok~0 1)), Black: 2486#(and (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0)))) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 401#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (and (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), Black: 2744#(and (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2478#(and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (or (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= (* ~start~0 4) 4) (or (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0)), Black: 2740#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 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)))) (<= ~N~0 ~i~0)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (+ ~queue~0.offset (* ~start~0 4)) 4) (= ~ok~0 1)), Black: 1099#(and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~A~0.offset 0) (= ~i~0 0) (= ~ok~0 1)), Black: 1113#(and (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (= ~ok~0 1)), Black: 2438#(and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (or (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2708#(and (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (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)) (<= ~last~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))) ~v_old~0) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~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)))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2480#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (<= ~n~0 ~end~0)) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0)))) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 2716#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~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 (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (forall ((v_~i~0_484 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 1156#(= ~ok~0 1), Black: 2422#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (<= ~n~0 ~end~0)) (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2673#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (= ~ok~0 1)), Black: 1101#(and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~ok~0 1)), Black: 2448#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (<= ~n~0 ~end~0)) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 2770#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 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)))) (<= ~N~0 ~i~0)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2440#(and (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (or (<= ~n~0 ~start~0) (and (<= ~n~0 2) (<= ~last~0 ~v_old~0))) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 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)))) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (exists ((~i~0 Int) (~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~A~0.base) 0)) (not (= ~A~0.base ~queue~0.base)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2702#(and (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (<= ~N~0 0) (<= ~N~0 ~i~0)) (<= 0 ~queue~0.offset) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (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)))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (<= ~N~0 ~i~0)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4))) (= ~ok~0 1) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))), Black: 1133#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))))) (= ~ok~0 1)), Black: 2474#(and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (or (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (or (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2756#(and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (+ ~queue~0.offset (* ~start~0 4)) 4) (= ~ok~0 1)), Black: 2402#(and (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (or (<= ~n~0 (+ ~end~0 1)) (forall ((v_~i~0_389 Int) (v_ArrVal_1052 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))))) (= ~ok~0 1)), Black: 2638#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 2472#(and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (or (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0)))), Black: 2586#(and (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (<= ~start~0 1) (= ~queue~0.offset 0) (exists ((~i~0 Int) (~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~A~0.base) 0)) (not (= ~A~0.base ~queue~0.base)))) (<= 1 ~start~0) (= ~ok~0 1)), Black: 2768#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (= ~ok~0 1)), Black: 2374#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (= ~last~0 ~v_old~0) (<= (+ ~start~0 ~n~0) (+ ~end~0 2)) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~queue~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~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|)) (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: 2538#(and (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (<= 0 ~queue~0.offset) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4))) (= ~ok~0 1) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))), 847#true, Black: 2376#(and (= ~A~0.offset 0) (<= ~n~0 2) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~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) (< ~i~0 ~N~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~0) (= ~end~0 (+ ~start~0 1)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2692#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~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)))) (<= ~N~0 ~i~0)) (= ~ok~0 1)), Black: 2428#(and (or (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2742#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (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)) (forall ((v_~i~0_484 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~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)))) (<= ~N~0 ~i~0)) (= ~ok~0 1)), Black: 2470#(and (or (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~queue~0.offset 0) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 2754#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 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)))) (<= ~N~0 ~i~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (= ~ok~0 1)), Black: 2392#(and (<= 0 ~start~0) (or (<= ~n~0 ~start~0) (and (or (= (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)))) (<= ~n~0 ~end~0)) (<= ~n~0 2) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2772#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 2540#(and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (and (<= 0 (+ ~queue~0.offset (* ~start~0 4))) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4))) (not (= 4 (+ ~queue~0.offset (* ~end~0 4))))) (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (or (and (= (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|))) (<= ~n~0 ~end~0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~ok~0 1)), Black: 2683#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (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)) (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (= ~ok~0 1)), Black: 2698#(and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)) (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) 4)) (or (and (= (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|))) (<= ~n~0 ~end~0)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~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)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 2712#(and (or (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)) (or (<= ~n~0 ~end~0) (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))) ~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)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~ok~0 1)), Black: 2746#(and (or (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (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| ~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 (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 2738#(and (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (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)) (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (= ~ok~0 1)), Black: 2690#(and (or (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (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| ~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 (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (= ~ok~0 1)), Black: 2724#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~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)))) (<= ~N~0 ~i~0))), Black: 2688#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= ~n~0 2) (<= 0 ~start~0) (= ~i~0 0) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< ~start~0 ~n~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) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~0) (= ~end~0 (+ ~start~0 1)) (<= 2 ~N~0) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2718#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (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)) (forall ((v_~i~0_484 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~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)))) (<= ~N~0 ~i~0)) (= ~ok~0 1)), Black: 2560#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= ~n~0 2) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~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) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~0) (= ~end~0 (+ ~start~0 1)) (<= 2 ~N~0) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2704#(and (= ~A~0.offset 0) (<= ~n~0 2) (<= 0 ~start~0) (< ~start~0 ~n~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= ~last~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~0) (= ~end~0 (+ ~start~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (= ~A~0.base ~queue~0.base)) (= ~ok~0 1)), Black: 2679#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= ~n~0 2) (= ~start~0 ~end~0) (= ~i~0 0) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (= ~queue~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~0) (<= 2 ~N~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)))) (= ~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: 2714#(and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)) (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) 4)) (or (and (= (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|))) (<= ~n~0 ~end~0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (exists ((~i~0 Int) (~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)) (<= (select (select |#memory_int| ~A~0.base) 0) ~v_old~0) (<= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (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)))) (= ~ok~0 1)), Black: 2734#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (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)) (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 2736#(and (<= 0 ~start~0) (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0))) (<= ~start~0 0) (or (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)) (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))) (<= ~n~0 ~end~0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (exists ((~i~0 Int) (~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)) (<= (select (select |#memory_int| ~A~0.base) 0) ~v_old~0) (<= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (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)))) (= ~ok~0 1)), Black: 2752#(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)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 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)))) (<= ~N~0 ~i~0)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (= ~ok~0 1)), Black: 2764#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (+ ~queue~0.offset (* ~start~0 4)) 4) (= ~ok~0 1)), Black: 2541#(and (or (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)) (<= ~last~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))) ~v_old~0) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (= ~ok~0 1)), Black: 2774#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~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)))) (<= ~N~0 ~i~0))), Black: 2758#(and (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (<= ~start~0 1) (= ~queue~0.offset 0) (exists ((~i~0 Int) (~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~A~0.base) 0)) (not (= ~A~0.base ~queue~0.base)))) (<= 1 ~start~0) (= ~ok~0 1)), Black: 2722#(and (or (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)) (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (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| ~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 (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 2762#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~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)))) (<= ~N~0 ~i~0)) (= ~ok~0 1))]) [2022-12-06 05:42:00,537 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 05:42:00,537 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 05:42:00,537 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:42:00,537 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:42:07,109 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] thread2EXIT-->L104-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][2902], [Black: 2730#(and (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (forall ((v_~i~0_484 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2720#(and (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (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)) (<= ~last~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))) ~v_old~0) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (= ~ok~0 1)), Black: 2726#(and (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 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)))) (<= ~N~0 ~i~0)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (<= ~start~0 1) (= ~queue~0.offset 0) (exists ((~i~0 Int) (~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~A~0.base) 0)) (not (= ~A~0.base ~queue~0.base)))) (<= 1 ~start~0) (= ~ok~0 1)), Black: 2664#(or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~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)))) (<= ~N~0 ~i~0)), Black: 2706#(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)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~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 (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 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)))) (<= ~N~0 ~i~0)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (forall ((v_~i~0_484 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2732#(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)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~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 (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (forall ((v_~i~0_484 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 1535#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (<= ~end~0 ~start~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), 2017#(<= 0 ~i~0), 1710#true, Black: 1048#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)))) (= ~ok~0 1)), Black: 1753#(and (<= ~i~0 1) (<= 2 ~N~0)), Black: 1054#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0)))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0))) (<= ~end~0 ~start~0))), Black: 896#(= ~ok~0 1), Black: 1831#true, Black: 965#(or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0)))), Black: 1042#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (forall ((~queue~0.offset 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_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0))))), 1176#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0))) (<= ~end~0 ~start~0)), Black: 1010#(and (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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 (= ~start~0 0))) (<= ~end~0 0))) (= ~start~0 ~end~0) (= ~i~0 0) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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 (= ~end~0 1))) (or (and (<= 0 ~queue~0.offset) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~end~0 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (or (not (<= ~end~0 1)) (and (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))) (= ~ok~0 1)), Black: 1040#(and (or (< ~start~0 0) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4))) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), Black: 1000#(and (or (< ~last~0 (+ ~v_old~0 1)) (not (< ~end~0 ~n~0))) (or (forall ((~queue~0.offset 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_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (<= ~n~0 ~start~0) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)))) (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (<= ~end~0 0)) (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)))) (= ~last~0 ~v_old~0)))) (or (not (<= ~end~0 1)) (and (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))) (or (and (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~start~0 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (and (<= ~start~0 1) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< 0 (+ ~start~0 1)) (not (= ~start~0 0)))) (= ~ok~0 1)), Black: 860#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (= ~ok~0 1)), Black: 1034#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 1020#(and (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (or (and (<= 0 ~queue~0.offset) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~end~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (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 (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0) (= ~last~0 ~v_old~0)) (not (= ~start~0 0))) (<= ~end~0 0))) (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)))) (not (= ~end~0 1)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0) (= ~last~0 ~v_old~0))))) (or (< ~start~0 0) (< ~last~0 (+ ~v_old~0 1)) (not (< ~end~0 ~n~0))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (not (<= ~end~0 1)) (and (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))) (or (< ~start~0 0) (forall ((~queue~0.offset 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_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), Black: 1006#(and (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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 (= ~start~0 0))) (<= ~end~0 0))) (= ~start~0 ~end~0) (= ~i~0 0) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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 (= ~end~0 1))) (or (and (<= 0 ~queue~0.offset) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~end~0 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< ~start~0 0) (< ~last~0 (+ ~v_old~0 1)) (not (< ~end~0 ~n~0))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (or (not (<= ~end~0 1)) (and (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))) (= ~ok~0 1)), Black: 992#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (< ~start~0 ~n~0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< 0 (+ ~start~0 1)) (not (= ~start~0 0))) (and (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~start~0 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~end~0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1026#(and (or (<= ~n~0 ~start~0) (<= ~end~0 ~start~0) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)))) (or (and (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~start~0 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (and (<= ~start~0 1) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< 0 (+ ~start~0 1)) (not (= ~start~0 0)))) (= ~ok~0 1)), Black: 1036#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (forall ((~queue~0.offset 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_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)))) (= ~ok~0 1)), Black: 982#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)))) (= ~ok~0 1)), Black: 986#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= ~n~0 2) (= ~i~0 0) (< ~start~0 ~n~0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< 0 (+ ~start~0 1)) (not (= ~start~0 0))) (and (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~start~0 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~end~0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1028#(and (or (< ~start~0 0) (< ~last~0 (+ ~v_old~0 1)) (not (< ~end~0 ~n~0))) (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (or (and (<= 0 ~queue~0.offset) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~end~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (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 (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0) (= ~last~0 ~v_old~0)) (not (= ~start~0 0))) (<= ~end~0 0))) (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)))) (not (= ~end~0 1)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0) (= ~last~0 ~v_old~0))) (= ~ok~0 1))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (not (<= ~end~0 1)) (and (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))) (or (< ~start~0 0) (forall ((~queue~0.offset 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_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0)))), Black: 1052#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (not (= (mod ~ok~0 256) 0)))), Black: 1046#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (forall ((~queue~0.offset 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_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0)))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0))) (<= ~end~0 ~start~0))), Black: 477#true, Black: 479#(not (<= ~N~0 ~i~0)), 729#(<= ~end~0 ~start~0), Black: 512#(= |thread2Thread1of1ForFork1_~cond~0#1| 1), Black: 508#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 730#(<= ~end~0 (+ ~start~0 1)), Black: 1310#(= ~ok~0 1), Black: 1386#(and (or (< 3 (+ ~queue~0.offset (* ~start~0 4))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (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|) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~queue~0.offset 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 8) (= ~ok~0 1)), Black: 1376#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 8) (<= ~n~0 3))), Black: 1384#(and (or (< 3 (+ ~queue~0.offset (* ~start~0 4))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~queue~0.offset 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 8) (= ~ok~0 1)), Black: 1378#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 8) (<= ~n~0 3))), Black: 1382#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (or (and (= (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 (* ~start~0 4)) 0)) (and (= (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)))) (< 3 (+ ~queue~0.offset (* ~start~0 4))))) (= ~queue~0.offset 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 8) (= ~ok~0 1)), 846#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~i~0 ~N~0)), 2316#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0)))), 161#L104-2true, 940#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0))) (<= ~end~0 ~start~0)), Black: 1576#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 1) ~end~0) (= ~ok~0 1)), Black: 1609#(= ~ok~0 1), Black: 171#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 2225#(and (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (+ (* ~i~0 4) ~A~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 179#true, Black: 2369#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (forall ((~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 (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2233#(and (= ~queue~0.offset 0) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 181#(or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))), Black: 2458#(and (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2412#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (<= ~n~0 ~end~0)) (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2408#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (<= ~n~0 ~end~0)) (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), Black: 190#(= ~ok~0 1), Black: 2382#(and (or (<= ~n~0 ~start~0) (and (<= ~n~0 2) (<= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)))) (<= 0 ~start~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2388#(and (or (<= ~n~0 ~start~0) (and (<= ~n~0 2) (<= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)))) (<= 0 ~start~0) (<= (+ ~start~0 1) ~end~0) (or (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2436#(and (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2446#(and (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 2396#(and (or (<= ~n~0 ~start~0) (and (<= ~n~0 2) (<= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)))) (<= 0 ~start~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2484#(and (or (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0)))) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 411#(and (or (forall ((~queue~0.base Int)) (or (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~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)))))) (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0))) (or (forall ((~queue~0.base Int) (v_ArrVal_156 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (and (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), Black: 2236#(and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (* ~start~0 4) 4) (= ~queue~0.offset 0)), Black: 2452#(and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (or (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2418#(and (= ~queue~0.offset 0) (or (<= ~n~0 (+ ~end~0 1)) (forall ((v_~i~0_389 Int) (v_ArrVal_1052 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))))) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 2398#(and (or (<= ~n~0 ~start~0) (and (<= ~n~0 2) (<= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (<= 0 ~start~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (<= ~n~0 ~end~0) (= ~ok~0 1)), Black: 2380#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_~i~0_389 Int) (v_ArrVal_1052 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (forall ((v_~i~0_389 Int) (v_ArrVal_1052 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))))) (< ~end~0 0)) (= ~ok~0 1)), Black: 2442#(and (or (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2404#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4)))) (= ~A~0.offset 0) (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (<= ~n~0 2) (= ~start~0 ~end~0) (< ~start~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= ~last~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (<= 1 ~start~0) (not (= ~A~0.base ~queue~0.base)) (= ~ok~0 1)), Black: 2296#(= ~ok~0 1), Black: 1979#(and (or (and (= ~A~0.offset 0) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (and (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))))) (not (<= ~start~0 3))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 4)) (<= ~start~0 3)) (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~queue~0.offset 0) (or (not (<= ~start~0 3)) (and (= ~i~0 0) (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))) (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: 1894#(= ~ok~0 1), Black: 2384#(and (<= 0 ~start~0) (or (<= ~n~0 ~start~0) (and (or (= (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)))) (<= ~n~0 ~end~0)) (<= ~n~0 2) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2390#(and (or (<= ~n~0 ~start~0) (and (or (= (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)))) (<= ~n~0 ~end~0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0))) (or (<= ~n~0 ~start~0) (and (<= ~n~0 2) (<= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)))) (<= 0 ~start~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 1993#(and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~A~0.offset 0) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (<= ~start~0 3) (= ~ok~0 1)), Black: 2460#(and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))) (or (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= (* ~start~0 4) 4) (or (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 2638#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1997#(and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~A~0.offset 0) (= ~queue~0.offset 0) (exists ((~A~0.offset Int) (v_~i~0_358 Int) (~A~0.base Int)) (and (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_358 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_358 4) ~A~0.offset)) ~v_old~0) (not (= ~A~0.base ~queue~0.base)))) (<= ~start~0 3) (= ~ok~0 1)), Black: 2454#(and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (or (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (or (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 1981#(and (or (and (= ~A~0.offset 0) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (and (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))))) (not (<= ~start~0 3))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 4)) (<= ~start~0 3)) (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (or (not (<= ~start~0 3)) (and (= ~i~0 0) (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))) (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: 2410#(and (or (<= ~n~0 ~start~0) (and (<= ~n~0 2) (<= ~last~0 ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (<= 0 ~start~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (<= ~n~0 ~end~0) (= ~ok~0 1)), Black: 1989#(and (= ~A~0.offset 0) (= ~i~0 0) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))) (not (= ~A~0.base ~queue~0.base)))) (= (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) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (<= ~start~0 3) (= ~ok~0 1)), Black: 2434#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 1991#(and (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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_~#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: 421#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2444#(and (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), Black: 1985#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (<= ~end~0 ~start~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2710#(and (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (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)) (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 1224#(and (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (= ~i~0 0) (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 (not (<= ~end~0 0)) (and (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4))))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1987#(and (= ~start~0 ~end~0) (<= ~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_~#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: 2464#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~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 (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (forall ((~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 (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 409#(and (= ~A~0.offset 0) (= ~i~0 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (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|)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (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) (<= 1 ~end~0)), Black: 1234#(and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~ok~0 1)), Black: 2593#(= ~ok~0 1), Black: 2486#(and (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0)))) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 2744#(and (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 1146#(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_323 Int) (~A~0.base Int)) (and (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_323 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_323 4))) ~v_old~0))) (= ~ok~0 1)), Black: 401#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (and (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), Black: 2740#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 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)))) (<= ~N~0 ~i~0)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (+ ~queue~0.offset (* ~start~0 4)) 4) (= ~ok~0 1)), Black: 1099#(and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~A~0.offset 0) (= ~i~0 0) (= ~ok~0 1)), Black: 2478#(and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (or (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= (* ~start~0 4) 4) (or (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~queue~0.offset 0)), Black: 2708#(and (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (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)) (<= ~last~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))) ~v_old~0) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~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)))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2438#(and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (or (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 1113#(and (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (= ~ok~0 1)), Black: 2480#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (<= ~n~0 ~end~0)) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0)))) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 2716#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~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 (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (forall ((v_~i~0_484 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (<= 0 ~end~0))) (= ~ok~0 1)), 669#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1156#(= ~ok~0 1), Black: 1101#(and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~ok~0 1)), Black: 2673#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (= ~ok~0 1)), Black: 2422#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (<= ~n~0 ~end~0)) (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2448#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (<= ~n~0 ~end~0)) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (= ~queue~0.offset 0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0))) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 2770#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 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)))) (<= ~N~0 ~i~0)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2440#(and (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (or (<= ~n~0 ~start~0) (and (<= ~n~0 2) (<= ~last~0 ~v_old~0))) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 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)))) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (exists ((~i~0 Int) (~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~A~0.base) 0)) (not (= ~A~0.base ~queue~0.base)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2702#(and (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (<= ~N~0 0) (<= ~N~0 ~i~0)) (<= 0 ~queue~0.offset) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (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)))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (<= ~N~0 ~i~0)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4))) (= ~ok~0 1) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))), 1629#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0)))), Black: 2756#(and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (+ ~queue~0.offset (* ~start~0 4)) 4) (= ~ok~0 1)), Black: 1133#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~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)))))) (= ~ok~0 1)), Black: 2474#(and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (or (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#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| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (or (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2402#(and (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (or (<= ~n~0 (+ ~end~0 1)) (forall ((v_~i~0_389 Int) (v_ArrVal_1052 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))))) (= ~ok~0 1)), Black: 2472#(and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (or (and (not (< (+ ~start~0 1) ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0)))), Black: 2586#(and (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (<= ~start~0 1) (= ~queue~0.offset 0) (exists ((~i~0 Int) (~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~A~0.base) 0)) (not (= ~A~0.base ~queue~0.base)))) (<= 1 ~start~0) (= ~ok~0 1)), Black: 2374#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (= ~last~0 ~v_old~0) (<= (+ ~start~0 ~n~0) (+ ~end~0 2)) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~queue~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~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|)) (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: 2768#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (= ~ok~0 1)), Black: 2538#(and (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (<= 0 ~queue~0.offset) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4))) (= ~ok~0 1) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ 8 (* ~end~0 4)))), Black: 2376#(and (= ~A~0.offset 0) (<= ~n~0 2) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~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) (< ~i~0 ~N~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~0) (= ~end~0 (+ ~start~0 1)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2692#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~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)))) (<= ~N~0 ~i~0)) (= ~ok~0 1)), Black: 2428#(and (or (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (and (= (* ~end~0 4) 4) (<= ~last~0 ~v_old~0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2470#(and (or (forall ((v_~i~0_389 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_389 4))) ~last~0)))) (not (< ~i~0 ~N~0)) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~queue~0.offset 0) (or (and (= (* ~end~0 4) 4) (<= 1 ~ok~0) (<= ~last~0 ~v_old~0) (<= (div ~ok~0 256) 0) (= (* ~start~0 4) 4) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0))), Black: 2742#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (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)) (forall ((v_~i~0_484 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~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)))) (<= ~N~0 ~i~0)) (= ~ok~0 1)), Black: 2754#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 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)))) (<= ~N~0 ~i~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (= ~ok~0 1)), Black: 2392#(and (<= 0 ~start~0) (or (<= ~n~0 ~start~0) (and (or (= (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)))) (<= ~n~0 ~end~0)) (<= ~n~0 2) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2772#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 2540#(and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (and (<= 0 (+ ~queue~0.offset (* ~start~0 4))) (<= (+ (* ~n~0 4) ~queue~0.offset (* ~start~0 4)) (+ (* ~end~0 4) 4))) (not (= 4 (+ ~queue~0.offset (* ~end~0 4))))) (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (or (and (= (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|))) (<= ~n~0 ~end~0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~ok~0 1)), Black: 2683#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (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)) (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (= ~ok~0 1)), Black: 2698#(and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)) (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) 4)) (or (and (= (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|))) (<= ~n~0 ~end~0)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~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)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 2712#(and (or (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)) (or (<= ~n~0 ~end~0) (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))) ~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)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~ok~0 1)), Black: 2746#(and (or (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (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| ~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 (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 2738#(and (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (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)) (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (= ~ok~0 1)), Black: 2690#(and (or (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (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| ~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 (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (= ~ok~0 1)), Black: 2724#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~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)))) (<= ~N~0 ~i~0))), Black: 2688#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= ~n~0 2) (<= 0 ~start~0) (= ~i~0 0) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< ~start~0 ~n~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) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~0) (= ~end~0 (+ ~start~0 1)) (<= 2 ~N~0) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2718#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (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)) (forall ((v_~i~0_484 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~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)))) (<= ~N~0 ~i~0)) (= ~ok~0 1)), Black: 2560#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= ~n~0 2) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~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) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~0) (= ~end~0 (+ ~start~0 1)) (<= 2 ~N~0) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2704#(and (= ~A~0.offset 0) (<= ~n~0 2) (<= 0 ~start~0) (< ~start~0 ~n~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= ~last~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~0) (= ~end~0 (+ ~start~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (= ~A~0.base ~queue~0.base)) (= ~ok~0 1)), Black: 2679#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= ~n~0 2) (= ~start~0 ~end~0) (= ~i~0 0) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (= ~queue~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~0) (<= 2 ~N~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)))) (= ~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: 2714#(and (< 3 (+ ~queue~0.offset (* ~end~0 4))) (or (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)) (<= (+ (* ~n~0 4) ~queue~0.offset) 8) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) 4)) (or (and (= (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|))) (<= ~n~0 ~end~0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (exists ((~i~0 Int) (~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)) (<= (select (select |#memory_int| ~A~0.base) 0) ~v_old~0) (<= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (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)))) (= ~ok~0 1)), Black: 2734#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (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)) (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 2736#(and (<= 0 ~start~0) (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0))) (<= ~start~0 0) (or (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)) (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))) (<= ~n~0 ~end~0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (exists ((~i~0 Int) (~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)) (<= (select (select |#memory_int| ~A~0.base) 0) ~v_old~0) (<= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (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)))) (= ~ok~0 1)), Black: 2752#(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)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 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)))) (<= ~N~0 ~i~0)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (= ~ok~0 1)), Black: 2764#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (+ ~queue~0.offset (* ~start~0 4)) 4) (= ~ok~0 1)), Black: 2541#(and (or (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)) (<= ~last~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))) ~v_old~0) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (= ~ok~0 1)), Black: 2774#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~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)))) (<= ~N~0 ~i~0))), Black: 2758#(and (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (<= ~start~0 1) (= ~queue~0.offset 0) (exists ((~i~0 Int) (~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~A~0.base) 0)) (not (= ~A~0.base ~queue~0.base)))) (<= 1 ~start~0) (= ~ok~0 1)), Black: 2722#(and (or (<= ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= ~n~0 ~end~0)) (or (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (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| ~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 (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 2762#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_~i~0_484 Int)) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_484 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1115) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (<= ~N~0 0) (<= ~N~0 ~i~0)) (or (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (or (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_~i~0_484 Int)) (or (< (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_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~A~0.base) (+ (* v_~i~0_484 4) ~A~0.offset)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1116) ~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)))) (<= ~N~0 ~i~0)) (= ~ok~0 1))]) [2022-12-06 05:42:07,110 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 05:42:07,110 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:42:07,110 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:42:07,110 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:42:08,716 INFO L130 PetriNetUnfolder]: 14637/28948 cut-off events. [2022-12-06 05:42:08,717 INFO L131 PetriNetUnfolder]: For 1377262/1381377 co-relation queries the response was YES. [2022-12-06 05:42:09,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349809 conditions, 28948 events. 14637/28948 cut-off events. For 1377262/1381377 co-relation queries the response was YES. Maximal size of possible extension queue 1568. Compared 288061 event pairs, 2420 based on Foata normal form. 236/27579 useless extension candidates. Maximal degree in co-relation 349236. Up to 12487 conditions per place. [2022-12-06 05:42:09,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 394 places, 3721 transitions, 102116 flow [2022-12-06 05:42:09,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 10418 [2022-12-06 05:44:04,039 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:04,170 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:04,309 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:04,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:04,575 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:04,702 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:04,833 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:04,958 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:05,095 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:05,234 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:05,367 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:05,506 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:05,638 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:05,767 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:05,903 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:06,054 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:06,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:06,328 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:06,467 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:06,599 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:06,732 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:06,869 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:07,012 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:32,980 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:33,127 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:33,273 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:33,410 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:33,549 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:33,683 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:33,817 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:33,975 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:34,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:34,263 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:34,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:34,572 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:34,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:34,864 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:35,012 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:35,153 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:35,300 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:35,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:35,604 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:35,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:35,882 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:36,021 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:36,161 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:36,296 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:36,431 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:36,567 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= 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))) 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 05:44:36,735 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 05:44:36,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162482 [2022-12-06 05:44:36,735 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 3719 transitions, 103351 flow [2022-12-06 05:44:36,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 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 05:44:36,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:36,736 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 05:44:36,741 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 05:44:36,941 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 05:44:36,941 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 05:44:36,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:36,942 INFO L85 PathProgramCache]: Analyzing trace with hash -86556752, now seen corresponding path program 1 times [2022-12-06 05:44:36,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:36,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704403682] [2022-12-06 05:44:36,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:36,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:37,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:37,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704403682] [2022-12-06 05:44:37,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704403682] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:37,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906166972] [2022-12-06 05:44:37,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:37,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:37,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:37,987 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 05:44:37,988 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 05:44:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:38,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-06 05:44:38,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:38,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 34 treesize of output 32 [2022-12-06 05:44:38,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:38,325 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 56 treesize of output 55 [2022-12-06 05:44:38,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:38,681 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 05:44:38,705 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 05:44:38,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:39,731 INFO L321 Elim1Store]: treesize reduction 19, result has 95.7 percent of original size [2022-12-06 05:44:39,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 485 treesize of output 719 [2022-12-06 05:44:39,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:39,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 291 treesize of output 329 [2022-12-06 05:44:39,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:39,859 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 252 treesize of output 268 [2022-12-06 05:44:39,892 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:39,892 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 220 treesize of output 212 [2022-12-06 05:46:26,814 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 05:46:39,135 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 05:46:40,216 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. Received shutdown request... [2022-12-06 05:46:58,898 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 05:46:58,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 05:46:58,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 05:46:58,910 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 05:46:58,911 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:46:59,105 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 05:46:59,105 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 10 for 45ms.. [2022-12-06 05:46:59,106 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 05:46:59,106 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 05:46:59,107 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:59,109 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:46:59,109 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:46:59,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:46:59 BasicIcfg [2022-12-06 05:46:59,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:46:59,111 INFO L158 Benchmark]: Toolchain (without parser) took 819106.17ms. Allocated memory was 255.9MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 232.3MB in the beginning and 722.4MB in the end (delta: -490.2MB). Peak memory consumption was 4.5GB. Max. memory is 8.0GB. [2022-12-06 05:46:59,111 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 233.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:46:59,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.36ms. Allocated memory is still 255.9MB. Free memory was 232.3MB in the beginning and 219.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 05:46:59,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.23ms. Allocated memory is still 255.9MB. Free memory was 219.2MB in the beginning and 217.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:46:59,111 INFO L158 Benchmark]: Boogie Preprocessor took 19.51ms. Allocated memory is still 255.9MB. Free memory was 217.2MB in the beginning and 215.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:46:59,111 INFO L158 Benchmark]: RCFGBuilder took 552.96ms. Allocated memory is still 255.9MB. Free memory was 215.7MB in the beginning and 191.6MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 05:46:59,112 INFO L158 Benchmark]: TraceAbstraction took 818276.92ms. Allocated memory was 255.9MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 190.9MB in the beginning and 722.4MB in the end (delta: -531.5MB). Peak memory consumption was 4.5GB. Max. memory is 8.0GB. [2022-12-06 05:46:59,112 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.10ms. Allocated memory is still 255.9MB. Free memory is still 233.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.36ms. Allocated memory is still 255.9MB. Free memory was 232.3MB in the beginning and 219.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.23ms. Allocated memory is still 255.9MB. Free memory was 219.2MB in the beginning and 217.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.51ms. Allocated memory is still 255.9MB. Free memory was 217.2MB in the beginning and 215.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 552.96ms. Allocated memory is still 255.9MB. Free memory was 215.7MB in the beginning and 191.6MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 818276.92ms. Allocated memory was 255.9MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 190.9MB in the beginning and 722.4MB in the end (delta: -531.5MB). Peak memory consumption was 4.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 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: 40, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 36, dependent conditional: 0, dependent unconditional: 36, 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: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 2, dependent unconditional: 9, 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.3s, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, 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: 7, independent: 4, independent conditional: 4, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 8.2s, 91 PlacesBefore, 87 PlacesAfterwards, 165 TransitionsBefore, 161 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 996, independent: 916, independent conditional: 916, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 996, independent: 916, independent conditional: 916, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 999, independent: 916, independent conditional: 916, independent unconditional: 0, dependent: 83, dependent conditional: 83, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 999, independent: 916, independent conditional: 916, independent unconditional: 0, dependent: 83, dependent conditional: 83, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 999, independent: 913, independent conditional: 913, independent unconditional: 0, dependent: 79, dependent conditional: 79, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 25, Positive conditional cache size: 5, Positive unconditional cache size: 20, Negative cache size: 19, Negative conditional cache size: 8, 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: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 88 PlacesBefore, 88 PlacesAfterwards, 198 TransitionsBefore, 198 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 628, independent: 550, independent conditional: 550, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 628, independent: 550, independent conditional: 550, independent unconditional: 0, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 628, independent: 550, independent conditional: 550, independent unconditional: 0, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 628, independent: 550, independent conditional: 550, independent unconditional: 0, dependent: 78, dependent conditional: 0, dependent unconditional: 78, 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: 628, independent: 550, independent conditional: 550, independent unconditional: 0, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 25, Positive conditional cache size: 5, Positive unconditional cache size: 20, Negative cache size: 19, Negative conditional cache size: 8, 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: 2.3s, 108 PlacesBefore, 107 PlacesAfterwards, 282 TransitionsBefore, 281 TransitionsAfterwards, 1092 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1304, independent: 1204, independent conditional: 1204, independent unconditional: 0, dependent: 100, dependent conditional: 100, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1304, independent: 1204, independent conditional: 1104, independent unconditional: 100, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1304, independent: 1204, independent conditional: 1104, independent unconditional: 100, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1304, independent: 1204, independent conditional: 1104, independent unconditional: 100, dependent: 100, dependent conditional: 0, dependent unconditional: 100, 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: 1304, independent: 1204, independent conditional: 1104, independent unconditional: 100, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 29, Positive conditional cache size: 5, Positive unconditional cache size: 24, Negative cache size: 19, Negative conditional cache size: 8, 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.5s, 112 PlacesBefore, 111 PlacesAfterwards, 280 TransitionsBefore, 279 TransitionsAfterwards, 974 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1342, independent: 1222, independent conditional: 1222, independent unconditional: 0, dependent: 120, dependent conditional: 120, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1342, independent: 1222, independent conditional: 1214, independent unconditional: 8, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1342, independent: 1222, independent conditional: 1210, independent unconditional: 12, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1342, independent: 1222, independent conditional: 1210, independent unconditional: 12, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1342, independent: 1215, independent conditional: 1207, independent unconditional: 8, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 36, Positive conditional cache size: 8, Positive unconditional cache size: 28, Negative cache size: 19, Negative conditional cache size: 8, 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: 3.2s, 195 PlacesBefore, 189 PlacesAfterwards, 587 TransitionsBefore, 581 TransitionsAfterwards, 2018 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 86, independent conditional: 86, 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: 86, independent: 86, independent conditional: 86, 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: 86, independent: 86, independent conditional: 86, 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: 86, independent: 86, independent conditional: 86, 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: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 46, Positive conditional cache size: 14, Positive unconditional cache size: 32, Negative cache size: 19, Negative conditional cache size: 8, 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.8s, 206 PlacesBefore, 205 PlacesAfterwards, 792 TransitionsBefore, 791 TransitionsAfterwards, 2850 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 8, independent: 7, independent conditional: 7, 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): 76, Positive cache size: 57, Positive conditional cache size: 17, Positive unconditional cache size: 40, Negative cache size: 19, Negative conditional cache size: 8, 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, 218 PlacesBefore, 218 PlacesAfterwards, 992 TransitionsBefore, 992 TransitionsAfterwards, 3674 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): 76, Positive cache size: 57, Positive conditional cache size: 17, Positive unconditional cache size: 40, Negative cache size: 19, Negative conditional cache size: 8, 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: 2.8s, 235 PlacesBefore, 235 PlacesAfterwards, 1209 TransitionsBefore, 1209 TransitionsAfterwards, 4574 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 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: 3, independent: 0, independent conditional: 0, 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): 79, Positive cache size: 60, Positive conditional cache size: 20, Positive unconditional cache size: 40, Negative cache size: 19, Negative conditional cache size: 8, 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, 259 PlacesBefore, 259 PlacesAfterwards, 1388 TransitionsBefore, 1388 TransitionsAfterwards, 5398 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: 60, Positive conditional cache size: 20, Positive unconditional cache size: 40, Negative cache size: 19, Negative conditional cache size: 8, 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: 8.5s, 262 PlacesBefore, 262 PlacesAfterwards, 1458 TransitionsBefore, 1458 TransitionsAfterwards, 5592 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 80, Positive cache size: 61, Positive conditional cache size: 21, Positive unconditional cache size: 40, Negative cache size: 19, Negative conditional cache size: 8, 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, 264 PlacesBefore, 264 PlacesAfterwards, 1463 TransitionsBefore, 1463 TransitionsAfterwards, 5568 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): 80, Positive cache size: 61, Positive conditional cache size: 21, Positive unconditional cache size: 40, Negative cache size: 19, Negative conditional cache size: 8, 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, 290 PlacesBefore, 290 PlacesAfterwards, 1710 TransitionsBefore, 1710 TransitionsAfterwards, 6668 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): 80, Positive cache size: 61, Positive conditional cache size: 21, Positive unconditional cache size: 40, Negative cache size: 19, Negative conditional cache size: 8, 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.2s, 280 PlacesBefore, 279 PlacesAfterwards, 1411 TransitionsBefore, 1410 TransitionsAfterwards, 5396 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 68, Positive conditional cache size: 24, Positive unconditional cache size: 44, Negative cache size: 19, Negative conditional cache size: 8, 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, 269 PlacesBefore, 269 PlacesAfterwards, 1400 TransitionsBefore, 1400 TransitionsAfterwards, 5372 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: 68, Positive conditional cache size: 24, Positive unconditional cache size: 44, Negative cache size: 19, Negative conditional cache size: 8, 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: 7.2s, 237 PlacesBefore, 232 PlacesAfterwards, 1014 TransitionsBefore, 1010 TransitionsAfterwards, 4090 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 3, independent conditional: 3, 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): 93, Positive cache size: 74, Positive conditional cache size: 26, Positive unconditional cache size: 48, Negative cache size: 19, Negative conditional cache size: 8, 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, 204 PlacesBefore, 204 PlacesAfterwards, 919 TransitionsBefore, 919 TransitionsAfterwards, 3724 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): 93, Positive cache size: 74, Positive conditional cache size: 26, Positive unconditional cache size: 48, Negative cache size: 19, Negative conditional cache size: 8, 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: 3.8s, 304 PlacesBefore, 298 PlacesAfterwards, 1609 TransitionsBefore, 1603 TransitionsAfterwards, 5906 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, 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: 42, independent: 42, independent conditional: 42, 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: 42, independent: 42, independent conditional: 41, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 41, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 89, Positive conditional cache size: 34, Positive unconditional cache size: 55, Negative cache size: 19, Negative conditional cache size: 8, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 146.9s, 394 PlacesBefore, 392 PlacesAfterwards, 3721 TransitionsBefore, 3719 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 195, independent: 195, independent conditional: 195, 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: 195, independent: 195, independent conditional: 195, 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: 195, independent: 195, independent conditional: 195, 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: 195, independent: 195, independent conditional: 195, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 195, independent: 182, independent conditional: 182, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 102, Positive conditional cache size: 47, Positive unconditional cache size: 55, Negative cache size: 19, Negative conditional cache size: 8, 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 - 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 10 for 45ms.. - 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 10 for 45ms.. - 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 10 for 45ms.. - 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.2s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 348.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 94 mSolverCounterUnknown, 4607 SdHoareTripleChecker+Valid, 23.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4607 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 21.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 272 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 1535 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15256 IncrementalHoareTripleChecker+Invalid, 17157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1535 mSolverCounterUnsat, 4 mSDtfsCounter, 15256 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 912 GetRequests, 385 SyntacticMatches, 6 SemanticMatches, 521 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 6765 ImplicationChecksByTransitivity, 132.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103351occurred in iteration=24, InterpolantAutomatonStates: 381, 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.4s SatisfiabilityAnalysisTime, 84.7s InterpolantComputationTime, 759 NumberOfCodeBlocks, 759 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 945 ConstructedInterpolants, 91 QuantifiedInterpolants, 21924 SizeOfPredicates, 276 NumberOfNonLiveVariables, 4277 ConjunctsInSsa, 503 ConjunctsInUnsatCore, 54 InterpolantComputations, 11 PerfectInterpolantSequences, 72/173 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