/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking BOTH --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 20:05:41,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 20:05:41,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 20:05:41,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 20:05:41,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 20:05:41,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 20:05:41,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 20:05:41,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 20:05:41,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 20:05:41,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 20:05:41,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 20:05:41,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 20:05:41,160 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 20:05:41,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 20:05:41,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 20:05:41,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 20:05:41,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 20:05:41,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 20:05:41,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 20:05:41,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 20:05:41,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 20:05:41,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 20:05:41,162 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 20:05:41,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 20:05:41,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 20:05:41,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 20:05:41,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 20:05:41,163 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 20:05:41,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 20:05:41,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 20:05:41,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 20:05:41,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 20:05:41,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 20:05:41,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 20:05:41,164 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 20:05:41,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 20:05:41,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 20:05:41,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 20:05:41,165 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 20:05:41,165 INFO L153 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/UGemCutter-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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 20:05:41,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 20:05:41,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 20:05:41,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 20:05:41,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 20:05:41,335 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 20:05:41,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue.i [2024-05-07 20:05:42,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 20:05:42,734 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 20:05:42,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2024-05-07 20:05:42,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3f743c832/bd7e248c64374e34a56c2762f41a7e73/FLAGbc06c4a9b [2024-05-07 20:05:42,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3f743c832/bd7e248c64374e34a56c2762f41a7e73 [2024-05-07 20:05:42,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 20:05:42,776 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 20:05:42,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 20:05:42,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 20:05:42,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 20:05:42,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 08:05:42" (1/1) ... [2024-05-07 20:05:42,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9b3606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:05:42, skipping insertion in model container [2024-05-07 20:05:42,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 08:05:42" (1/1) ... [2024-05-07 20:05:42,837 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 20:05:43,185 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2024-05-07 20:05:43,190 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2024-05-07 20:05:43,192 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2024-05-07 20:05:43,195 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 20:05:43,213 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 20:05:43,273 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2024-05-07 20:05:43,274 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2024-05-07 20:05:43,276 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2024-05-07 20:05:43,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 20:05:43,347 INFO L206 MainTranslator]: Completed translation [2024-05-07 20:05:43,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:05:43 WrapperNode [2024-05-07 20:05:43,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 20:05:43,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 20:05:43,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 20:05:43,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 20:05:43,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:05:43" (1/1) ... [2024-05-07 20:05:43,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:05:43" (1/1) ... [2024-05-07 20:05:43,417 INFO L138 Inliner]: procedures = 275, calls = 71, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 260 [2024-05-07 20:05:43,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 20:05:43,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 20:05:43,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 20:05:43,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 20:05:43,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:05:43" (1/1) ... [2024-05-07 20:05:43,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:05:43" (1/1) ... [2024-05-07 20:05:43,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:05:43" (1/1) ... [2024-05-07 20:05:43,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:05:43" (1/1) ... [2024-05-07 20:05:43,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:05:43" (1/1) ... [2024-05-07 20:05:43,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:05:43" (1/1) ... [2024-05-07 20:05:43,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:05:43" (1/1) ... [2024-05-07 20:05:43,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:05:43" (1/1) ... [2024-05-07 20:05:43,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 20:05:43,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 20:05:43,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 20:05:43,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 20:05:43,473 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:05:43" (1/1) ... [2024-05-07 20:05:43,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 20:05:43,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 20:05:43,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 20:05:43,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 20:05:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-05-07 20:05:43,571 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-05-07 20:05:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-05-07 20:05:43,571 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-05-07 20:05:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 20:05:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 20:05:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-07 20:05:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 20:05:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 20:05:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-07 20:05:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 20:05:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 20:05:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 20:05:43,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 20:05:43,575 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 20:05:43,698 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 20:05:43,700 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 20:05:44,007 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 20:05:44,026 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 20:05:44,026 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-07 20:05:44,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 08:05:44 BoogieIcfgContainer [2024-05-07 20:05:44,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 20:05:44,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 20:05:44,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 20:05:44,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 20:05:44,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 08:05:42" (1/3) ... [2024-05-07 20:05:44,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b52e43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 08:05:44, skipping insertion in model container [2024-05-07 20:05:44,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:05:43" (2/3) ... [2024-05-07 20:05:44,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b52e43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 08:05:44, skipping insertion in model container [2024-05-07 20:05:44,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 08:05:44" (3/3) ... [2024-05-07 20:05:44,039 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2024-05-07 20:05:44,058 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 20:05:44,065 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 20:05:44,065 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-05-07 20:05:44,065 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 20:05:44,169 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-07 20:05:44,209 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 20:05:44,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 20:05:44,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 20:05:44,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 20:05:44,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 20:05:44,245 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 20:05:44,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:05:44,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 20:05:44,261 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1ae08a8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 20:05:44,262 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-07 20:05:44,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 20:05:44,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:05:44,304 INFO L85 PathProgramCache]: Analyzing trace with hash -913897265, now seen corresponding path program 1 times [2024-05-07 20:05:44,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:05:44,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033654460] [2024-05-07 20:05:44,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:05:44,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:05:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:05:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:05:44,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:05:44,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033654460] [2024-05-07 20:05:44,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033654460] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 20:05:44,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 20:05:44,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 20:05:44,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172528993] [2024-05-07 20:05:44,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 20:05:44,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 20:05:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:05:44,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 20:05:44,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 20:05:44,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:44,637 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:05:44,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 20:05:44,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:44,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 20:05:44,687 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 20:05:44,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:05:44,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1904192145, now seen corresponding path program 1 times [2024-05-07 20:05:44,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:05:44,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025608608] [2024-05-07 20:05:44,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:05:44,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:05:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:05:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:05:44,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:05:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025608608] [2024-05-07 20:05:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025608608] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 20:05:44,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 20:05:44,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-07 20:05:44,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307885480] [2024-05-07 20:05:44,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 20:05:44,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-07 20:05:44,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:05:44,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 20:05:44,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-07 20:05:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:44,902 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:05:44,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 20:05:44,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:44,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:44,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:44,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-07 20:05:44,983 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 20:05:44,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:05:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2091448484, now seen corresponding path program 1 times [2024-05-07 20:05:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:05:44,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171009125] [2024-05-07 20:05:44,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:05:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:05:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:05:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:05:46,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:05:46,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171009125] [2024-05-07 20:05:46,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171009125] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 20:05:46,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 20:05:46,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-05-07 20:05:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556724568] [2024-05-07 20:05:46,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 20:05:46,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-05-07 20:05:46,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:05:46,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-05-07 20:05:46,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-05-07 20:05:46,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:46,455 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:05:46,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.3125) internal successors, (117), 16 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 20:05:46,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:46,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:46,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:05:46,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-07 20:05:46,900 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 20:05:46,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:05:46,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2039233399, now seen corresponding path program 1 times [2024-05-07 20:05:46,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:05:46,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624590613] [2024-05-07 20:05:46,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:05:46,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:05:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:05:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:05:48,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:05:48,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624590613] [2024-05-07 20:05:48,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624590613] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 20:05:48,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 20:05:48,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-05-07 20:05:48,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22889884] [2024-05-07 20:05:48,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 20:05:48,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-05-07 20:05:48,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:05:48,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-05-07 20:05:48,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2024-05-07 20:05:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:48,731 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:05:48,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.321428571428571) internal successors, (121), 28 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 20:05:48,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:48,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:48,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:05:48,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:49,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:49,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:49,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:05:49,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-07 20:05:49,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-07 20:05:49,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 20:05:49,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:05:49,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1841237711, now seen corresponding path program 1 times [2024-05-07 20:05:49,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:05:49,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056054771] [2024-05-07 20:05:49,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:05:49,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:05:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:05:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:05:49,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:05:49,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056054771] [2024-05-07 20:05:49,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056054771] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 20:05:49,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 20:05:49,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-07 20:05:49,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742984436] [2024-05-07 20:05:49,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 20:05:49,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-07 20:05:49,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:05:49,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 20:05:49,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-07 20:05:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:49,906 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:05:49,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 20:05:49,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:49,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:49,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:05:49,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-07 20:05:49,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:05:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-07 20:05:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:50,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-07 20:05:50,229 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 20:05:50,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:05:50,230 INFO L85 PathProgramCache]: Analyzing trace with hash 599295464, now seen corresponding path program 1 times [2024-05-07 20:05:50,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:05:50,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729535273] [2024-05-07 20:05:50,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:05:50,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:05:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:05:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:05:54,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:05:54,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729535273] [2024-05-07 20:05:54,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729535273] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 20:05:54,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 20:05:54,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2024-05-07 20:05:54,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628023293] [2024-05-07 20:05:54,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 20:05:54,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-07 20:05:54,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:05:54,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-07 20:05:54,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1160, Unknown=0, NotChecked=0, Total=1332 [2024-05-07 20:05:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:54,526 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:05:54,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.5675675675675675) internal successors, (206), 37 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 20:05:54,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:54,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:54,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:05:54,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-07 20:05:54,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:54,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:05:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-07 20:05:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-07 20:05:56,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-07 20:05:56,438 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 20:05:56,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:05:56,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2043449997, now seen corresponding path program 1 times [2024-05-07 20:05:56,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:05:56,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522935758] [2024-05-07 20:05:56,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:05:56,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:05:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:05:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:05:58,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:05:58,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522935758] [2024-05-07 20:05:58,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522935758] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 20:05:58,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 20:05:58,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2024-05-07 20:05:58,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552185003] [2024-05-07 20:05:58,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 20:05:58,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-05-07 20:05:58,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:05:58,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-05-07 20:05:58,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2024-05-07 20:05:58,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:58,392 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:05:58,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.0) internal successors, (210), 30 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 20:05:58,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:58,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:58,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:05:58,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-07 20:05:58,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:58,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-07 20:05:58,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:05:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:05:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-07 20:05:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:05:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-07 20:05:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-07 20:05:59,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-07 20:05:59,625 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 20:05:59,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:05:59,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1621429240, now seen corresponding path program 1 times [2024-05-07 20:05:59,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:05:59,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013766982] [2024-05-07 20:05:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:05:59,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:05:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:06:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:06:08,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:06:08,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013766982] [2024-05-07 20:06:08,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013766982] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 20:06:08,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 20:06:08,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2024-05-07 20:06:08,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661092370] [2024-05-07 20:06:08,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 20:06:08,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-05-07 20:06:08,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:06:08,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-05-07 20:06:08,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2486, Unknown=0, NotChecked=0, Total=2652 [2024-05-07 20:06:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:06:08,420 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:06:08,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.115384615384615) internal successors, (214), 52 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 20:06:08,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:06:08,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:06:08,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:06:08,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-07 20:06:08,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:06:08,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-07 20:06:08,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-07 20:06:08,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:06:14,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:06:14,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:06:14,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:06:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-07 20:06:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:06:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-07 20:06:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-07 20:06:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-05-07 20:06:14,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-07 20:06:14,064 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 20:06:14,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:06:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1713389082, now seen corresponding path program 1 times [2024-05-07 20:06:14,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:06:14,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260494038] [2024-05-07 20:06:14,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:06:14,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:06:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:06:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:06:16,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:06:16,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260494038] [2024-05-07 20:06:16,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260494038] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 20:06:16,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312111724] [2024-05-07 20:06:16,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:06:16,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 20:06:16,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 20:06:17,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 20:06:17,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-07 20:06:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:06:17,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 105 conjunts are in the unsatisfiable core [2024-05-07 20:06:17,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 20:06:17,406 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-05-07 20:06:17,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-05-07 20:06:17,449 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 20:06:17,449 INFO L378 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 [2024-05-07 20:06:17,611 INFO L378 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 1 [2024-05-07 20:06:17,673 INFO L378 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 23 treesize of output 11 [2024-05-07 20:06:17,910 INFO L378 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 16 treesize of output 11 [2024-05-07 20:06:18,265 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-05-07 20:06:18,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 34 treesize of output 14 [2024-05-07 20:06:18,318 INFO L378 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 23 treesize of output 11 [2024-05-07 20:06:18,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-05-07 20:06:18,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:06:18,594 INFO L378 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 16 treesize of output 11 [2024-05-07 20:06:18,806 INFO L378 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 16 treesize of output 11 [2024-05-07 20:06:19,093 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-05-07 20:06:19,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 34 treesize of output 14 [2024-05-07 20:06:19,141 INFO L378 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 23 treesize of output 11 [2024-05-07 20:06:19,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-05-07 20:06:19,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:06:19,375 INFO L378 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 16 treesize of output 11 [2024-05-07 20:06:19,591 INFO L378 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 23 treesize of output 11 [2024-05-07 20:06:19,641 INFO L378 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 23 treesize of output 11 [2024-05-07 20:06:19,860 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-05-07 20:06:19,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-05-07 20:06:19,877 INFO L378 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 23 treesize of output 11 [2024-05-07 20:06:19,890 INFO L378 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 [2024-05-07 20:06:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:06:19,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 20:06:20,436 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_412 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_412) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2024-05-07 20:06:31,949 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_409 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_412 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_407))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse1 .cse2))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 88 |c_~#queue~0.offset|) v_ArrVal_409) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_412) |c_~#queue~0.base|) .cse2) 20) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (= .cse3 20))))))) is different from false [2024-05-07 20:07:09,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 20:07:09,900 INFO L378 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 2 case distinctions, treesize of input 423 treesize of output 278 [2024-05-07 20:07:09,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 20:07:09,930 INFO L378 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 773 treesize of output 771 [2024-05-07 20:07:09,975 INFO L378 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 580 treesize of output 540 [2024-05-07 20:07:09,992 INFO L378 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 218 treesize of output 210 [2024-05-07 20:07:10,044 INFO L378 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 179 treesize of output 163 [2024-05-07 20:07:10,059 INFO L378 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 340 treesize of output 324 [2024-05-07 20:07:10,089 INFO L378 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 7 treesize of output 3 [2024-05-07 20:07:10,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 20:07:10,489 INFO L378 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 273 treesize of output 269 [2024-05-07 20:07:11,234 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-05-07 20:07:11,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 90 [2024-05-07 20:07:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:07:11,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312111724] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 20:07:11,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 20:07:11,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 40] total 108 [2024-05-07 20:07:11,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688656992] [2024-05-07 20:07:11,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 20:07:11,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2024-05-07 20:07:11,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:07:11,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2024-05-07 20:07:11,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=9886, Unknown=226, NotChecked=418, Total=11556 [2024-05-07 20:07:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:07:11,444 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:07:11,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 6.796296296296297) internal successors, (734), 108 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 20:07:11,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:07:11,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:07:11,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:07:11,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-07 20:07:11,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:07:11,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-07 20:07:11,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-07 20:07:11,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-05-07 20:07:11,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:07:30,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-07 20:07:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:07:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:07:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:07:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-07 20:07:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:07:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-07 20:07:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-07 20:07:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-05-07 20:07:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-07 20:07:31,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-07 20:07:31,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-05-07 20:07:31,984 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 20:07:31,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:07:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash 102575125, now seen corresponding path program 1 times [2024-05-07 20:07:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:07:31,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139346429] [2024-05-07 20:07:31,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:07:31,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:07:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:07:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:07:39,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:07:39,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139346429] [2024-05-07 20:07:39,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139346429] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 20:07:39,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071541423] [2024-05-07 20:07:39,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:07:39,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 20:07:39,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 20:07:39,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 20:07:39,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-07 20:07:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:07:39,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 125 conjunts are in the unsatisfiable core [2024-05-07 20:07:39,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 20:07:39,784 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-05-07 20:07:39,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-05-07 20:07:39,840 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 20:07:39,840 INFO L378 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 [2024-05-07 20:07:40,074 INFO L378 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 1 [2024-05-07 20:07:40,169 INFO L378 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 23 treesize of output 11 [2024-05-07 20:07:40,935 INFO L378 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 27 treesize of output 18 [2024-05-07 20:07:41,442 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-05-07 20:07:41,443 INFO L378 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 45 treesize of output 24 [2024-05-07 20:07:41,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2024-05-07 20:07:41,727 INFO L378 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 0 case distinctions, treesize of input 47 treesize of output 23 [2024-05-07 20:07:41,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:07:41,834 INFO L378 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 23 treesize of output 16 [2024-05-07 20:07:42,098 INFO L378 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 23 treesize of output 16 [2024-05-07 20:07:42,438 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-05-07 20:07:42,438 INFO L378 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 41 treesize of output 24 [2024-05-07 20:07:42,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-05-07 20:07:42,677 INFO L378 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 0 case distinctions, treesize of input 43 treesize of output 23 [2024-05-07 20:07:42,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:07:42,812 INFO L378 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 23 treesize of output 16 [2024-05-07 20:07:43,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-05-07 20:07:43,308 INFO L378 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 0 case distinctions, treesize of input 43 treesize of output 23 [2024-05-07 20:07:43,713 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-05-07 20:07:43,713 INFO L378 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 41 treesize of output 24 [2024-05-07 20:07:43,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-05-07 20:07:43,811 INFO L378 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 0 case distinctions, treesize of input 30 treesize of output 14 [2024-05-07 20:07:43,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:07:43,884 INFO L378 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 16 treesize of output 11 [2024-05-07 20:07:44,064 INFO L378 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 23 treesize of output 11 [2024-05-07 20:07:44,071 INFO L378 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 [2024-05-07 20:07:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:07:44,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 20:08:30,855 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_575) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse2) 20) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|))))) (< |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|))) is different from false [2024-05-07 20:08:30,879 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_575) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse2) 20) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|)))))) is different from false [2024-05-07 20:08:30,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (v_ArrVal_568 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse3 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_575) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse4) 20) (< (select .cse3 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse3 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|)))))) is different from false [2024-05-07 20:08:31,087 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_568 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_568) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_575) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse1) 20) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|)))))) is different from false [2024-05-07 20:08:31,125 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_568 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse2 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse2 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse2 .cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_575) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse5) 20))))))))) is different from false [2024-05-07 20:08:31,191 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_568 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_568) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_575) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse1) 20) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|))))))) is different from false [2024-05-07 20:08:40,752 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566))) (let ((.cse6 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_568) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse3 v_ArrVal_575) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse2) 20) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|))))))) is different from false [2024-05-07 20:08:41,482 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse3 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_568) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse5 v_ArrVal_575) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse1) 20) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)))))) is different from false [2024-05-07 20:08:41,835 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_563)))) (let ((.cse6 (select (store (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse2 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse0 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse5 v_ArrVal_575) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse3) 20) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_563) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|))))))) is different from false [2024-05-07 20:08:41,881 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_563)))) (let ((.cse6 (select (store (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse2 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse0 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse5 v_ArrVal_575) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse3) 20) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_563) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|))))))) is different from false [2024-05-07 20:08:41,927 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_563)))) (let ((.cse8 (select (store (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse6 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse2 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_563) (< (select .cse0 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse0 .cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse7 v_ArrVal_575) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse5) 20) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)))))))) is different from false [2024-05-07 20:08:42,154 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 v_ArrVal_563)))) (let ((.cse5 (select (store (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse8 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_568) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse3 v_ArrVal_575) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse2) 20) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (+ (select .cse6 .cse7) 1) v_ArrVal_563) (< (select .cse8 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|)))))))) is different from false [2024-05-07 20:08:42,318 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_561)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 v_ArrVal_563)))) (let ((.cse2 (select (store (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse4 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse8 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_568) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse5 v_ArrVal_575) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse6 .cse7) 1) v_ArrVal_563) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|)))))))) is different from false [2024-05-07 20:08:42,382 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_561))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_563)))) (let ((.cse8 (select (store (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse3 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ |c_~#queue~0.offset| 80)) (.cse4 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_568) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|))) (or (< (+ (select .cse2 .cse1) 1) v_ArrVal_563) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse6 v_ArrVal_575) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse5) 20) (< (select .cse4 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse4 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse8 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< (select .cse9 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|))))))))))) is different from false [2024-05-07 20:08:42,489 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_561)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 v_ArrVal_563)))) (let ((.cse8 (select (store (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse0 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_568) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse3 v_ArrVal_575) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse2) 20) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (< (+ (select .cse7 .cse6) 1) v_ArrVal_563) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse8 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse9 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|))))))))) is different from false [2024-05-07 20:09:09,255 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_559))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_561)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_563)) |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_563) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse0 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse0 .cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse8 v_ArrVal_575) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse5) 20))))))))) is different from false [2024-05-07 20:09:12,095 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_557)))) (let ((.cse11 (store .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_559))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_561)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_563)) |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse8 (store .cse11 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_568) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_563) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (< (select .cse6 .cse3) (select .cse6 .cse1))) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse9 v_ArrVal_575) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse1) 20) (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|)))))))))) is different from false [2024-05-07 20:09:12,218 INFO L349 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2024-05-07 20:09:12,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1334 treesize of output 1082 [2024-05-07 20:09:12,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 20:09:12,269 INFO L378 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 1708 treesize of output 1688 [2024-05-07 20:09:12,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 787 treesize of output 747 [2024-05-07 20:09:12,348 INFO L378 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 195 treesize of output 183 [2024-05-07 20:09:12,385 INFO L378 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 385 treesize of output 369 [2024-05-07 20:09:12,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 354 treesize of output 342 [2024-05-07 20:09:12,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 279 [2024-05-07 20:09:13,273 INFO L378 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 7 treesize of output 3 [2024-05-07 20:09:14,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 20:09:14,474 INFO L378 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 393 treesize of output 363 [2024-05-07 20:09:16,130 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-05-07 20:09:16,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 90 [2024-05-07 20:09:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2024-05-07 20:09:16,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071541423] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 20:09:16,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 20:09:16,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 44, 52] total 143 [2024-05-07 20:09:16,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867105627] [2024-05-07 20:09:16,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 20:09:16,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 143 states [2024-05-07 20:09:16,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:09:16,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2024-05-07 20:09:16,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=14309, Unknown=133, NotChecked=4488, Total=20306 [2024-05-07 20:09:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:09:16,326 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:09:16,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 143 states, 143 states have (on average 5.741258741258742) internal successors, (821), 143 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 20:09:16,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:09:16,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:09:16,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:09:16,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-07 20:09:16,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:09:16,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-07 20:09:16,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-07 20:09:16,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-05-07 20:09:16,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-07 20:09:16,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:09:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:09:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:09:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 20:09:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-07 20:09:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:09:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-07 20:09:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-07 20:09:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-05-07 20:09:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-07 20:09:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-07 20:09:48,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-07 20:09:48,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-07 20:09:48,998 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 20:09:48,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:09:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1343727046, now seen corresponding path program 1 times [2024-05-07 20:09:48,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:09:48,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097195307] [2024-05-07 20:09:48,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:09:48,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:09:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:09:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:09:59,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:09:59,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097195307] [2024-05-07 20:09:59,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097195307] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 20:09:59,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506324822] [2024-05-07 20:09:59,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:09:59,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 20:09:59,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 20:09:59,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 20:09:59,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-07 20:09:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:09:59,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 182 conjunts are in the unsatisfiable core [2024-05-07 20:09:59,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 20:10:00,382 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-05-07 20:10:00,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-05-07 20:10:00,510 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 20:10:00,511 INFO L378 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 [2024-05-07 20:10:01,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-07 20:10:01,204 INFO L378 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 23 treesize of output 11 [2024-05-07 20:10:02,576 INFO L378 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 23 treesize of output 16 [2024-05-07 20:10:03,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-05-07 20:10:03,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-05-07 20:10:04,063 INFO L378 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 0 case distinctions, treesize of input 26 treesize of output 21 [2024-05-07 20:10:04,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:10:04,387 INFO L378 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 23 treesize of output 16 [2024-05-07 20:10:05,712 INFO L378 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 23 treesize of output 16 [2024-05-07 20:10:07,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-05-07 20:10:07,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-05-07 20:10:08,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-05-07 20:10:08,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:10:08,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2024-05-07 20:10:09,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:10:09,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2024-05-07 20:10:10,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:10:10,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2024-05-07 20:10:11,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:10:11,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2024-05-07 20:10:12,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:10:12,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2024-05-07 20:10:12,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:10:12,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-05-07 20:10:12,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:10:12,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2024-05-07 20:10:14,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:10:14,070 INFO L378 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 0 case distinctions, treesize of input 34 treesize of output 23 [2024-05-07 20:10:14,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-05-07 20:10:14,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 20:10:14,265 INFO L378 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 16 treesize of output 11 [2024-05-07 20:10:14,676 INFO L378 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 [2024-05-07 20:10:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:10:14,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 20:10:15,122 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t2Thread1of1ForFork1_dequeue_~x~0#1| 0)) (.cse0 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse0) 0))) .cse1) (or (not .cse1) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse0) 1)))))) is different from false [2024-05-07 20:10:15,295 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse0 (= |c_t2Thread1of1ForFork1_dequeue_#t~mem43#1| 0))) (and (or (not .cse0) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse1) 1)))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse1) 0))) .cse0))) is different from false [2024-05-07 20:10:49,107 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ (* |c_t2Thread1of1ForFork1_#t~post59#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse7 (+ (* (select .cse6 .cse9) 4) |c_~#queue~0.offset|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_741 Int) (v_ArrVal_739 Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 v_ArrVal_739) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse0 (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse1) 1))) (not (= (let ((.cse2 (select (store .cse4 |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) 0)))))) (forall ((v_ArrVal_741 Int) (v_ArrVal_739 Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse12 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 v_ArrVal_739) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse10 (store (select .cse12 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse1) 0))) (= (let ((.cse11 (select (store .cse12 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (select .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|))) 0)))))))) is different from false [2024-05-07 20:10:49,165 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse5 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse7 (+ (* (select .cse6 .cse9) 4) |c_~#queue~0.offset|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_741 Int) (v_ArrVal_739 Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 v_ArrVal_739) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse0 (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse1) 0))) (= (let ((.cse2 (select (store .cse4 |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) 0))))) (forall ((v_ArrVal_741 Int) (v_ArrVal_739 Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse11 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 v_ArrVal_739) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse12 (store (select .cse11 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_741))) (or (not (= (let ((.cse10 (select (store .cse11 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (select .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse1) 1)))))))))) is different from false [2024-05-07 20:11:34,739 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse12 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80))) (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse2 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse6 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse11 (+ 88 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|)) (.cse13 (+ (select .cse10 .cse12) 1))) (and (forall ((v_ArrVal_741 Int) (v_ArrVal_739 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse10 .cse11 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse12 .cse13)))) (let ((.cse5 (store .cse0 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse0 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse8) 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse9 v_ArrVal_739) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse1 (store (select .cse5 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 0))) (= (let ((.cse3 (select (store .cse5 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)))) 0)))))) (forall ((v_ArrVal_741 Int) (v_ArrVal_739 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse17 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse10 .cse11 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse12 .cse13)))) (let ((.cse15 (store .cse17 |c_~#queue~0.base| (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse8) 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse9 v_ArrVal_739) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse16 (store (select .cse15 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_741))) (or (not (= (let ((.cse14 (select (store .cse15 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse4) 4)))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse17 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 1))))))))))) is different from false [2024-05-07 20:13:19,458 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse22 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse2 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse7 (+ |c_~#stored_elements~0.offset| 8 .cse22)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4 .cse22)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_739 Int) (v_subst_2 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_730) .cse14 .cse15)))) (let ((.cse6 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse5 (store (store (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse1 (store (select (store .cse6 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 0))) (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* 4 (select .cse3 .cse4)) |c_~#queue~0.offset|))) 0))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_739 Int) (v_subst_3 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_730) .cse14 .cse15)))) (let ((.cse20 (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse19 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse4 (+ (select .cse21 .cse4) 1)) (+ (* (select .cse21 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse17 (store (select (store .cse20 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse16 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 1))) (not (= (let ((.cse18 (select (store (store .cse16 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse18 (+ (* (select .cse18 .cse4) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-05-07 20:13:52,998 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (let ((.cse23 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse23 (+ (* (select .cse23 .cse14) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_~x#1|))) (.cse22 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse5 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse7 (+ |c_~#stored_elements~0.offset| 8 .cse22)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4 .cse22)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_730) .cse14 .cse15)))) (let ((.cse6 (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse3 (store (store (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) v_subst_4)) .cse10 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store .cse6 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_730) .cse14 .cse15)))) (let ((.cse20 (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse19 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse1 (+ (select .cse21 .cse1) 1)) (+ |c_~#queue~0.offset| (* (select .cse21 .cse9) 4)) v_subst_5)) .cse10 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse17 (store (select (store .cse20 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse16 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse18 (select (store (store .cse16 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)))) 0))))))))))) is different from false [2024-05-07 20:14:37,463 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse12 (let ((.cse23 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse23 (+ (* (select .cse23 .cse14) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|))) (.cse22 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse2 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse7 (+ |c_~#stored_elements~0.offset| 8 .cse22)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4 .cse22)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 .cse13 v_ArrVal_730) .cse14 .cse15)))) (let ((.cse6 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse5 (store (store (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) v_subst_4)) .cse10 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse1 (store (select (store .cse6 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 1))) (not (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)))) 0)))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 .cse13 v_ArrVal_730) .cse14 .cse15)))) (let ((.cse20 (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse18 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse4 (+ (select .cse21 .cse4) 1)) (+ |c_~#queue~0.offset| (* (select .cse21 .cse9) 4)) v_subst_5)) .cse10 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse19 (store (select (store .cse20 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (= (let ((.cse16 (select (store (store .cse17 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse4) 4) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse17 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 0))))))))))))) is different from false [2024-05-07 20:15:49,337 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse7 (+ |c_~#stored_elements~0.offset| 8 .cse24)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse12 (+ |c_~#stored_elements~0.offset| 4 .cse24)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse10 (store .cse2 |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select .cse2 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse13 .cse9))))))) (let ((.cse6 (store (select .cse10 |c_~#stored_elements~0.base|) .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store .cse10 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse9))) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0)))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse21 (store .cse16 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse16 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse22 .cse9))))))) (let ((.cse19 (store (select .cse21 |c_~#stored_elements~0.base|) .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse20 (select (store .cse21 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse1 (+ (select .cse20 .cse1) 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse20 .cse9))) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse18 (store (select (store (store .cse16 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (not (= (let ((.cse15 (select (store (store .cse16 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse16 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1))))))))))))) is different from false [2024-05-07 20:15:49,924 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse10 (store .cse2 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select .cse2 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse12 .cse9))))))) (let ((.cse6 (store (select .cse10 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store .cse10 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* 4 (select .cse8 .cse9)) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1)))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse20 (store .cse14 |c_~#queue~0.base| (let ((.cse21 (let ((.cse22 (select .cse14 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse21 .cse9))))))) (let ((.cse18 (store (select .cse20 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse19 (select (store .cse20 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse1 (+ (select .cse19 .cse1) 1)) (+ (* 4 (select .cse19 .cse9)) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse15 (store (select (store (store .cse14 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse14 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse16 (select (store (store .cse14 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|))) 0)))))))))) is different from false [2024-05-07 20:15:50,935 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| |c_t1Thread1of1ForFork0_empty_#t~mem32#1|) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse10 (store .cse2 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select .cse2 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse12 .cse9))))))) (let ((.cse6 (store (select .cse10 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store .cse10 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* 4 (select .cse8 .cse9)) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1)))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse20 (store .cse14 |c_~#queue~0.base| (let ((.cse21 (let ((.cse22 (select .cse14 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse21 .cse9))))))) (let ((.cse18 (store (select .cse20 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse19 (select (store .cse20 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse1 (+ (select .cse19 .cse1) 1)) (+ (* 4 (select .cse19 .cse9)) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse15 (store (select (store (store .cse14 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse14 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse16 (select (store (store .cse14 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-05-07 20:15:51,057 WARN L854 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_empty_~q#1.offset|)) |c_t1Thread1of1ForFork0_empty_#t~mem31#1|) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse10 (store .cse2 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select .cse2 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse12 .cse9))))))) (let ((.cse6 (store (select .cse10 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store .cse10 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* 4 (select .cse8 .cse9)) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1)))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse20 (store .cse14 |c_~#queue~0.base| (let ((.cse21 (let ((.cse22 (select .cse14 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse21 .cse9))))))) (let ((.cse18 (store (select .cse20 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse19 (select (store .cse20 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse1 (+ (select .cse19 .cse1) 1)) (+ (* 4 (select .cse19 .cse9)) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse15 (store (select (store (store .cse14 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse14 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse16 (select (store (store .cse14 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-05-07 20:15:51,175 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|))) (= (select .cse0 (+ 84 |c_t1Thread1of1ForFork0_empty_~q#1.offset|)) (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_~q#1.offset| 80)))) (let ((.cse8 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse10 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse11 (store .cse3 |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select .cse3 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse12 v_ArrVal_730) .cse10 (+ 1 (select .cse13 .cse10))))))) (let ((.cse7 (store (select .cse11 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse9 (select (store .cse11 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse9 .cse2 (+ (select .cse9 .cse2) 1)) (+ (* 4 (select .cse9 .cse10)) |c_~#queue~0.offset|) v_subst_4)) .cse12 v_ArrVal_739) .cse10 (+ v_subst_3 1)))) (let ((.cse5 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_741))) (or (not (= (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 1)))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse21 (store .cse15 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse15 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse12 v_ArrVal_730) .cse10 (+ 1 (select .cse22 .cse10))))))) (let ((.cse19 (store (select .cse21 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse20 (select (store .cse21 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse2 (+ (select .cse20 .cse2) 1)) (+ (* 4 (select .cse20 .cse10)) |c_~#queue~0.offset|) v_subst_5)) .cse12 v_ArrVal_739) .cse10 (+ v_subst_2 1)))) (let ((.cse16 (store (select (store (store .cse15 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse15 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 0))) (= (let ((.cse17 (select (store (store .cse15 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-05-07 20:15:51,367 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_#in~q#1.base|))) (= (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_#in~q#1.offset| 80)) (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_#in~q#1.offset| 84)))) (let ((.cse8 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse10 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse11 (store .cse3 |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select .cse3 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse12 v_ArrVal_730) .cse10 (+ 1 (select .cse13 .cse10))))))) (let ((.cse7 (store (select .cse11 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse9 (select (store .cse11 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse9 .cse2 (+ (select .cse9 .cse2) 1)) (+ (* 4 (select .cse9 .cse10)) |c_~#queue~0.offset|) v_subst_4)) .cse12 v_ArrVal_739) .cse10 (+ v_subst_3 1)))) (let ((.cse5 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_741))) (or (not (= (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 1)))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse21 (store .cse15 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse15 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse12 v_ArrVal_730) .cse10 (+ 1 (select .cse22 .cse10))))))) (let ((.cse19 (store (select .cse21 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse20 (select (store .cse21 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse2 (+ (select .cse20 .cse2) 1)) (+ (* 4 (select .cse20 .cse10)) |c_~#queue~0.offset|) v_subst_5)) .cse12 v_ArrVal_739) .cse10 (+ v_subst_2 1)))) (let ((.cse16 (store (select (store (store .cse15 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse15 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 0))) (= (let ((.cse17 (select (store (store .cse15 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-05-07 20:15:51,665 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (let ((.cse9 (+ |c_~#stored_elements~0.offset| 8)) (.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse11 (store .cse4 |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select .cse4 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse12 v_ArrVal_730) .cse1 (+ 1 (select .cse13 .cse1))))))) (let ((.cse8 (store (select .cse11 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse10 (select (store .cse11 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (store (store .cse10 .cse2 (+ (select .cse10 .cse2) 1)) (+ (* 4 (select .cse10 .cse1)) |c_~#queue~0.offset|) v_subst_4)) .cse12 v_ArrVal_739) .cse1 (+ v_subst_3 1)))) (let ((.cse6 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_741))) (or (not (= (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse7) 1)))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse21 (store .cse15 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse15 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse12 v_ArrVal_730) .cse1 (+ 1 (select .cse22 .cse1))))))) (let ((.cse19 (store (select .cse21 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse20 (select (store .cse21 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse2 (+ (select .cse20 .cse2) 1)) (+ (* 4 (select .cse20 .cse1)) |c_~#queue~0.offset|) v_subst_5)) .cse12 v_ArrVal_739) .cse1 (+ v_subst_2 1)))) (let ((.cse16 (store (select (store (store .cse15 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse15 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse7) 0))) (= (let ((.cse17 (select (store (store .cse15 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|))) 0)))))))))))) is different from false [2024-05-07 20:15:51,767 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (and (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse14 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse12 (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse15 .cse13 v_ArrVal_730) .cse1 (+ (select .cse15 .cse1) 1))))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse9 (store (select (store .cse14 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse8 (store (store (let ((.cse11 (select (store (store .cse4 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (store (store .cse11 .cse2 (+ (select .cse11 .cse2) 1)) (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_subst_4)) .cse13 v_ArrVal_739) .cse1 (+ v_subst_3 1)))) (let ((.cse5 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 1))) (not (= (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|))) 0)))))))))))) (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse24 (store .cse27 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse23 (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ (* (select .cse26 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse25 .cse13 v_ArrVal_730) .cse1 (+ (select .cse25 .cse1) 1))))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse21 (store (select (store .cse24 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse20 (store (store (let ((.cse22 (select (store (store .cse17 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (store (store .cse22 .cse2 (+ (select .cse22 .cse2) 1)) (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|) v_subst_5)) .cse13 v_ArrVal_739) .cse1 (+ v_subst_2 1)))) (let ((.cse18 (store (select (store (store .cse17 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse17 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 0))) (= (let ((.cse19 (select (store (store .cse17 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (select .cse19 (+ (* (select .cse19 .cse2) 4) |c_~#queue~0.offset|))) 0)))))))) (let ((.cse28 (select .cse27 |c_~#queue~0.base|))) (= (select .cse28 .cse1) (select .cse28 .cse2)))))))) is different from false [2024-05-07 20:15:53,018 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse3 (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse14 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse12 (let ((.cse16 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse16 .cse13 v_ArrVal_730) .cse2 (+ (select .cse16 .cse2) 1))))) (let ((.cse5 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse9 (store (select (store .cse14 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse11 (select (store (store .cse5 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (store (store .cse11 .cse1 (+ (select .cse11 .cse1) 1)) (+ (* 4 (select .cse11 .cse2)) |c_~#queue~0.offset|) v_subst_4)) .cse13 v_ArrVal_739) .cse2 (+ v_subst_3 1)))) (let ((.cse7 (store (select (store (store .cse5 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (not (= (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (select .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse5 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse8) 1))))))))))))) (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse19 (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse18 (select .cse19 |c_~#queue~0.base|))) (= (select .cse18 .cse1) (select .cse18 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse27 (store .cse19 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse28 .cse13 v_ArrVal_730) .cse2 (+ (select .cse28 .cse2) 1))))) (let ((.cse20 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (store (store (let ((.cse25 (select (store (store .cse20 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (store (store .cse25 .cse1 (+ (select .cse25 .cse1) 1)) (+ (* 4 (select .cse25 .cse2)) |c_~#queue~0.offset|) v_subst_5)) .cse13 v_ArrVal_739) .cse2 (+ v_subst_2 1)))) (let ((.cse21 (store (select (store (store .cse20 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse8) 0))) (= (let ((.cse22 (select (store (store .cse20 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse22 (+ |c_~#queue~0.offset| (* 4 (select .cse22 .cse1))))) 0))))))))))))) is different from false [2024-05-07 20:15:53,208 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse3 (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse14 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse12 (let ((.cse16 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse16 .cse13 v_ArrVal_730) .cse2 (+ (select .cse16 .cse2) 1))))) (let ((.cse5 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse9 (store (select (store .cse14 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse11 (select (store (store .cse5 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (store (store .cse11 .cse1 (+ 1 (select .cse11 .cse1))) (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_subst_5)) .cse13 v_ArrVal_739) .cse2 (+ v_subst_2 1)))) (let ((.cse7 (store (select (store (store .cse5 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (= (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (select .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse5 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse8) 0))))))))))))) (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse28 (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse25 (store .cse28 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse24 (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse26 .cse13 v_ArrVal_730) .cse2 (+ (select .cse26 .cse2) 1))))) (let ((.cse19 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse22 (store (select (store .cse25 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse20 (store (store (let ((.cse23 (select (store (store .cse19 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (store (store .cse23 .cse1 (+ 1 (select .cse23 .cse1))) (+ (* (select .cse23 .cse2) 4) |c_~#queue~0.offset|) v_subst_4)) .cse13 v_ArrVal_739) .cse2 (+ v_subst_3 1)))) (let ((.cse21 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (not (= (let ((.cse18 (select (store (store .cse19 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse8) 1)))))))))) (let ((.cse29 (select .cse28 |c_~#queue~0.base|))) (= (select .cse29 .cse1) (select .cse29 .cse2)))))))) is different from false [2024-05-07 20:15:53,395 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse30 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse31 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse30 .cse31 (+ (select .cse30 .cse31) 1)))))) (and (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse16 (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse10 (let ((.cse14 (let ((.cse15 (select .cse12 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse14 .cse11 v_ArrVal_730) .cse9 (+ (select .cse14 .cse9) 1))))) (let ((.cse0 (store .cse13 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse6 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse8 (select (store (store .cse0 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 1))) (not (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0))))))))) (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (= (select .cse17 .cse4) (select .cse17 .cse9)))))) (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse19 (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse18 (select .cse19 |c_~#queue~0.base|))) (= (select .cse18 .cse4) (select .cse18 .cse9))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse27 (store .cse19 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse28 .cse11 v_ArrVal_730) .cse9 (+ (select .cse28 .cse9) 1))))) (let ((.cse20 (store .cse13 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (store (store (let ((.cse25 (select (store (store .cse20 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (store (store .cse25 .cse4 (+ (select .cse25 .cse4) 1)) (+ (* (select .cse25 .cse9) 4) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse21 (store (select (store (store .cse20 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 0))) (= (let ((.cse22 (select (store (store .cse20 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse4) 4)))) 0))))))))))))) is different from false [2024-05-07 20:15:54,361 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse19 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse21 (+ (select .cse18 .cse20) 1))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 .cse21)))) (let ((.cse3 (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse14 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse12 (let ((.cse16 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse16 .cse13 v_ArrVal_730) .cse1 (+ (select .cse16 .cse1) 1))))) (let ((.cse4 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse9 (store (select (store .cse14 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse8 (store (store (let ((.cse11 (select (store (store .cse4 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (store (store .cse11 .cse2 (+ (select .cse11 .cse2) 1)) (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_subst_4)) .cse13 v_ArrVal_739) .cse1 (+ v_subst_3 1)))) (let ((.cse5 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= 1 (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6)))) (not (= (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)))) 0))))))))))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 .cse21)))) (let ((.cse23 (store .cse32 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse22 (select .cse23 |c_~#queue~0.base|))) (= (select .cse22 .cse1) (select .cse22 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse31 (store .cse23 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse30 (let ((.cse33 (let ((.cse34 (select .cse31 |c_~#queue~0.base|))) (store .cse34 (+ (* (select .cse34 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse33 .cse13 v_ArrVal_730) .cse1 (+ (select .cse33 .cse1) 1))))) (let ((.cse24 (store .cse32 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse28 (store (select (store .cse31 |c_~#queue~0.base| .cse30) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse27 (store (store (let ((.cse29 (select (store (store .cse24 |c_~#queue~0.base| .cse30) |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base|))) (store (store .cse29 .cse2 (+ (select .cse29 .cse2) 1)) (+ (* (select .cse29 .cse1) 4) |c_~#queue~0.offset|) v_subst_5)) .cse13 v_ArrVal_739) .cse1 (+ v_subst_2 1)))) (let ((.cse25 (store (select (store (store .cse24 |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse24 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 0))) (= (let ((.cse26 (select (store (store .cse24 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (select .cse26 (+ (* (select .cse26 .cse2) 4) |c_~#queue~0.offset|))) 0))))))))))))))) is different from false [2024-05-07 20:15:55,174 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse19 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse20 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse22 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse18 (store .cse21 .cse22 v_ArrVal_723))) (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse18 .cse20) 1)))))) (let ((.cse3 (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse14 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse12 (let ((.cse16 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse16 .cse13 v_ArrVal_730) .cse2 (+ (select .cse16 .cse2) 1))))) (let ((.cse4 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse9 (store (select (store .cse14 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse8 (store (store (let ((.cse11 (select (store (store .cse4 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (store (store .cse11 .cse1 (+ (select .cse11 .cse1) 1)) (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_subst_5)) .cse13 v_ArrVal_739) .cse2 (+ v_subst_2 1)))) (let ((.cse5 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 0))) (= (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse1))))) 0)))))))))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse33 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse36 (store .cse21 .cse22 v_ArrVal_723))) (store (store .cse36 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse36 .cse20) 1)))))) (let ((.cse24 (store .cse33 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse23 (select .cse24 |c_~#queue~0.base|))) (= (select .cse23 .cse1) (select .cse23 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse32 (store .cse24 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse31 (let ((.cse34 (let ((.cse35 (select .cse32 |c_~#queue~0.base|))) (store .cse35 (+ (* (select .cse35 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse34 .cse13 v_ArrVal_730) .cse2 (+ (select .cse34 .cse2) 1))))) (let ((.cse25 (store .cse33 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse29 (store (select (store .cse32 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse28 (store (store (let ((.cse30 (select (store (store .cse25 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base|))) (store (store .cse30 .cse1 (+ (select .cse30 .cse1) 1)) (+ (* (select .cse30 .cse2) 4) |c_~#queue~0.offset|) v_subst_4)) .cse13 v_ArrVal_739) .cse2 (+ v_subst_3 1)))) (let ((.cse26 (store (select (store (store .cse25 |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base| .cse28) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse25 |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 1))) (not (= (let ((.cse27 (select (store (store .cse25 |c_~#queue~0.base| .cse28) |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base|))) (select .cse27 (+ (* (select .cse27 .cse1) 4) |c_~#queue~0.offset|))) 0))))))))))))))) is different from false [2024-05-07 20:15:55,368 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse19 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse22 (+ (* (select .cse21 .cse20) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse18 (store .cse21 .cse22 v_ArrVal_723))) (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse18 .cse20) 1)))))) (let ((.cse16 (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse10 (let ((.cse14 (let ((.cse15 (select .cse12 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse14 .cse11 v_ArrVal_730) .cse9 (+ (select .cse14 .cse9) 1))))) (let ((.cse2 (store .cse13 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse6 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1)))))))))) (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (= (select .cse17 .cse1) (select .cse17 .cse9))))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse31 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse36 (store .cse21 .cse22 v_ArrVal_723))) (store (store .cse36 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse36 .cse20) 1)))))) (let ((.cse34 (store .cse31 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse30 (store .cse34 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse29 (let ((.cse32 (let ((.cse33 (select .cse30 |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse32 .cse11 v_ArrVal_730) .cse9 (+ (select .cse32 .cse9) 1))))) (let ((.cse23 (store .cse31 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse27 (store (select (store .cse30 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse26 (store (store (let ((.cse28 (select (store (store .cse23 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base| .cse27) |c_~#queue~0.base|))) (store (store .cse28 .cse1 (+ (select .cse28 .cse1) 1)) (+ (* (select .cse28 .cse9) 4) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse24 (store (select (store (store .cse23 |c_~#stored_elements~0.base| .cse27) |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse23 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse25 (select (store (store .cse23 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse25 (+ |c_~#queue~0.offset| (* 4 (select .cse25 .cse1))))) 0)))))))) (let ((.cse35 (select .cse34 |c_~#queue~0.base|))) (= (select .cse35 .cse1) (select .cse35 .cse9)))))))))) is different from false [2024-05-07 20:15:55,708 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse20 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse19 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse22 (+ (* (select .cse21 .cse20) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse18 (store .cse21 .cse22 v_ArrVal_723))) (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse18 .cse20) 1)))))) (let ((.cse16 (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse10 (let ((.cse14 (let ((.cse15 (select .cse12 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse14 .cse11 v_ArrVal_730) .cse9 (+ (select .cse14 .cse9) 1))))) (let ((.cse2 (store .cse13 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse6 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* 4 (select .cse8 .cse9)) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1)))))))))) (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (= (select .cse17 .cse1) (select .cse17 .cse9))))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse31 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse36 (store .cse21 .cse22 v_ArrVal_723))) (store (store .cse36 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse36 .cse20) 1)))))) (let ((.cse34 (store .cse31 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse30 (store .cse34 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse29 (let ((.cse32 (let ((.cse33 (select .cse30 |c_~#queue~0.base|))) (store .cse33 (+ |c_~#queue~0.offset| (* (select .cse33 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse32 .cse11 v_ArrVal_730) .cse9 (+ (select .cse32 .cse9) 1))))) (let ((.cse23 (store .cse31 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse27 (store (select (store .cse30 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse26 (store (store (let ((.cse28 (select (store (store .cse23 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base| .cse27) |c_~#queue~0.base|))) (store (store .cse28 .cse1 (+ (select .cse28 .cse1) 1)) (+ (* 4 (select .cse28 .cse9)) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse24 (store (select (store (store .cse23 |c_~#stored_elements~0.base| .cse27) |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse23 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse25 (select (store (store .cse23 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse25 (+ (* (select .cse25 .cse1) 4) |c_~#queue~0.offset|))) 0)))))))) (let ((.cse35 (select .cse34 |c_~#queue~0.base|))) (= (select .cse35 .cse1) (select .cse35 .cse9)))))))))) is different from false [2024-05-07 20:15:56,496 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse18 (+ (* (select .cse17 .cse9) 4) |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse14 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse16 (store .cse17 .cse18 v_ArrVal_723))) (store (store .cse16 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse16 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse10 (let ((.cse12 (let ((.cse13 (select (store .cse14 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse11 v_ArrVal_730) .cse9 (+ (select .cse12 .cse9) 1))))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse6 (store (select (store (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_727) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse8 (select (store (store .cse0 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 0))) (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)))) 0))))))) (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (= (select .cse15 .cse9) (select .cse15 .cse4)))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse28 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse30 (store .cse17 .cse18 v_ArrVal_723))) (store (store .cse30 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse30 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse25 (let ((.cse26 (let ((.cse27 (select (store .cse28 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse26 .cse11 v_ArrVal_730) .cse9 (+ (select .cse26 .cse9) 1))))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse23 (store (select (store (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_727) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse21 (store (store (let ((.cse24 (select (store (store .cse20 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (store (store .cse24 .cse4 (+ (select .cse24 .cse4) 1)) (+ (* (select .cse24 .cse9) 4) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse22 (store (select (store (store .cse20 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (not (= (let ((.cse19 (select (store (store .cse20 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse4) 4)))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 1))))))))) (let ((.cse29 (select .cse28 |c_~#queue~0.base|))) (= (select .cse29 .cse9) (select .cse29 .cse4))))))))) is different from false [2024-05-07 20:15:58,030 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_721 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_721))) (let ((.cse15 (store (store .cse12 |c_~#queue~0.base| (let ((.cse17 (let ((.cse18 (select .cse12 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse9) 4)) v_ArrVal_723)))) (store (store .cse17 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse17 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse10 (let ((.cse13 (let ((.cse14 (select (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse11 v_ArrVal_730) .cse9 (+ (select .cse13 .cse9) 1))))) (let ((.cse2 (store .cse12 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse6 (store (select (store (store (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_727) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1))))))))) (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (= (select .cse16 .cse9) (select .cse16 .cse1))))))) (forall ((v_ArrVal_721 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_721))) (let ((.cse29 (store (store .cse26 |c_~#queue~0.base| (let ((.cse31 (let ((.cse32 (select .cse26 |c_~#queue~0.base|))) (store .cse32 (+ |c_~#queue~0.offset| (* (select .cse32 .cse9) 4)) v_ArrVal_723)))) (store (store .cse31 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse31 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse25 (let ((.cse27 (let ((.cse28 (select (store .cse29 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base|))) (store .cse28 (+ |c_~#queue~0.offset| (* (select .cse28 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse27 .cse11 v_ArrVal_730) .cse9 (+ (select .cse27 .cse9) 1))))) (let ((.cse19 (store .cse26 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse23 (store (select (store (store (store .cse26 |c_~#stored_elements~0.base| v_ArrVal_727) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse22 (store (store (let ((.cse24 (select (store (store .cse19 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (store (store .cse24 .cse1 (+ (select .cse24 .cse1) 1)) (+ (* (select .cse24 .cse9) 4) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse20 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse21 (select (store (store .cse19 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse1) 4)))) 0))))))) (let ((.cse30 (select .cse29 |c_~#queue~0.base|))) (= (select .cse30 .cse9) (select .cse30 .cse1))))))))) is different from false [2024-05-07 20:16:31,695 INFO L349 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2024-05-07 20:16:31,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24199 treesize of output 13456 [2024-05-07 20:16:31,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 20:16:31,873 INFO L378 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 110317 treesize of output 105961 [2024-05-07 20:16:33,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 20:16:33,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 4167349675 treesize of output 2630412726 Received shutdown request... [2024-05-07 20:19:51,217 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-07 20:19:51,224 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 20:19:51,240 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 20:19:51,240 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 20:19:51,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-07 20:19:51,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 20:19:51,425 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 301 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-3-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-74-3-5-3-8-3-10-3-7-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-2-2-2-1 context. [2024-05-07 20:19:51,427 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-07 20:19:51,427 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-05-07 20:19:51,429 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-05-07 20:19:51,429 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-05-07 20:19:51,429 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-05-07 20:19:51,430 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-07 20:19:51,433 INFO L448 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 20:19:51,439 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 20:19:51,439 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 20:19:51,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 08:19:51 BasicIcfg [2024-05-07 20:19:51,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 20:19:51,444 INFO L158 Benchmark]: Toolchain (without parser) took 848668.93ms. Allocated memory was 280.0MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 207.2MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 899.6MB. Max. memory is 8.0GB. [2024-05-07 20:19:51,445 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 20:19:51,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.50ms. Allocated memory is still 280.0MB. Free memory was 207.1MB in the beginning and 224.0MB in the end (delta: -16.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-07 20:19:51,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.48ms. Allocated memory is still 280.0MB. Free memory was 224.0MB in the beginning and 220.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-07 20:19:51,445 INFO L158 Benchmark]: Boogie Preprocessor took 53.90ms. Allocated memory is still 280.0MB. Free memory was 220.9MB in the beginning and 218.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-07 20:19:51,445 INFO L158 Benchmark]: RCFGBuilder took 554.97ms. Allocated memory is still 280.0MB. Free memory was 218.2MB in the beginning and 192.0MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2024-05-07 20:19:51,445 INFO L158 Benchmark]: TraceAbstraction took 847415.25ms. Allocated memory was 280.0MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 191.0MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 883.2MB. Max. memory is 8.0GB. [2024-05-07 20:19:51,446 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 571.50ms. Allocated memory is still 280.0MB. Free memory was 207.1MB in the beginning and 224.0MB in the end (delta: -16.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.48ms. Allocated memory is still 280.0MB. Free memory was 224.0MB in the beginning and 220.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.90ms. Allocated memory is still 280.0MB. Free memory was 220.9MB in the beginning and 218.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 554.97ms. Allocated memory is still 280.0MB. Free memory was 218.2MB in the beginning and 192.0MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 847415.25ms. Allocated memory was 280.0MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 191.0MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 883.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5988, independent: 5469, independent conditional: 5329, independent unconditional: 140, dependent: 519, dependent conditional: 519, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5469, independent: 5469, independent conditional: 5329, independent unconditional: 140, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5469, independent: 5469, independent conditional: 5329, independent unconditional: 140, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5469, independent: 5469, independent conditional: 5329, independent unconditional: 140, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5469, independent: 5469, independent conditional: 3323, independent unconditional: 2146, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5469, independent: 5469, independent conditional: 1398, independent unconditional: 4071, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5469, independent: 5469, independent conditional: 1398, independent unconditional: 4071, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 336, independent: 336, independent conditional: 24, independent unconditional: 312, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 336, independent: 336, independent conditional: 0, independent unconditional: 336, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5469, independent: 5133, independent conditional: 1374, independent unconditional: 3759, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 336, unknown conditional: 24, unknown unconditional: 312] , Statistics on independence cache: Total cache size (in pairs): 336, Positive cache size: 336, Positive conditional cache size: 24, Positive unconditional cache size: 312, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1925, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5469, independent: 5469, independent conditional: 3323, independent unconditional: 2146, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5469, independent: 5469, independent conditional: 1398, independent unconditional: 4071, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5469, independent: 5469, independent conditional: 1398, independent unconditional: 4071, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 336, independent: 336, independent conditional: 24, independent unconditional: 312, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 336, independent: 336, independent conditional: 0, independent unconditional: 336, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5469, independent: 5133, independent conditional: 1374, independent unconditional: 3759, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 336, unknown conditional: 24, unknown unconditional: 312] , Statistics on independence cache: Total cache size (in pairs): 336, Positive cache size: 336, Positive conditional cache size: 24, Positive unconditional cache size: 312, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1925 ], Independence queries for same thread: 519 - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 301 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-3-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-74-3-5-3-8-3-10-3-7-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 301 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-3-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-74-3-5-3-8-3-10-3-7-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 301 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-3-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-74-3-5-3-8-3-10-3-7-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 301 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-3-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-74-3-5-3-8-3-10-3-7-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 301 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-3-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-74-3-5-3-8-3-10-3-7-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 441 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 847.2s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 63.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 312, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 179.3s InterpolantComputationTime, 2324 NumberOfCodeBlocks, 2324 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2898 ConstructedInterpolants, 379 QuantifiedInterpolants, 114948 SizeOfPredicates, 112 NumberOfNonLiveVariables, 1305 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 147/408 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 0.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown