/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 19:24:31,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 19:24:31,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 19:24:31,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 19:24:31,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 19:24:31,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 19:24:31,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 19:24:31,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 19:24:31,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 19:24:31,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 19:24:31,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 19:24:31,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 19:24:31,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 19:24:31,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 19:24:31,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 19:24:31,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 19:24:31,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 19:24:31,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 19:24:31,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 19:24:31,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 19:24:31,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 19:24:31,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 19:24:31,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 19:24:31,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 19:24:31,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 19:24:31,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 19:24:31,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 19:24:31,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 19:24:31,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 19:24:31,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 19:24:31,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 19:24:31,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 19:24:31,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 19:24:31,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 19:24:31,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 19:24:31,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 19:24:31,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 19:24:31,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 19:24:31,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 19:24:31,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 19:24:31,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 19:24:31,338 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-05 19:24:31,366 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 19:24:31,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 19:24:31,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 19:24:31,368 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 19:24:31,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 19:24:31,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 19:24:31,369 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 19:24:31,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 19:24:31,370 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 19:24:31,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 19:24:31,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 19:24:31,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 19:24:31,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 19:24:31,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 19:24:31,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 19:24:31,371 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 19:24:31,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 19:24:31,371 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 19:24:31,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 19:24:31,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 19:24:31,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 19:24:31,372 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 19:24:31,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 19:24:31,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:24:31,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 19:24:31,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 19:24:31,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 19:24:31,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 19:24:31,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 19:24:31,373 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 19:24:31,373 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 19:24:31,373 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-05 19:24:31,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 19:24:31,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 19:24:31,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 19:24:31,725 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 19:24:31,725 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 19:24:31,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-12-05 19:24:32,890 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 19:24:33,119 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 19:24:33,119 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-12-05 19:24:33,125 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6417062/69d7dd6fd8d64ed5882eb0f3b6f0748c/FLAG1e40fd5e5 [2022-12-05 19:24:33,136 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6417062/69d7dd6fd8d64ed5882eb0f3b6f0748c [2022-12-05 19:24:33,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 19:24:33,139 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 19:24:33,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 19:24:33,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 19:24:33,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 19:24:33,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:24:33" (1/1) ... [2022-12-05 19:24:33,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12597923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:24:33, skipping insertion in model container [2022-12-05 19:24:33,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:24:33" (1/1) ... [2022-12-05 19:24:33,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 19:24:33,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 19:24:33,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:24:33,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:24:33,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:24:33,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:24:33,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:24:33,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:24:33,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:24:33,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:24:33,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:24:33,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:24:33,294 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2924,2937] [2022-12-05 19:24:33,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:24:33,309 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 19:24:33,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:24:33,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:24:33,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:24:33,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:24:33,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:24:33,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:24:33,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:24:33,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:24:33,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:24:33,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:24:33,348 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2924,2937] [2022-12-05 19:24:33,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:24:33,363 INFO L208 MainTranslator]: Completed translation [2022-12-05 19:24:33,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:24:33 WrapperNode [2022-12-05 19:24:33,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 19:24:33,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 19:24:33,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 19:24:33,365 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 19:24:33,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:24:33" (1/1) ... [2022-12-05 19:24:33,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:24:33" (1/1) ... [2022-12-05 19:24:33,423 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-12-05 19:24:33,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 19:24:33,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 19:24:33,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 19:24:33,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 19:24:33,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:24:33" (1/1) ... [2022-12-05 19:24:33,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:24:33" (1/1) ... [2022-12-05 19:24:33,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:24:33" (1/1) ... [2022-12-05 19:24:33,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:24:33" (1/1) ... [2022-12-05 19:24:33,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:24:33" (1/1) ... [2022-12-05 19:24:33,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:24:33" (1/1) ... [2022-12-05 19:24:33,469 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:24:33" (1/1) ... [2022-12-05 19:24:33,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:24:33" (1/1) ... [2022-12-05 19:24:33,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 19:24:33,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 19:24:33,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 19:24:33,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 19:24:33,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:24:33" (1/1) ... [2022-12-05 19:24:33,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:24:33,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:24:33,508 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-05 19:24:33,534 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-05 19:24:33,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 19:24:33,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 19:24:33,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 19:24:33,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 19:24:33,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 19:24:33,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 19:24:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 19:24:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 19:24:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 19:24:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 19:24:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-05 19:24:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 19:24:33,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 19:24:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 19:24:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 19:24:33,552 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 19:24:33,708 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 19:24:33,710 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 19:24:33,996 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 19:24:34,118 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 19:24:34,118 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-05 19:24:34,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:24:34 BoogieIcfgContainer [2022-12-05 19:24:34,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 19:24:34,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 19:24:34,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 19:24:34,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 19:24:34,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 07:24:33" (1/3) ... [2022-12-05 19:24:34,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8f6551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:24:34, skipping insertion in model container [2022-12-05 19:24:34,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:24:33" (2/3) ... [2022-12-05 19:24:34,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8f6551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:24:34, skipping insertion in model container [2022-12-05 19:24:34,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:24:34" (3/3) ... [2022-12-05 19:24:34,132 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2022-12-05 19:24:34,147 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 19:24:34,147 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 19:24:34,147 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 19:24:34,209 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 19:24:34,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 173 transitions, 362 flow [2022-12-05 19:24:34,305 INFO L130 PetriNetUnfolder]: 15/171 cut-off events. [2022-12-05 19:24:34,305 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 19:24:34,312 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-05 19:24:34,312 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 173 transitions, 362 flow [2022-12-05 19:24:34,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2022-12-05 19:24:34,332 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 19:24:34,338 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@266f851, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 19:24:34,339 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 19:24:34,387 INFO L130 PetriNetUnfolder]: 15/162 cut-off events. [2022-12-05 19:24:34,388 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 19:24:34,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:24:34,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:24:34,389 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-05 19:24:34,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:24:34,393 INFO L85 PathProgramCache]: Analyzing trace with hash 398714232, now seen corresponding path program 1 times [2022-12-05 19:24:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:24:34,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916032168] [2022-12-05 19:24:34,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:24:34,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:24:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:24:35,248 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-05 19:24:35,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:24:35,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916032168] [2022-12-05 19:24:35,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916032168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:24:35,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:24:35,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 19:24:35,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298752670] [2022-12-05 19:24:35,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:24:35,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 19:24:35,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:24:35,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 19:24:35,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 19:24:35,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 173 [2022-12-05 19:24:35,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 163 transitions, 338 flow. Second operand has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 0 states have call successors, (0), 0 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-05 19:24:35,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:24:35,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 173 [2022-12-05 19:24:35,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:24:35,597 INFO L130 PetriNetUnfolder]: 24/231 cut-off events. [2022-12-05 19:24:35,597 INFO L131 PetriNetUnfolder]: For 17/21 co-relation queries the response was YES. [2022-12-05 19:24:35,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 231 events. 24/231 cut-off events. For 17/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 425 event pairs, 11 based on Foata normal form. 12/217 useless extension candidates. Maximal degree in co-relation 206. Up to 68 conditions per place. [2022-12-05 19:24:35,602 INFO L137 encePairwiseOnDemand]: 153/173 looper letters, 55 selfloop transitions, 6 changer transitions 11/162 dead transitions. [2022-12-05 19:24:35,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 162 transitions, 480 flow [2022-12-05 19:24:35,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:24:35,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:24:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 976 transitions. [2022-12-05 19:24:35,623 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6268464996788696 [2022-12-05 19:24:35,625 INFO L175 Difference]: Start difference. First operand has 155 places, 163 transitions, 338 flow. Second operand 9 states and 976 transitions. [2022-12-05 19:24:35,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 162 transitions, 480 flow [2022-12-05 19:24:35,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 162 transitions, 472 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 19:24:35,634 INFO L231 Difference]: Finished difference. Result has 163 places, 148 transitions, 324 flow [2022-12-05 19:24:35,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=324, PETRI_PLACES=163, PETRI_TRANSITIONS=148} [2022-12-05 19:24:35,639 INFO L294 CegarLoopForPetriNet]: 155 programPoint places, 8 predicate places. [2022-12-05 19:24:35,639 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 148 transitions, 324 flow [2022-12-05 19:24:35,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 0 states have call successors, (0), 0 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-05 19:24:35,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:24:35,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:24:35,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 19:24:35,641 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-05 19:24:35,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:24:35,641 INFO L85 PathProgramCache]: Analyzing trace with hash 52056631, now seen corresponding path program 1 times [2022-12-05 19:24:35,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:24:35,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54805020] [2022-12-05 19:24:35,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:24:35,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:24:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:24:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:24:35,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:24:35,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54805020] [2022-12-05 19:24:35,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54805020] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:24:35,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924140925] [2022-12-05 19:24:35,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:24:35,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:24:35,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:24:35,879 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-05 19:24:35,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-05 19:24:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:24:36,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 19:24:36,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:24:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:24:36,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:24:36,565 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-05 19:24:36,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924140925] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 19:24:36,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 19:24:36,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 17 [2022-12-05 19:24:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530156582] [2022-12-05 19:24:36,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:24:36,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:24:36,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:24:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:24:36,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-12-05 19:24:36,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 173 [2022-12-05 19:24:36,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 148 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 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-05 19:24:36,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:24:36,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 173 [2022-12-05 19:24:36,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:24:36,781 INFO L130 PetriNetUnfolder]: 56/300 cut-off events. [2022-12-05 19:24:36,782 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 19:24:36,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 300 events. 56/300 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 855 event pairs, 12 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 334. Up to 47 conditions per place. [2022-12-05 19:24:36,784 INFO L137 encePairwiseOnDemand]: 163/173 looper letters, 46 selfloop transitions, 10 changer transitions 0/162 dead transitions. [2022-12-05 19:24:36,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 162 transitions, 466 flow [2022-12-05 19:24:36,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 19:24:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 19:24:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1266 transitions. [2022-12-05 19:24:36,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7317919075144509 [2022-12-05 19:24:36,788 INFO L175 Difference]: Start difference. First operand has 163 places, 148 transitions, 324 flow. Second operand 10 states and 1266 transitions. [2022-12-05 19:24:36,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 162 transitions, 466 flow [2022-12-05 19:24:36,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 162 transitions, 450 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-12-05 19:24:36,792 INFO L231 Difference]: Finished difference. Result has 159 places, 151 transitions, 348 flow [2022-12-05 19:24:36,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=348, PETRI_PLACES=159, PETRI_TRANSITIONS=151} [2022-12-05 19:24:36,793 INFO L294 CegarLoopForPetriNet]: 155 programPoint places, 4 predicate places. [2022-12-05 19:24:36,793 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 151 transitions, 348 flow [2022-12-05 19:24:36,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 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-05 19:24:36,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:24:36,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:24:36,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-05 19:24:37,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:24:37,001 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-05 19:24:37,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:24:37,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1506998855, now seen corresponding path program 1 times [2022-12-05 19:24:37,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:24:37,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525915153] [2022-12-05 19:24:37,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:24:37,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:24:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:24:37,224 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-05 19:24:37,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:24:37,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525915153] [2022-12-05 19:24:37,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525915153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:24:37,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:24:37,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 19:24:37,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050219287] [2022-12-05 19:24:37,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:24:37,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 19:24:37,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:24:37,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 19:24:37,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 19:24:37,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 173 [2022-12-05 19:24:37,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 151 transitions, 348 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 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-05 19:24:37,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:24:37,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 173 [2022-12-05 19:24:37,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:24:37,366 INFO L130 PetriNetUnfolder]: 156/566 cut-off events. [2022-12-05 19:24:37,366 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-05 19:24:37,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 566 events. 156/566 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2608 event pairs, 14 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 850. Up to 141 conditions per place. [2022-12-05 19:24:37,372 INFO L137 encePairwiseOnDemand]: 167/173 looper letters, 44 selfloop transitions, 12 changer transitions 0/181 dead transitions. [2022-12-05 19:24:37,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 181 transitions, 548 flow [2022-12-05 19:24:37,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 19:24:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 19:24:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 743 transitions. [2022-12-05 19:24:37,374 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8589595375722543 [2022-12-05 19:24:37,374 INFO L175 Difference]: Start difference. First operand has 159 places, 151 transitions, 348 flow. Second operand 5 states and 743 transitions. [2022-12-05 19:24:37,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 181 transitions, 548 flow [2022-12-05 19:24:37,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 181 transitions, 538 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-05 19:24:37,378 INFO L231 Difference]: Finished difference. Result has 161 places, 161 transitions, 439 flow [2022-12-05 19:24:37,379 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=439, PETRI_PLACES=161, PETRI_TRANSITIONS=161} [2022-12-05 19:24:37,379 INFO L294 CegarLoopForPetriNet]: 155 programPoint places, 6 predicate places. [2022-12-05 19:24:37,380 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 161 transitions, 439 flow [2022-12-05 19:24:37,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 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-05 19:24:37,380 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:24:37,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:24:37,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 19:24:37,381 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-05 19:24:37,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:24:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash 350913761, now seen corresponding path program 2 times [2022-12-05 19:24:37,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:24:37,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421868503] [2022-12-05 19:24:37,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:24:37,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:24:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:24:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:24:37,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:24:37,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421868503] [2022-12-05 19:24:37,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421868503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:24:37,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:24:37,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 19:24:37,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509796169] [2022-12-05 19:24:37,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:24:37,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 19:24:37,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:24:37,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 19:24:37,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 19:24:37,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 173 [2022-12-05 19:24:37,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 161 transitions, 439 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 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-05 19:24:37,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:24:37,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 173 [2022-12-05 19:24:37,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:24:37,791 INFO L130 PetriNetUnfolder]: 106/512 cut-off events. [2022-12-05 19:24:37,791 INFO L131 PetriNetUnfolder]: For 470/489 co-relation queries the response was YES. [2022-12-05 19:24:37,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 512 events. 106/512 cut-off events. For 470/489 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2374 event pairs, 11 based on Foata normal form. 8/501 useless extension candidates. Maximal degree in co-relation 909. Up to 100 conditions per place. [2022-12-05 19:24:37,795 INFO L137 encePairwiseOnDemand]: 168/173 looper letters, 51 selfloop transitions, 2 changer transitions 4/177 dead transitions. [2022-12-05 19:24:37,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 177 transitions, 641 flow [2022-12-05 19:24:37,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 19:24:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 19:24:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-12-05 19:24:37,797 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7560693641618497 [2022-12-05 19:24:37,797 INFO L175 Difference]: Start difference. First operand has 161 places, 161 transitions, 439 flow. Second operand 5 states and 654 transitions. [2022-12-05 19:24:37,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 177 transitions, 641 flow [2022-12-05 19:24:37,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 177 transitions, 641 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 19:24:37,803 INFO L231 Difference]: Finished difference. Result has 168 places, 162 transitions, 455 flow [2022-12-05 19:24:37,803 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=455, PETRI_PLACES=168, PETRI_TRANSITIONS=162} [2022-12-05 19:24:37,804 INFO L294 CegarLoopForPetriNet]: 155 programPoint places, 13 predicate places. [2022-12-05 19:24:37,804 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 162 transitions, 455 flow [2022-12-05 19:24:37,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 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-05 19:24:37,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:24:37,805 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:24:37,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 19:24:37,805 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-05 19:24:37,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:24:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1987507947, now seen corresponding path program 1 times [2022-12-05 19:24:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:24:37,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11561161] [2022-12-05 19:24:37,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:24:37,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:24:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:24:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:24:38,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:24:38,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11561161] [2022-12-05 19:24:38,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11561161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:24:38,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:24:38,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 19:24:38,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967343345] [2022-12-05 19:24:38,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:24:38,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 19:24:38,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:24:38,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 19:24:38,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 19:24:38,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 173 [2022-12-05 19:24:38,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 162 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 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-05 19:24:38,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:24:38,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 173 [2022-12-05 19:24:38,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:24:38,155 INFO L130 PetriNetUnfolder]: 79/472 cut-off events. [2022-12-05 19:24:38,155 INFO L131 PetriNetUnfolder]: For 458/486 co-relation queries the response was YES. [2022-12-05 19:24:38,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 472 events. 79/472 cut-off events. For 458/486 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1957 event pairs, 11 based on Foata normal form. 11/463 useless extension candidates. Maximal degree in co-relation 914. Up to 107 conditions per place. [2022-12-05 19:24:38,159 INFO L137 encePairwiseOnDemand]: 166/173 looper letters, 28 selfloop transitions, 6 changer transitions 2/172 dead transitions. [2022-12-05 19:24:38,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 172 transitions, 584 flow [2022-12-05 19:24:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 19:24:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 19:24:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2022-12-05 19:24:38,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8882466281310212 [2022-12-05 19:24:38,161 INFO L175 Difference]: Start difference. First operand has 168 places, 162 transitions, 455 flow. Second operand 3 states and 461 transitions. [2022-12-05 19:24:38,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 172 transitions, 584 flow [2022-12-05 19:24:38,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 172 transitions, 578 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 19:24:38,167 INFO L231 Difference]: Finished difference. Result has 166 places, 163 transitions, 477 flow [2022-12-05 19:24:38,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=166, PETRI_TRANSITIONS=163} [2022-12-05 19:24:38,168 INFO L294 CegarLoopForPetriNet]: 155 programPoint places, 11 predicate places. [2022-12-05 19:24:38,168 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 477 flow [2022-12-05 19:24:38,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 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-05 19:24:38,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:24:38,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:24:38,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 19:24:38,169 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-05 19:24:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:24:38,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1601152898, now seen corresponding path program 1 times [2022-12-05 19:24:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:24:38,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368446759] [2022-12-05 19:24:38,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:24:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:24:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:24:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:24:38,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:24:38,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368446759] [2022-12-05 19:24:38,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368446759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:24:38,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:24:38,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 19:24:38,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325927741] [2022-12-05 19:24:38,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:24:38,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 19:24:38,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:24:38,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 19:24:38,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 19:24:38,322 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 173 [2022-12-05 19:24:38,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 477 flow. Second operand has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 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-05 19:24:38,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:24:38,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 173 [2022-12-05 19:24:38,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:24:38,478 INFO L130 PetriNetUnfolder]: 75/593 cut-off events. [2022-12-05 19:24:38,479 INFO L131 PetriNetUnfolder]: For 540/573 co-relation queries the response was YES. [2022-12-05 19:24:38,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 593 events. 75/593 cut-off events. For 540/573 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2552 event pairs, 15 based on Foata normal form. 15/581 useless extension candidates. Maximal degree in co-relation 825. Up to 108 conditions per place. [2022-12-05 19:24:38,483 INFO L137 encePairwiseOnDemand]: 163/173 looper letters, 39 selfloop transitions, 8 changer transitions 23/190 dead transitions. [2022-12-05 19:24:38,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 190 transitions, 719 flow [2022-12-05 19:24:38,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:24:38,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:24:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1217 transitions. [2022-12-05 19:24:38,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.781631342324984 [2022-12-05 19:24:38,486 INFO L175 Difference]: Start difference. First operand has 166 places, 163 transitions, 477 flow. Second operand 9 states and 1217 transitions. [2022-12-05 19:24:38,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 190 transitions, 719 flow [2022-12-05 19:24:38,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 190 transitions, 713 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 19:24:38,491 INFO L231 Difference]: Finished difference. Result has 175 places, 164 transitions, 499 flow [2022-12-05 19:24:38,492 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=499, PETRI_PLACES=175, PETRI_TRANSITIONS=164} [2022-12-05 19:24:38,492 INFO L294 CegarLoopForPetriNet]: 155 programPoint places, 20 predicate places. [2022-12-05 19:24:38,493 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 164 transitions, 499 flow [2022-12-05 19:24:38,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 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-05 19:24:38,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:24:38,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:24:38,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 19:24:38,494 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-05 19:24:38,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:24:38,494 INFO L85 PathProgramCache]: Analyzing trace with hash 527125831, now seen corresponding path program 1 times [2022-12-05 19:24:38,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:24:38,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098351440] [2022-12-05 19:24:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:24:38,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:24:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:24:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:24:40,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:24:40,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098351440] [2022-12-05 19:24:40,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098351440] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:24:40,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841110175] [2022-12-05 19:24:40,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:24:40,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:24:40,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:24:40,385 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-05 19:24:40,415 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-05 19:24:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:24:40,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-05 19:24:40,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:24:42,498 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 15 treesize of output 7 [2022-12-05 19:24:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:24:42,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:24:43,056 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-12-05 19:24:43,057 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 74 treesize of output 103 [2022-12-05 19:24:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:24:44,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841110175] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:24:44,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:24:44,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 18] total 57 [2022-12-05 19:24:44,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616558212] [2022-12-05 19:24:44,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:24:44,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-12-05 19:24:44,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:24:44,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-12-05 19:24:44,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=2690, Unknown=0, NotChecked=0, Total=3192 [2022-12-05 19:24:44,173 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 173 [2022-12-05 19:24:44,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 164 transitions, 499 flow. Second operand has 57 states, 57 states have (on average 53.824561403508774) internal successors, (3068), 57 states have internal predecessors, (3068), 0 states have call successors, (0), 0 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-05 19:24:44,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:24:44,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 173 [2022-12-05 19:24:44,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:24:49,056 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-05 19:24:52,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 19:24:55,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 19:25:00,302 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-05 19:25:02,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 19:25:04,357 INFO L130 PetriNetUnfolder]: 6087/11517 cut-off events. [2022-12-05 19:25:04,358 INFO L131 PetriNetUnfolder]: For 9990/9990 co-relation queries the response was YES. [2022-12-05 19:25:04,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30131 conditions, 11517 events. 6087/11517 cut-off events. For 9990/9990 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 96372 event pairs, 391 based on Foata normal form. 2/11096 useless extension candidates. Maximal degree in co-relation 22100. Up to 1816 conditions per place. [2022-12-05 19:25:04,440 INFO L137 encePairwiseOnDemand]: 127/173 looper letters, 562 selfloop transitions, 237 changer transitions 143/982 dead transitions. [2022-12-05 19:25:04,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 982 transitions, 5796 flow [2022-12-05 19:25:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-12-05 19:25:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2022-12-05 19:25:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 5840 transitions. [2022-12-05 19:25:04,461 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3277400527526797 [2022-12-05 19:25:04,461 INFO L175 Difference]: Start difference. First operand has 175 places, 164 transitions, 499 flow. Second operand 103 states and 5840 transitions. [2022-12-05 19:25:04,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 982 transitions, 5796 flow [2022-12-05 19:25:04,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 982 transitions, 5764 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-05 19:25:04,500 INFO L231 Difference]: Finished difference. Result has 318 places, 409 transitions, 2560 flow [2022-12-05 19:25:04,500 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=103, PETRI_FLOW=2560, PETRI_PLACES=318, PETRI_TRANSITIONS=409} [2022-12-05 19:25:04,501 INFO L294 CegarLoopForPetriNet]: 155 programPoint places, 163 predicate places. [2022-12-05 19:25:04,501 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 409 transitions, 2560 flow [2022-12-05 19:25:04,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 53.824561403508774) internal successors, (3068), 57 states have internal predecessors, (3068), 0 states have call successors, (0), 0 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-05 19:25:04,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:25:04,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:25:04,514 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-05 19:25:04,709 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-05 19:25:04,709 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-05 19:25:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:25:04,710 INFO L85 PathProgramCache]: Analyzing trace with hash 600958245, now seen corresponding path program 2 times [2022-12-05 19:25:04,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:25:04,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072665646] [2022-12-05 19:25:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:25:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:25:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:25:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:25:06,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:25:06,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072665646] [2022-12-05 19:25:06,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072665646] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:25:06,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448885934] [2022-12-05 19:25:06,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 19:25:06,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:25:06,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:25:06,459 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-05 19:25:06,479 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-05 19:25:06,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 19:25:06,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:25:06,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-05 19:25:06,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:25:06,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-05 19:25:06,940 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-05 19:25:06,940 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 11 treesize of output 11 [2022-12-05 19:25:12,036 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-05 19:25:12,037 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-05 19:25:12,045 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-05 19:25:12,274 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-05 19:25:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:25:12,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:25:12,723 WARN L837 $PredicateComparison]: unable to prove that (or (< c_~start~0 0) (and (forall ((v_ArrVal_162 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1))) (not (= (mod c_~ok~0 256) 0))) (<= c_~n~0 c_~start~0)) is different from false [2022-12-05 19:25:12,990 INFO L321 Elim1Store]: treesize reduction 19, result has 62.7 percent of original size [2022-12-05 19:25:12,990 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 73 treesize of output 72 [2022-12-05 19:25:12,996 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 33 treesize of output 27 [2022-12-05 19:25:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:25:14,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448885934] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:25:14,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:25:14,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28, 27] total 71 [2022-12-05 19:25:14,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659624188] [2022-12-05 19:25:14,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:25:14,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-12-05 19:25:14,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:25:14,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-12-05 19:25:14,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=4317, Unknown=3, NotChecked=136, Total=4970 [2022-12-05 19:25:14,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 173 [2022-12-05 19:25:14,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 409 transitions, 2560 flow. Second operand has 71 states, 71 states have (on average 44.070422535211264) internal successors, (3129), 71 states have internal predecessors, (3129), 0 states have call successors, (0), 0 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-05 19:25:14,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:25:14,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 173 [2022-12-05 19:25:14,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:25:25,971 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-05 19:25:31,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 19:25:35,540 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-05 19:25:49,739 INFO L130 PetriNetUnfolder]: 10120/18849 cut-off events. [2022-12-05 19:25:49,740 INFO L131 PetriNetUnfolder]: For 109553/109641 co-relation queries the response was YES. [2022-12-05 19:25:49,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77548 conditions, 18849 events. 10120/18849 cut-off events. For 109553/109641 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 166960 event pairs, 1091 based on Foata normal form. 205/18900 useless extension candidates. Maximal degree in co-relation 77467. Up to 3102 conditions per place. [2022-12-05 19:25:49,968 INFO L137 encePairwiseOnDemand]: 115/173 looper letters, 621 selfloop transitions, 432 changer transitions 95/1182 dead transitions. [2022-12-05 19:25:49,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 1182 transitions, 10340 flow [2022-12-05 19:25:49,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-12-05 19:25:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2022-12-05 19:25:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 5182 transitions. [2022-12-05 19:25:49,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26985366869759936 [2022-12-05 19:25:49,978 INFO L175 Difference]: Start difference. First operand has 318 places, 409 transitions, 2560 flow. Second operand 111 states and 5182 transitions. [2022-12-05 19:25:49,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 1182 transitions, 10340 flow [2022-12-05 19:25:50,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 1182 transitions, 9641 flow, removed 331 selfloop flow, removed 24 redundant places. [2022-12-05 19:25:50,630 INFO L231 Difference]: Finished difference. Result has 425 places, 648 transitions, 5608 flow [2022-12-05 19:25:50,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=111, PETRI_FLOW=5608, PETRI_PLACES=425, PETRI_TRANSITIONS=648} [2022-12-05 19:25:50,631 INFO L294 CegarLoopForPetriNet]: 155 programPoint places, 270 predicate places. [2022-12-05 19:25:50,631 INFO L495 AbstractCegarLoop]: Abstraction has has 425 places, 648 transitions, 5608 flow [2022-12-05 19:25:50,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 44.070422535211264) internal successors, (3129), 71 states have internal predecessors, (3129), 0 states have call successors, (0), 0 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-05 19:25:50,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:25:50,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:25:50,638 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-05 19:25:50,833 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-05 19:25:50,833 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-05 19:25:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:25:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash 325288169, now seen corresponding path program 3 times [2022-12-05 19:25:50,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:25:50,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512758861] [2022-12-05 19:25:50,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:25:50,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:25:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:25:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:25:53,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:25:53,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512758861] [2022-12-05 19:25:53,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512758861] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:25:53,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135834242] [2022-12-05 19:25:53,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 19:25:53,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:25:53,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:25:53,364 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-05 19:25:53,367 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-05 19:25:53,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-05 19:25:53,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:25:53,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-05 19:25:53,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:25:54,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 19:25:54,931 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-05 19:25:55,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 19:25:55,415 INFO L321 Elim1Store]: treesize reduction 37, result has 7.5 percent of original size [2022-12-05 19:25:55,416 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 38 treesize of output 13 [2022-12-05 19:25:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:25:55,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:25:56,637 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-12-05 19:25:56,637 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 258 treesize of output 255 [2022-12-05 19:25:56,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:25:56,660 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-05 19:25:56,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:25:56,673 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-05 19:25:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:25:59,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135834242] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:25:59,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:25:59,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33, 28] total 79 [2022-12-05 19:25:59,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525041365] [2022-12-05 19:25:59,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:25:59,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-12-05 19:25:59,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:25:59,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-12-05 19:25:59,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=590, Invalid=5563, Unknown=9, NotChecked=0, Total=6162 [2022-12-05 19:25:59,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 173 [2022-12-05 19:25:59,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 648 transitions, 5608 flow. Second operand has 79 states, 79 states have (on average 46.53164556962025) internal successors, (3676), 79 states have internal predecessors, (3676), 0 states have call successors, (0), 0 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-05 19:25:59,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:25:59,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 173 [2022-12-05 19:25:59,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:26:05,981 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (* c_~end~0 4)) (.cse7 (* c_~start~0 4))) (let ((.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0)) (.cse3 (not (= (mod c_~ok~0 256) 0))) (.cse4 (= .cse12 .cse7)) (.cse2 (< c_~start~0 0)) (.cse5 (<= c_~n~0 c_~start~0))) (and (or .cse0 .cse1 .cse2 (and .cse3 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse4) .cse5) (or .cse0 .cse1 (and (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse3 .cse4) .cse2 .cse5) (= c_~ok~0 1) (or (not (< c_~end~0 c_~n~0)) (not (<= c_~last~0 |c_thread1Thread1of1ForFork0_#t~mem1#1|)) .cse2 (not (<= 0 c_~end~0)) (let ((.cse9 (+ c_~A~0.offset (* c_~i~0 4))) (.cse10 (+ .cse12 c_~queue~0.offset))) (and (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195))) (let ((.cse6 (select .cse8 ~queue~0.base))) (or (< c_~v_old~0 (+ (select .cse6 (+ .cse7 c_~queue~0.offset)) 1)) (not (= (select (select .cse8 c_~A~0.base) .cse9) (select .cse6 .cse10))))))) (or .cse3 (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195))) (= (select (select .cse11 c_~A~0.base) .cse9) (select (select .cse11 ~queue~0.base) .cse10)))))))) (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0))) .cse5) (<= c_~start~0 c_~end~0) (or .cse0 .cse1 (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) .cse3 .cse4 (< c_~v_old~0 (+ c_~last~0 1))) .cse2 .cse5) (<= c_~end~0 c_~start~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|)))) is different from false [2022-12-05 19:26:09,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 19:26:45,864 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse17 (* c_~end~0 4)) (.cse16 (* c_~start~0 4))) (let ((.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0)) (.cse4 (= .cse17 .cse16)) (.cse8 (not (< c_~end~0 c_~n~0))) (.cse2 (< c_~start~0 0)) (.cse3 (not (= (mod c_~ok~0 256) 0))) (.cse6 (+ .cse17 c_~queue~0.offset)) (.cse7 (+ .cse16 c_~queue~0.offset)) (.cse12 (+ c_~A~0.offset (* c_~i~0 4))) (.cse9 (not (<= 0 c_~end~0))) (.cse5 (<= c_~n~0 c_~start~0))) (and (or .cse0 .cse1 .cse2 (and .cse3 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse4) .cse5) (<= c_~v_old~0 c_~new~0) (or .cse0 .cse1 (and (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse3 .cse4) .cse2 .cse5) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or .cse0 .cse1 (and (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret13#1.base|)) .cse3 .cse4) .cse2 .cse5) (or (not (= .cse6 0)) (= .cse7 0) (and (<= (+ c_~start~0 c_~n~0) (+ c_~end~0 1)) (<= c_~end~0 c_~start~0))) (not (= |c_ULTIMATE.start_main_#t~ret13#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (= c_~ok~0 1) (or (<= .cse6 0) (<= c_~n~0 1)) (= c_~queue~0.offset 0) (or .cse8 (not (<= c_~last~0 |c_thread1Thread1of1ForFork0_#t~mem1#1|)) .cse2 .cse9 (and (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195))) (let ((.cse10 (select .cse11 ~queue~0.base))) (or (< c_~v_old~0 (+ (select .cse10 .cse7) 1)) (not (= (select (select .cse11 c_~A~0.base) .cse12) (select .cse10 .cse6))))))) (or .cse3 (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195))) (= (select (select .cse13 c_~A~0.base) .cse12) (select (select .cse13 ~queue~0.base) .cse6))))))) (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0))) .cse5) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (or .cse0 .cse1 .cse2 (and (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse3 .cse4) .cse5) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or .cse8 .cse2 (let ((.cse14 (select (select |c_#memory_int| c_~A~0.base) .cse12))) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse6) .cse14))) .cse3) (forall ((~queue~0.base Int)) (let ((.cse15 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse15 .cse6) .cse14)) (< c_~v_old~0 (+ (select .cse15 .cse7) 1))))))) .cse9 (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0) .cse5) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))) is different from false [2022-12-05 19:26:51,877 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (not (< c_~end~0 c_~n~0))) (.cse1 (< c_~start~0 0)) (.cse0 (not (= (mod c_~ok~0 256) 0))) (.cse8 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse5 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse7 (+ c_~A~0.offset (* c_~i~0 4))) (.cse3 (not (<= 0 c_~end~0))) (.cse10 (<= c_~n~0 c_~start~0))) (and (or (< 0 c_~end~0) (< 0 c_~start~0) (< c_~end~0 0) (and (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) .cse0) .cse1) (or .cse2 (not (<= c_~last~0 |c_thread1Thread1of1ForFork0_#t~mem1#1|)) .cse1 .cse3 (and (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195))) (let ((.cse4 (select .cse6 ~queue~0.base))) (or (< c_~v_old~0 (+ (select .cse4 .cse5) 1)) (not (= (select (select .cse6 c_~A~0.base) .cse7) (select .cse4 .cse8))))))) (or .cse0 (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195))) (= (select (select .cse9 c_~A~0.base) .cse7) (select (select .cse9 ~queue~0.base) .cse8))))))) (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0))) .cse10) (or .cse2 .cse1 (let ((.cse11 (select (select |c_#memory_int| c_~A~0.base) .cse7))) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse8) .cse11))) .cse0) (forall ((~queue~0.base Int)) (let ((.cse12 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse12 .cse8) .cse11)) (< c_~v_old~0 (+ (select .cse12 .cse5) 1))))))) .cse3 (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0) .cse10))) is different from false [2022-12-05 19:26:55,799 INFO L130 PetriNetUnfolder]: 18236/34059 cut-off events. [2022-12-05 19:26:55,799 INFO L131 PetriNetUnfolder]: For 340416/340840 co-relation queries the response was YES. [2022-12-05 19:26:56,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191321 conditions, 34059 events. 18236/34059 cut-off events. For 340416/340840 co-relation queries the response was YES. Maximal size of possible extension queue 1638. Compared 327176 event pairs, 1997 based on Foata normal form. 57/34027 useless extension candidates. Maximal degree in co-relation 191136. Up to 12726 conditions per place. [2022-12-05 19:26:56,466 INFO L137 encePairwiseOnDemand]: 120/173 looper letters, 1029 selfloop transitions, 863 changer transitions 212/2140 dead transitions. [2022-12-05 19:26:56,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 2140 transitions, 24734 flow [2022-12-05 19:26:56,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2022-12-05 19:26:56,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2022-12-05 19:26:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 9223 transitions. [2022-12-05 19:26:56,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28509165095360267 [2022-12-05 19:26:56,486 INFO L175 Difference]: Start difference. First operand has 425 places, 648 transitions, 5608 flow. Second operand 187 states and 9223 transitions. [2022-12-05 19:26:56,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 2140 transitions, 24734 flow [2022-12-05 19:26:58,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 2140 transitions, 23636 flow, removed 431 selfloop flow, removed 53 redundant places. [2022-12-05 19:26:58,491 INFO L231 Difference]: Finished difference. Result has 644 places, 1218 transitions, 14200 flow [2022-12-05 19:26:58,492 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=5130, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=366, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=187, PETRI_FLOW=14200, PETRI_PLACES=644, PETRI_TRANSITIONS=1218} [2022-12-05 19:26:58,493 INFO L294 CegarLoopForPetriNet]: 155 programPoint places, 489 predicate places. [2022-12-05 19:26:58,493 INFO L495 AbstractCegarLoop]: Abstraction has has 644 places, 1218 transitions, 14200 flow [2022-12-05 19:26:58,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 46.53164556962025) internal successors, (3676), 79 states have internal predecessors, (3676), 0 states have call successors, (0), 0 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-05 19:26:58,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:26:58,495 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:26:58,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-05 19:26:58,700 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-05 19:26:58,700 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-05 19:26:58,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:26:58,701 INFO L85 PathProgramCache]: Analyzing trace with hash 123571955, now seen corresponding path program 4 times [2022-12-05 19:26:58,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:26:58,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981361485] [2022-12-05 19:26:58,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:26:58,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:26:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:26:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:26:58,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:26:58,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981361485] [2022-12-05 19:26:58,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981361485] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:26:58,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088850582] [2022-12-05 19:26:58,906 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 19:26:58,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:26:58,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:26:58,908 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-05 19:26:58,911 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-05 19:26:59,008 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 19:26:59,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:26:59,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-05 19:26:59,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:26:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:26:59,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:26:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:26:59,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088850582] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:26:59,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:26:59,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 10 [2022-12-05 19:26:59,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152987644] [2022-12-05 19:26:59,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:26:59,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 19:26:59,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:26:59,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 19:26:59,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-12-05 19:26:59,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 173 [2022-12-05 19:26:59,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 1218 transitions, 14200 flow. Second operand has 10 states, 10 states have (on average 143.1) internal successors, (1431), 10 states have internal predecessors, (1431), 0 states have call successors, (0), 0 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-05 19:26:59,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:26:59,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 173 [2022-12-05 19:26:59,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:27:14,614 INFO L130 PetriNetUnfolder]: 15989/38386 cut-off events. [2022-12-05 19:27:14,614 INFO L131 PetriNetUnfolder]: For 1244010/1247596 co-relation queries the response was YES. [2022-12-05 19:27:15,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299646 conditions, 38386 events. 15989/38386 cut-off events. For 1244010/1247596 co-relation queries the response was YES. Maximal size of possible extension queue 1359. Compared 435974 event pairs, 5527 based on Foata normal form. 1221/38795 useless extension candidates. Maximal degree in co-relation 299104. Up to 12565 conditions per place. [2022-12-05 19:27:15,881 INFO L137 encePairwiseOnDemand]: 164/173 looper letters, 502 selfloop transitions, 283 changer transitions 0/1479 dead transitions. [2022-12-05 19:27:15,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 1479 transitions, 19770 flow [2022-12-05 19:27:15,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:27:15,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:27:15,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1172 transitions. [2022-12-05 19:27:15,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.846820809248555 [2022-12-05 19:27:15,883 INFO L175 Difference]: Start difference. First operand has 644 places, 1218 transitions, 14200 flow. Second operand 8 states and 1172 transitions. [2022-12-05 19:27:15,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 1479 transitions, 19770 flow [2022-12-05 19:27:26,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 1479 transitions, 18081 flow, removed 739 selfloop flow, removed 74 redundant places. [2022-12-05 19:27:26,478 INFO L231 Difference]: Finished difference. Result has 543 places, 1367 transitions, 16244 flow [2022-12-05 19:27:26,479 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=12414, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=924, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=16244, PETRI_PLACES=543, PETRI_TRANSITIONS=1367} [2022-12-05 19:27:26,479 INFO L294 CegarLoopForPetriNet]: 155 programPoint places, 388 predicate places. [2022-12-05 19:27:26,480 INFO L495 AbstractCegarLoop]: Abstraction has has 543 places, 1367 transitions, 16244 flow [2022-12-05 19:27:26,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 143.1) internal successors, (1431), 10 states have internal predecessors, (1431), 0 states have call successors, (0), 0 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-05 19:27:26,480 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:27:26,480 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:27:26,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-05 19:27:26,681 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-05 19:27:26,681 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-05 19:27:26,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:27:26,682 INFO L85 PathProgramCache]: Analyzing trace with hash -175968906, now seen corresponding path program 5 times [2022-12-05 19:27:26,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:27:26,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543913952] [2022-12-05 19:27:26,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:27:26,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:27:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:27:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-05 19:27:26,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:27:26,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543913952] [2022-12-05 19:27:26,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543913952] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:27:26,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777333733] [2022-12-05 19:27:26,833 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-05 19:27:26,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:27:26,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:27:26,835 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-05 19:27:26,837 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-05 19:27:26,918 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 19:27:26,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:27:26,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 19:27:26,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:27:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-05 19:27:26,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:27:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-05 19:27:27,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777333733] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:27:27,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:27:27,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-05 19:27:27,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586345775] [2022-12-05 19:27:27,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:27:27,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 19:27:27,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:27:27,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 19:27:27,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-05 19:27:27,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 173 [2022-12-05 19:27:27,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 1367 transitions, 16244 flow. Second operand has 9 states, 9 states have (on average 141.88888888888889) internal successors, (1277), 9 states have internal predecessors, (1277), 0 states have call successors, (0), 0 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-05 19:27:27,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:27:27,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 173 [2022-12-05 19:27:27,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:27:35,399 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([498] L49-5-->L59: Formula: (= v_~i~0_21 (+ v_~i~0_22 1)) InVars {~i~0=v_~i~0_22} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_1|, ~i~0=v_~i~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0][578], [Black: 3252#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< ~start~0 0) (< 0 ~start~0) (and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (= (* ~start~0 4) (* ~end~0 4))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (not (= (mod ~ok~0 256) 0)))))), Black: 3248#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 3199#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~start~0 1) ~end~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 3240#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~v_old~0 ~new~0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (not (= |ULTIMATE.start_main_#t~ret12#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4)))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (< ~start~0 0) (< 0 ~start~0) (= (* ~start~0 4) (* ~end~0 4))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~ok~0 1)), Black: 3167#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), Black: 3095#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~ok~0 1)), Black: 3165#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= ~ok~0 1)), Black: 3222#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (exists ((~A~0.offset Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))), Black: 3283#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|)))), Black: 3161#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~ok~0 1)), Black: 3220#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~ok~0 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 3151#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= ~n~0 1) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~ok~0 1)), Black: 3261#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 3234#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 3257#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (< ~start~0 0) (< 0 ~start~0) (= (* ~start~0 4) (* ~end~0 4))) (= ~ok~0 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|)))), Black: 4754#(and (<= ~end~0 ~start~0) (<= ~N~0 ~i~0)), Black: 4752#(<= ~end~0 (+ ~start~0 1)), Black: 4755#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (<= ~end~0 ~start~0) (<= ~N~0 ~i~0)), Black: 4753#(and (<= ~end~0 (+ ~start~0 1)) (<= ~N~0 ~i~0)), Black: 4375#(and (<= ~start~0 ~end~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1) (or (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~ok~0 1)), Black: 4453#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (or (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~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)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (or (< ~start~0 0) (and (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (not (= (mod ~ok~0 256) 0))) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0))), Black: 4393#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 4500#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|)), Black: 4570#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~last~0 ~v_old~0)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4622#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (or (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~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)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< ~start~0 0) (and (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (not (= (mod ~ok~0 256) 0))) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0))), Black: 4600#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (or (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~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)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (and (= (* ~start~0 4) (* ~end~0 4)) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= (mod ~ok~0 256) 0))) (< ~start~0 0) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= (mod ~ok~0 256) 0))) (< ~end~0 0) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~end~0 0) (and (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0))) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~end~0 0) (and (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0))) (<= ~n~0 ~end~0)) (= ~ok~0 1) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4437#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~last~0 ~v_old~0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4553#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2019#(and (or (and (< ~v_old~0 (+ ~last~0 1)) (= (* ~start~0 4) (* ~end~0 4))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 4486#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (or (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~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)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|)), Black: 1997#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (and (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 4367#(and (<= ~start~0 ~end~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~end~0 ~start~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 ~last~0) (or (= ~last~0 ~v_old~0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~queue~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1) (= ~ok~0 1)), Black: 4544#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 2009#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (and (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 4395#(and (<= ~start~0 ~end~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 ~last~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1) (or (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~ok~0 1)), Black: 1979#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (or (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~ok~0 1)), Black: 3923#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 2025#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (and (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< ~v_old~0 (+ ~last~0 1)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 2017#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (and (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 3943#(or (<= ~n~0 ~start~0) (< ~start~0 0) (and (or (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~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))), Black: 4373#(and (<= ~start~0 ~end~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (<= ~end~0 ~start~0) (or (< ~end~0 0) (and (< ~v_old~0 (+ ~last~0 1)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (= ~ok~0 1)), Black: 1989#(and (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (< ~v_old~0 (+ ~last~0 1)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (= ~ok~0 1)), Black: 2031#(and (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (= (* ~start~0 4) (* ~end~0 4)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 4397#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (or (< ~v_old~0 (+ ~last~0 1)) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 1965#(and (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), Black: 2049#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (= ~ok~0 1)), 44#L102-4true, Black: 4377#(and (<= ~start~0 ~end~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~end~0 ~start~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 ~last~0) (or (= ~last~0 ~v_old~0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1) (= ~ok~0 1)), Black: 4586#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~start~0 0) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0) (not (= (mod ~ok~0 256) 0)))), Black: 1971#(and (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (< ~v_old~0 (+ ~last~0 1)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 4478#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2027#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (and (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 4594#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< ~start~0 0) (and (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (not (= (mod ~ok~0 256) 0))) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0))), Black: 4606#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~last~0 ~v_old~0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 2003#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 1947#(and (<= ~start~0 ~end~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~end~0 ~start~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ ~start~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~end~0)) (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 4596#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 2055#(and (or (and (< ~v_old~0 (+ ~last~0 1)) (= (* ~start~0 4) (* ~end~0 4))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (= ~ok~0 1)), Black: 4195#(or (< ~start~0 0) (and (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (not (= (mod ~ok~0 256) 0))) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0)), Black: 4391#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (or (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~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)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (<= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (and (< ~v_old~0 (+ ~last~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~ok~0 256) 0))) (< ~start~0 0) (< ~end~0 0) (<= ~n~0 ~end~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~end~0 ~start~0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= (mod ~ok~0 256) 0))) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~end~0 0) (and (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0))) (<= ~n~0 ~end~0)) (= ~ok~0 1)), Black: 4433#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (or (< ~v_old~0 (+ ~last~0 1)) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 2065#(and (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (= (* ~start~0 4) (* ~end~0 4)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (= ~ok~0 1)), Black: 4413#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 4431#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~last~0 ~v_old~0)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 4389#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 3351#true, Black: 1949#(and (<= ~start~0 ~end~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~end~0 ~start~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 4447#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4512#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4490#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1967#(and (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= ~n~0 1) (= ~ok~0 1)), Black: 4540#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|)) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< ~start~0 0) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0)) (<= ~v_old~0 ~new~0) (not (= (mod ~ok~0 256) 0))), Black: 1969#(and (<= ~start~0 ~end~0) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= ~n~0 1) (= ~ok~0 1)), 1001#true, Black: 4371#(and (<= ~start~0 ~end~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1) (or (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~ok~0 1)), Black: 2047#(and (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (= (* ~start~0 4) (* ~end~0 4)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 1941#(and (<= ~start~0 ~end~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~end~0 ~start~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 2041#(and (or (and (< ~v_old~0 (+ ~last~0 1)) (= (* ~start~0 4) (* ~end~0 4))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2035#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (< ~v_old~0 (+ ~last~0 1)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~ok~0 1)), Black: 4508#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< ~start~0 0) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0)) (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 3927#(or (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 2073#(and (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (= ~ok~0 1)), Black: 4568#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~last~0 ~v_old~0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 2015#(and (exists ((~A~0.offset Int) (v_~end~0_54 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 v_~end~0_54) (<= v_~end~0_54 ~start~0) (<= ~start~0 v_~end~0_54) (<= v_~end~0_54 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_54 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (= ~ok~0 1)), Black: 1973#(and (<= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= ~n~0 1) (= ~ok~0 1)), Black: 4522#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~v_old~0 (+ ~last~0 1)) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1977#(and (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (exists ((~A~0.offset Int) (v_~end~0_54 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 v_~end~0_54) (<= v_~end~0_54 ~start~0) (<= ~start~0 v_~end~0_54) (<= v_~end~0_54 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_54 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (= ~ok~0 1)), Black: 4484#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~last~0 ~v_old~0)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), 8#L59true, Black: 1981#(and (exists ((~A~0.offset Int) (v_~end~0_54 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 v_~end~0_54) (<= v_~end~0_54 ~start~0) (<= ~start~0 v_~end~0_54) (<= v_~end~0_54 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_54 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (= ~ok~0 1)), Black: 4530#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1943#(and (<= ~start~0 ~end~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~end~0 ~start~0) (<= (+ ~start~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~end~0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 2053#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (< ~v_old~0 (+ ~last~0 1)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (= ~ok~0 1)), Black: 2013#(and (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 4399#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 2005#(and (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (exists ((~A~0.offset Int) (v_~end~0_54 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 v_~end~0_54) (<= v_~end~0_54 ~start~0) (<= ~start~0 v_~end~0_54) (<= v_~end~0_54 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_54 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~last~0 ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (= ~ok~0 1)), Black: 4526#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~last~0 ~v_old~0)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4580#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4443#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 4472#(and (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< ~start~0 0) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0)) (<= ~v_old~0 ~new~0) (not (= (mod ~ok~0 256) 0))), Black: 4514#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4538#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4532#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4494#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4467#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 4423#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), 3353#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|), Black: 4459#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0))) (= ~queue~0.offset 0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4504#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~v_old~0 (+ ~last~0 1)) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4496#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4415#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4429#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 4425#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), 46#L79true, Black: 179#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 954#(and (<= ~i~0 0) (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~i~0 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~i~0 ~N~0))), Black: 956#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 963#(and (<= 1 |thread2Thread1of1ForFork1_~cond~0#1|) (<= (div |thread2Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 962#(or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))), 190#true, Black: 965#(and (<= 1 |thread2Thread1of1ForFork1_~cond~0#1|) (or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))) (<= (div |thread2Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 971#(= ~ok~0 1), Black: 983#(or (not (<= 0 ~start~0)) (<= ~n~0 ~start~0) (<= ~end~0 ~start~0)), 6062#(= |thread2Thread1of1ForFork1_~cond~0#1| 1), Black: 994#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 3163#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), 4751#(<= ~end~0 ~start~0), Black: 3265#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~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))))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 3281#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~v_old~0 ~new~0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (< ~start~0 0) (< 0 ~start~0) (= (* ~start~0 4) (* ~end~0 4))) (= ~ok~0 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|)))), Black: 3175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= ~ok~0 1)), Black: 3153#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), Black: 3246#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~ok~0 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|)))), Black: 3285#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|)))), 3093#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)), Black: 3267#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~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))))) (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 3169#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), Black: 3177#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= ~ok~0 1)), Black: 3226#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~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))))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 3230#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (< ~start~0 0) (< 0 ~start~0) (= (* ~start~0 4) (* ~end~0 4))) (= ~ok~0 1)), Black: 3197#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~start~0 1) ~end~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (exists ((~A~0.offset Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))), Black: 3254#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~v_old~0 ~new~0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (< ~start~0 0) (< 0 ~start~0) (= (* ~start~0 4) (* ~end~0 4))) (= ~ok~0 1)), 960#true, Black: 3244#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 3228#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~v_old~0 ~new~0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (not (= |ULTIMATE.start_main_#t~ret12#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4)))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (< ~start~0 0) (< 0 ~start~0) (= (* ~start~0 4) (* ~end~0 4))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (< ~v_old~0 (+ ~last~0 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~ok~0 1)), Black: 3210#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~start~0 1) ~end~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 3179#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~ok~0 1))]) [2022-12-05 19:27:35,415 INFO L382 tUnfolder$Statistics]: this new event has 144 ancestors and is cut-off event [2022-12-05 19:27:35,416 INFO L385 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-12-05 19:27:35,416 INFO L385 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-12-05 19:27:35,416 INFO L385 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-12-05 19:27:38,294 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([498] L49-5-->L59: Formula: (= v_~i~0_21 (+ v_~i~0_22 1)) InVars {~i~0=v_~i~0_22} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_1|, ~i~0=v_~i~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0][578], [Black: 3252#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< ~start~0 0) (< 0 ~start~0) (and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (= (* ~start~0 4) (* ~end~0 4))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (not (= (mod ~ok~0 256) 0)))))), Black: 3248#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 3199#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~start~0 1) ~end~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 3240#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~v_old~0 ~new~0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (not (= |ULTIMATE.start_main_#t~ret12#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4)))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (< ~start~0 0) (< 0 ~start~0) (= (* ~start~0 4) (* ~end~0 4))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~ok~0 1)), Black: 3167#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), Black: 3095#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~ok~0 1)), Black: 3165#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= ~ok~0 1)), Black: 3222#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (exists ((~A~0.offset Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))), Black: 3283#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|)))), Black: 3161#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~ok~0 1)), Black: 3220#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~ok~0 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 3151#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= ~n~0 1) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~ok~0 1)), Black: 3261#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 3234#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 3257#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (< ~start~0 0) (< 0 ~start~0) (= (* ~start~0 4) (* ~end~0 4))) (= ~ok~0 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|)))), Black: 4754#(and (<= ~end~0 ~start~0) (<= ~N~0 ~i~0)), Black: 4752#(<= ~end~0 (+ ~start~0 1)), Black: 4755#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (<= ~end~0 ~start~0) (<= ~N~0 ~i~0)), Black: 4753#(and (<= ~end~0 (+ ~start~0 1)) (<= ~N~0 ~i~0)), Black: 4375#(and (<= ~start~0 ~end~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1) (or (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~ok~0 1)), Black: 4453#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (or (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~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)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (or (< ~start~0 0) (and (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (not (= (mod ~ok~0 256) 0))) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0))), Black: 4393#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 4500#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|)), Black: 4570#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~last~0 ~v_old~0)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4622#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (or (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~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)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< ~start~0 0) (and (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (not (= (mod ~ok~0 256) 0))) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0))), Black: 4600#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (or (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~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)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (and (= (* ~start~0 4) (* ~end~0 4)) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= (mod ~ok~0 256) 0))) (< ~start~0 0) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= (mod ~ok~0 256) 0))) (< ~end~0 0) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~end~0 0) (and (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0))) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~end~0 0) (and (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0))) (<= ~n~0 ~end~0)) (= ~ok~0 1) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4437#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~last~0 ~v_old~0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4553#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2019#(and (or (and (< ~v_old~0 (+ ~last~0 1)) (= (* ~start~0 4) (* ~end~0 4))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 4486#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (or (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~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)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|)), Black: 1997#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (and (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 4367#(and (<= ~start~0 ~end~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~end~0 ~start~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 ~last~0) (or (= ~last~0 ~v_old~0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~queue~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1) (= ~ok~0 1)), Black: 4544#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 2009#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (and (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 4395#(and (<= ~start~0 ~end~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 ~last~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1) (or (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~ok~0 1)), Black: 1979#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (or (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~ok~0 1)), Black: 3923#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 2025#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (and (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< ~v_old~0 (+ ~last~0 1)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 2017#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (and (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 3943#(or (<= ~n~0 ~start~0) (< ~start~0 0) (and (or (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~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))), Black: 4373#(and (<= ~start~0 ~end~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (<= ~end~0 ~start~0) (or (< ~end~0 0) (and (< ~v_old~0 (+ ~last~0 1)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~end~0)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (= ~ok~0 1)), Black: 1989#(and (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (< ~v_old~0 (+ ~last~0 1)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (= ~ok~0 1)), Black: 2031#(and (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (= (* ~start~0 4) (* ~end~0 4)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 4397#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (or (< ~v_old~0 (+ ~last~0 1)) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 1965#(and (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), Black: 2049#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (= ~ok~0 1)), Black: 4377#(and (<= ~start~0 ~end~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~end~0 ~start~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 ~last~0) (or (= ~last~0 ~v_old~0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1) (= ~ok~0 1)), Black: 1971#(and (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (< ~v_old~0 (+ ~last~0 1)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 4586#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~start~0 0) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0) (not (= (mod ~ok~0 256) 0)))), Black: 2027#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (and (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 4478#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4594#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< ~start~0 0) (and (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (not (= (mod ~ok~0 256) 0))) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0))), Black: 2003#(and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 4606#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~last~0 ~v_old~0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 1947#(and (<= ~start~0 ~end~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~end~0 ~start~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ ~start~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~end~0)) (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 4596#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4195#(or (< ~start~0 0) (and (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (not (= (mod ~ok~0 256) 0))) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0)), Black: 2055#(and (or (and (< ~v_old~0 (+ ~last~0 1)) (= (* ~start~0 4) (* ~end~0 4))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (= ~ok~0 1)), Black: 4391#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (or (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~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)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (<= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (and (< ~v_old~0 (+ ~last~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~ok~0 256) 0))) (< ~start~0 0) (< ~end~0 0) (<= ~n~0 ~end~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~end~0 ~start~0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= (mod ~ok~0 256) 0))) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~end~0 0) (and (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0))) (<= ~n~0 ~end~0)) (= ~ok~0 1)), Black: 2065#(and (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (= (* ~start~0 4) (* ~end~0 4)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (= ~ok~0 1)), Black: 4433#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (or (< ~v_old~0 (+ ~last~0 1)) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 4413#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 4431#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~last~0 ~v_old~0)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 4389#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 3351#true, Black: 1949#(and (<= ~start~0 ~end~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~end~0 ~start~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 4447#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4512#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4490#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1967#(and (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= ~n~0 1) (= ~ok~0 1)), Black: 4540#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|)) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< ~start~0 0) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0)) (<= ~v_old~0 ~new~0) (not (= (mod ~ok~0 256) 0))), Black: 1969#(and (<= ~start~0 ~end~0) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= ~n~0 1) (= ~ok~0 1)), 1001#true, Black: 4371#(and (<= ~start~0 ~end~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1) (or (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~ok~0 1)), Black: 2047#(and (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (= (* ~start~0 4) (* ~end~0 4)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 1941#(and (<= ~start~0 ~end~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~end~0 ~start~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 2041#(and (or (and (< ~v_old~0 (+ ~last~0 1)) (= (* ~start~0 4) (* ~end~0 4))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2035#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (< ~v_old~0 (+ ~last~0 1)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~ok~0 1)), Black: 4508#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< ~start~0 0) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0)) (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 3927#(or (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 2073#(and (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (= ~ok~0 1)), Black: 2015#(and (exists ((~A~0.offset Int) (v_~end~0_54 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 v_~end~0_54) (<= v_~end~0_54 ~start~0) (<= ~start~0 v_~end~0_54) (<= v_~end~0_54 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_54 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (= ~ok~0 1)), Black: 4568#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~last~0 ~v_old~0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 1973#(and (<= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= ~n~0 1) (= ~ok~0 1)), Black: 4522#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~v_old~0 (+ ~last~0 1)) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1977#(and (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (exists ((~A~0.offset Int) (v_~end~0_54 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 v_~end~0_54) (<= v_~end~0_54 ~start~0) (<= ~start~0 v_~end~0_54) (<= v_~end~0_54 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_54 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (= ~ok~0 1)), 8#L59true, Black: 4484#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~last~0 ~v_old~0)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 1981#(and (exists ((~A~0.offset Int) (v_~end~0_54 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 v_~end~0_54) (<= v_~end~0_54 ~start~0) (<= ~start~0 v_~end~0_54) (<= v_~end~0_54 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_54 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (= ~ok~0 1)), Black: 4530#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1943#(and (<= ~start~0 ~end~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~end~0 ~start~0) (<= (+ ~start~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~end~0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 2053#(and (or (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= ~end~0 ~start~0)) (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (or (< ~v_old~0 (+ ~last~0 1)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|))) (= ~ok~0 1)), Black: 4399#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 2013#(and (or (< 0 ~end~0) (= (* ~start~0 4) (* ~end~0 4)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2005#(and (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (exists ((~A~0.offset Int) (v_~end~0_54 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 0 v_~end~0_54) (<= v_~end~0_54 ~start~0) (<= ~start~0 v_~end~0_54) (<= v_~end~0_54 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_54 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~last~0 ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (= ~ok~0 1)), Black: 4526#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~last~0 ~v_old~0)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4580#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4443#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 4472#(and (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< ~start~0 0) (< ~end~0 0) (< 0 ~start~0) (< 0 ~end~0)) (<= ~v_old~0 ~new~0) (not (= (mod ~ok~0 256) 0))), Black: 4514#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4538#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4532#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4494#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4467#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), Black: 4423#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0))), 3353#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|), Black: 4459#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0))) (= ~queue~0.offset 0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4504#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)) (forall ((v_ArrVal_195 (Array Int Int)) (~queue~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_195) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~v_old~0 (+ ~last~0 1)) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~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) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4496#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (v_~end~0_58 Int) (~A~0.base Int)) (and (<= 0 v_~end~0_58) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_58 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< v_~end~0_58 ~n~0) (<= v_~end~0_58 ~start~0))) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (not (= |ULTIMATE.start_main_#t~ret13#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4415#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~queue~0.offset 0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), Black: 4429#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |#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 (= (mod ~ok~0 256) 0))) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (< ~start~0 0) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 4425#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~end~0 0) (<= ~n~0 ~end~0) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (or (<= (+ ~queue~0.offset (* ~end~0 4)) 0) (<= ~n~0 1)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~end~0 0) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 ~end~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1) (or (not (<= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_#t~ret13#1.base|)) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= ~end~0 ~start~0)) (= (+ ~queue~0.offset (* ~start~0 4)) 0))), 46#L79true, 48#L103-1true, Black: 179#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 954#(and (<= ~i~0 0) (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~i~0 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~i~0 ~N~0))), Black: 956#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 963#(and (<= 1 |thread2Thread1of1ForFork1_~cond~0#1|) (<= (div |thread2Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 962#(or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))), 190#true, Black: 965#(and (<= 1 |thread2Thread1of1ForFork1_~cond~0#1|) (or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))) (<= (div |thread2Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 971#(= ~ok~0 1), Black: 983#(or (not (<= 0 ~start~0)) (<= ~n~0 ~start~0) (<= ~end~0 ~start~0)), 6062#(= |thread2Thread1of1ForFork1_~cond~0#1| 1), Black: 994#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 3163#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), 4751#(<= ~end~0 ~start~0), Black: 3265#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~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))))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 3281#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~v_old~0 ~new~0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (< ~start~0 0) (< 0 ~start~0) (= (* ~start~0 4) (* ~end~0 4))) (= ~ok~0 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|)))), Black: 3175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= ~ok~0 1)), Black: 3153#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), Black: 3246#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~ok~0 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|)))), Black: 3285#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 |thread1Thread1of1ForFork0_#t~mem1#1|)))), 3093#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)), Black: 3267#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~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))))) (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 3169#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), Black: 3177#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= ~ok~0 1)), Black: 3226#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_162 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) ~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))))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 3230#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (< ~start~0 0) (< 0 ~start~0) (= (* ~start~0 4) (* ~end~0 4))) (= ~ok~0 1)), Black: 3197#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~start~0 1) ~end~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (exists ((~A~0.offset Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))))))), Black: 3254#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~v_old~0 ~new~0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (< ~start~0 0) (< 0 ~start~0) (= (* ~start~0 4) (* ~end~0 4))) (= ~ok~0 1)), 960#true, Black: 3244#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 3228#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= ~n~0 ~start~0) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~v_old~0 ~new~0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (not (= |ULTIMATE.start_main_#t~ret12#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4)))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|) 0))) (< ~start~0 0) (< 0 ~start~0) (= (* ~start~0 4) (* ~end~0 4))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (and (< ~v_old~0 (+ ~last~0 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~ok~0 1)), Black: 3210#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~start~0 1) ~end~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 3179#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (= ~start~0 ~end~0) (or (<= ~n~0 ~start~0) (< ~start~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~ok~0 1))]) [2022-12-05 19:27:38,296 INFO L382 tUnfolder$Statistics]: this new event has 147 ancestors and is cut-off event [2022-12-05 19:27:38,296 INFO L385 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-12-05 19:27:38,296 INFO L385 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-12-05 19:27:38,296 INFO L385 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-12-05 19:27:45,266 INFO L130 PetriNetUnfolder]: 19002/44728 cut-off events. [2022-12-05 19:27:45,266 INFO L131 PetriNetUnfolder]: For 1312344/1317503 co-relation queries the response was YES. [2022-12-05 19:27:46,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342104 conditions, 44728 events. 19002/44728 cut-off events. For 1312344/1317503 co-relation queries the response was YES. Maximal size of possible extension queue 1665. Compared 514102 event pairs, 6385 based on Foata normal form. 1801/45749 useless extension candidates. Maximal degree in co-relation 340219. Up to 15319 conditions per place. [2022-12-05 19:27:46,915 INFO L137 encePairwiseOnDemand]: 167/173 looper letters, 904 selfloop transitions, 211 changer transitions 7/1815 dead transitions. [2022-12-05 19:27:46,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 1815 transitions, 25227 flow [2022-12-05 19:27:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:27:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:27:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1160 transitions. [2022-12-05 19:27:46,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.838150289017341 [2022-12-05 19:27:46,917 INFO L175 Difference]: Start difference. First operand has 543 places, 1367 transitions, 16244 flow. Second operand 8 states and 1160 transitions. [2022-12-05 19:27:46,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 1815 transitions, 25227 flow [2022-12-05 19:28:00,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 1815 transitions, 24939 flow, removed 131 selfloop flow, removed 2 redundant places. [2022-12-05 19:28:00,680 INFO L231 Difference]: Finished difference. Result has 553 places, 1434 transitions, 18099 flow [2022-12-05 19:28:00,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=16061, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=18099, PETRI_PLACES=553, PETRI_TRANSITIONS=1434} [2022-12-05 19:28:00,682 INFO L294 CegarLoopForPetriNet]: 155 programPoint places, 398 predicate places. [2022-12-05 19:28:00,682 INFO L495 AbstractCegarLoop]: Abstraction has has 553 places, 1434 transitions, 18099 flow [2022-12-05 19:28:00,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 141.88888888888889) internal successors, (1277), 9 states have internal predecessors, (1277), 0 states have call successors, (0), 0 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-05 19:28:00,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:28:00,683 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:28:00,691 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-05 19:28:00,888 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-05 19:28:00,889 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-05 19:28:00,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:28:00,889 INFO L85 PathProgramCache]: Analyzing trace with hash -946376336, now seen corresponding path program 6 times [2022-12-05 19:28:00,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:28:00,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755593721] [2022-12-05 19:28:00,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:28:00,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:28:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:28:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:28:04,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:28:04,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755593721] [2022-12-05 19:28:04,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755593721] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:28:04,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374587148] [2022-12-05 19:28:04,842 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-05 19:28:04,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:28:04,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:28:04,843 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-05 19:28:04,845 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-05 19:28:05,103 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-05 19:28:05,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:28:05,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-05 19:28:05,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:28:05,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-05 19:28:05,983 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 15 treesize of output 11 [2022-12-05 19:28:06,594 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-05 19:28:06,595 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 11 treesize of output 11 [2022-12-05 19:28:06,783 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:28:07,532 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-05 19:28:07,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 19:28:07,991 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-05 19:28:08,409 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-05 19:28:08,409 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 44 treesize of output 10 [2022-12-05 19:28:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:28:08,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:28:16,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:16,236 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 62 treesize of output 51 [2022-12-05 19:28:16,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:16,266 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 13558 treesize of output 12554 [2022-12-05 19:28:16,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:16,325 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 12534 treesize of output 9479 [2022-12-05 19:28:16,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:16,398 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 9462 treesize of output 7943 [2022-12-05 19:28:16,460 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:16,460 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 7926 treesize of output 7175 [2022-12-05 19:28:17,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:17,691 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 123 treesize of output 87 [2022-12-05 19:28:17,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:17,728 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 8540 treesize of output 7886 [2022-12-05 19:28:17,782 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:17,783 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 7836 treesize of output 6824 [2022-12-05 19:28:17,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:17,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 6780 treesize of output 5096 [2022-12-05 19:28:17,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:17,941 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 5052 treesize of output 4568 [2022-12-05 19:28:33,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:33,823 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 59 treesize of output 78 [2022-12-05 19:28:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:28:34,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374587148] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:28:34,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:28:34,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 97 [2022-12-05 19:28:34,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125870443] [2022-12-05 19:28:34,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:28:34,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-12-05 19:28:34,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:28:34,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-12-05 19:28:34,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=969, Invalid=8264, Unknown=79, NotChecked=0, Total=9312 [2022-12-05 19:28:34,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 173 [2022-12-05 19:28:34,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 1434 transitions, 18099 flow. Second operand has 97 states, 97 states have (on average 42.2680412371134) internal successors, (4100), 97 states have internal predecessors, (4100), 0 states have call successors, (0), 0 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-05 19:28:34,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:28:34,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 173 [2022-12-05 19:28:34,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:30:20,058 WARN L233 SmtUtils]: Spent 1.75m on a formula simplification. DAG size of input: 304 DAG size of output: 300 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:30:46,982 WARN L233 SmtUtils]: Spent 26.61s on a formula simplification that was a NOOP. DAG size: 274 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:31:07,535 WARN L233 SmtUtils]: Spent 6.51s on a formula simplification. DAG size of input: 116 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:31:09,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:31:11,644 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-05 19:31:17,397 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-05 19:31:21,131 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-05 19:31:23,144 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-05 19:31:25,168 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-05 19:31:31,847 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 118 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:31:36,713 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-05 19:31:38,738 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-05 19:31:43,221 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-05 19:31:45,479 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-05 19:31:47,505 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-05 19:31:49,857 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-05 19:31:51,924 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-05 19:31:54,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:31:56,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:31:58,446 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-05 19:32:06,831 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 74 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:32:14,964 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, 1] [2022-12-05 19:32:17,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:32:23,623 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, 1] [2022-12-05 19:32:25,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 19:33:47,712 WARN L233 SmtUtils]: Spent 1.35m on a formula simplification. DAG size of input: 304 DAG size of output: 253 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:33:49,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 19:33:51,977 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, 1] [2022-12-05 19:33:53,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 19:33:56,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 19:34:07,073 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 68 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:35:46,851 WARN L233 SmtUtils]: Spent 1.58m on a formula simplification. DAG size of input: 282 DAG size of output: 239 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:35:51,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:35:53,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:35:55,974 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-05 19:36:00,488 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]