/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-158c277 [2024-11-14 01:13:11,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 01:13:11,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-14 01:13:11,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 01:13:11,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 01:13:11,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 01:13:11,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 01:13:11,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 01:13:11,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 01:13:11,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 01:13:11,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 01:13:11,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 01:13:11,611 INFO L153 SettingsManager]: * Use SBE=true [2024-11-14 01:13:11,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 01:13:11,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 01:13:11,612 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 01:13:11,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 01:13:11,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 01:13:11,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 01:13:11,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 01:13:11,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 01:13:11,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 01:13:11,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 01:13:11,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 01:13:11,614 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 01:13:11,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 01:13:11,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 01:13:11,615 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-14 01:13:11,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 01:13:11,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 01:13:11,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 01:13:11,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 01:13:11,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 01:13:11,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-14 01:13:11,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 01:13:11,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 01:13:11,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-14 01:13:11,616 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-14 01:13:11,616 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-14 01:13:11,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP [2024-11-14 01:13:11,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 01:13:11,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 01:13:11,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 01:13:11,889 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 01:13:11,891 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 01:13:11,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue.i [2024-11-14 01:13:13,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 01:13:13,548 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 01:13:13,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue.i [2024-11-14 01:13:13,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/94729a492/ce690db90a9d4f05ab85fcce2f03d92c/FLAGe46af1f2c [2024-11-14 01:13:13,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/94729a492/ce690db90a9d4f05ab85fcce2f03d92c [2024-11-14 01:13:13,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 01:13:13,814 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-14 01:13:13,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 01:13:13,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 01:13:13,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 01:13:13,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 01:13:13" (1/1) ... [2024-11-14 01:13:13,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3470536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:13, skipping insertion in model container [2024-11-14 01:13:13,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 01:13:13" (1/1) ... [2024-11-14 01:13:13,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 01:13:14,228 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2024-11-14 01:13:14,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2024-11-14 01:13:14,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2024-11-14 01:13:14,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 01:13:14,267 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 01:13:14,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2024-11-14 01:13:14,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2024-11-14 01:13:14,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2024-11-14 01:13:14,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 01:13:14,392 INFO L204 MainTranslator]: Completed translation [2024-11-14 01:13:14,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:14 WrapperNode [2024-11-14 01:13:14,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 01:13:14,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 01:13:14,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 01:13:14,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 01:13:14,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:14" (1/1) ... [2024-11-14 01:13:14,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:14" (1/1) ... [2024-11-14 01:13:14,447 INFO L138 Inliner]: procedures = 277, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 290 [2024-11-14 01:13:14,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 01:13:14,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 01:13:14,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 01:13:14,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 01:13:14,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:14" (1/1) ... [2024-11-14 01:13:14,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:14" (1/1) ... [2024-11-14 01:13:14,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:14" (1/1) ... [2024-11-14 01:13:14,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:14" (1/1) ... [2024-11-14 01:13:14,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:14" (1/1) ... [2024-11-14 01:13:14,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:14" (1/1) ... [2024-11-14 01:13:14,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:14" (1/1) ... [2024-11-14 01:13:14,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:14" (1/1) ... [2024-11-14 01:13:14,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 01:13:14,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 01:13:14,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 01:13:14,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 01:13:14,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:14" (1/1) ... [2024-11-14 01:13:14,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 01:13:14,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 01:13:14,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 01:13:14,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 01:13:14,538 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-14 01:13:14,538 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-14 01:13:14,538 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-14 01:13:14,538 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-14 01:13:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 01:13:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-14 01:13:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 01:13:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 01:13:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-14 01:13:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 01:13:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 01:13:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 01:13:14,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 01:13:14,541 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 01:13:14,663 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 01:13:14,665 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 01:13:15,064 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 01:13:15,065 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 01:13:15,105 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 01:13:15,105 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 01:13:15,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 01:13:15 BoogieIcfgContainer [2024-11-14 01:13:15,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 01:13:15,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 01:13:15,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 01:13:15,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 01:13:15,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 01:13:13" (1/3) ... [2024-11-14 01:13:15,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776f7311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 01:13:15, skipping insertion in model container [2024-11-14 01:13:15,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:14" (2/3) ... [2024-11-14 01:13:15,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776f7311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 01:13:15, skipping insertion in model container [2024-11-14 01:13:15,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 01:13:15" (3/3) ... [2024-11-14 01:13:15,116 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2024-11-14 01:13:15,129 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 01:13:15,130 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 303 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2024-11-14 01:13:15,131 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 01:13:15,240 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 01:13:15,298 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 01:13:15,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-14 01:13:15,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 01:13:15,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-14 01:13:15,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-14 01:13:15,384 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 01:13:15,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-14 01:13:15,401 INFO L333 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, 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;@13ed12cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 01:13:15,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 01:13:15,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:15,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:15,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1220443335, now seen corresponding path program 1 times [2024-11-14 01:13:15,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:15,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153912579] [2024-11-14 01:13:15,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:15,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:16,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:16,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153912579] [2024-11-14 01:13:16,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153912579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:16,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:16,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 01:13:16,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035340734] [2024-11-14 01:13:16,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:16,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 01:13:16,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:16,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 01:13:16,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 01:13:16,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:16,359 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:16,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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-11-14 01:13:16,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:16,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 01:13:16,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:16,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:16,517 INFO L85 PathProgramCache]: Analyzing trace with hash -632737905, now seen corresponding path program 1 times [2024-11-14 01:13:16,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:16,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542319051] [2024-11-14 01:13:16,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:16,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:18,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:18,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542319051] [2024-11-14 01:13:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542319051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:18,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:18,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-14 01:13:18,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861400761] [2024-11-14 01:13:18,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:18,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 01:13:18,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:18,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 01:13:18,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-14 01:13:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:18,635 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:18,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.588235294117647) internal successors, (163), 17 states have internal predecessors, (163), 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-11-14 01:13:18,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:18,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:19,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 01:13:19,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 01:13:19,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:19,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:19,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1626758454, now seen corresponding path program 1 times [2024-11-14 01:13:19,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:19,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376984510] [2024-11-14 01:13:19,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:19,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:22,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:22,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376984510] [2024-11-14 01:13:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376984510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:22,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:22,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-14 01:13:22,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837218819] [2024-11-14 01:13:22,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:22,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 01:13:22,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:22,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 01:13:22,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2024-11-14 01:13:22,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:22,395 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:22,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.958333333333333) internal successors, (167), 24 states have internal predecessors, (167), 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-11-14 01:13:22,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:22,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-14 01:13:22,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:23,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:23,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 01:13:23,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 01:13:23,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 01:13:23,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1462624180, now seen corresponding path program 1 times [2024-11-14 01:13:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721396405] [2024-11-14 01:13:23,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:23,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:23,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:23,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721396405] [2024-11-14 01:13:23,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721396405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:23,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:23,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 01:13:23,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002494336] [2024-11-14 01:13:23,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:23,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 01:13:23,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:23,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 01:13:23,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 01:13:23,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:23,889 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:23,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-11-14 01:13:23,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:23,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-14 01:13:23,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-14 01:13:23,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:24,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:24,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 01:13:24,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 01:13:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:24,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 01:13:24,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:24,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1721960440, now seen corresponding path program 1 times [2024-11-14 01:13:24,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791069267] [2024-11-14 01:13:24,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:24,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:24,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:24,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791069267] [2024-11-14 01:13:24,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791069267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:24,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:24,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 01:13:24,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559817640] [2024-11-14 01:13:24,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:24,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 01:13:24,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:24,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 01:13:24,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 01:13:24,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:24,399 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:24,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-11-14 01:13:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-14 01:13:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-14 01:13:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 01:13:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 01:13:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:24,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 01:13:24,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:24,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:24,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1591774546, now seen corresponding path program 1 times [2024-11-14 01:13:24,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:24,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523596354] [2024-11-14 01:13:24,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:24,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:25,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:25,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523596354] [2024-11-14 01:13:25,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523596354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:25,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:25,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 01:13:25,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863451257] [2024-11-14 01:13:25,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:25,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 01:13:25,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:25,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 01:13:25,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 01:13:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:25,129 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:25,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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-11-14 01:13:25,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:25,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-14 01:13:25,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-14 01:13:25,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:25,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:25,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 01:13:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 01:13:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:25,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 01:13:25,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 01:13:25,261 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-14 01:13:25,263 INFO L320 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2024-11-14 01:13:25,270 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 01:13:25,271 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 01:13:25,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-14 01:13:25,272 INFO L333 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, 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;@13ed12cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 01:13:25,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-14 01:13:25,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 01:13:25,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:25,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1830851417, now seen corresponding path program 1 times [2024-11-14 01:13:25,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:25,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628353635] [2024-11-14 01:13:25,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:25,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:25,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:25,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628353635] [2024-11-14 01:13:25,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628353635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:25,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:25,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 01:13:25,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075889683] [2024-11-14 01:13:25,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:25,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 01:13:25,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:25,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 01:13:25,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 01:13:25,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:25,310 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:25,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 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-11-14 01:13:25,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:25,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-14 01:13:25,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-14 01:13:25,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-14 01:13:25,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 01:13:25,408 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 01:13:25,408 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2024-11-14 01:13:25,413 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 01:13:25,414 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 01:13:25,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2024-11-14 01:13:25,414 INFO L333 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, 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;@13ed12cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 01:13:25,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 01:13:25,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:25,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:25,436 INFO L85 PathProgramCache]: Analyzing trace with hash -235332157, now seen corresponding path program 1 times [2024-11-14 01:13:25,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:25,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919419709] [2024-11-14 01:13:25,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:25,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:25,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:25,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919419709] [2024-11-14 01:13:25,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919419709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:25,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:25,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 01:13:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594132403] [2024-11-14 01:13:25,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:25,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 01:13:25,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:25,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 01:13:25,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 01:13:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:25,540 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:25,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 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-11-14 01:13:25,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:25,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:25,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 01:13:25,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:25,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash -617602791, now seen corresponding path program 1 times [2024-11-14 01:13:25,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:25,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771063954] [2024-11-14 01:13:25,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:25,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:25,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:25,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771063954] [2024-11-14 01:13:25,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771063954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:25,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:25,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 01:13:25,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967628169] [2024-11-14 01:13:25,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:25,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 01:13:25,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:25,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 01:13:25,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 01:13:25,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:25,772 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:25,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-11-14 01:13:25,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:25,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:26,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:26,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 01:13:26,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:26,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:26,097 INFO L85 PathProgramCache]: Analyzing trace with hash 433840297, now seen corresponding path program 1 times [2024-11-14 01:13:26,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:26,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377035136] [2024-11-14 01:13:26,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:26,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:26,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:26,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377035136] [2024-11-14 01:13:26,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377035136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:26,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:26,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 01:13:26,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132605359] [2024-11-14 01:13:26,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:26,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 01:13:26,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:26,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 01:13:26,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 01:13:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:26,211 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:26,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-11-14 01:13:26,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:26,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:26,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:26,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:26,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:26,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:26,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 01:13:26,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:26,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash 878162727, now seen corresponding path program 1 times [2024-11-14 01:13:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:26,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382581663] [2024-11-14 01:13:26,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:26,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:27,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:27,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382581663] [2024-11-14 01:13:27,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382581663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:27,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:27,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-14 01:13:27,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301319836] [2024-11-14 01:13:27,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:27,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 01:13:27,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:27,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 01:13:27,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-14 01:13:27,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:27,528 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:27,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 14 states have internal predecessors, (246), 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-11-14 01:13:27,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:27,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:27,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:27,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:28,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:28,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:28,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 01:13:28,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 01:13:28,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:28,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:28,430 INFO L85 PathProgramCache]: Analyzing trace with hash -49101854, now seen corresponding path program 1 times [2024-11-14 01:13:28,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:28,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117918148] [2024-11-14 01:13:28,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:28,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:29,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:29,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117918148] [2024-11-14 01:13:29,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117918148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:29,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:29,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 01:13:29,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800298869] [2024-11-14 01:13:29,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:29,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 01:13:29,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:29,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 01:13:29,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-14 01:13:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:29,277 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:29,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.833333333333332) internal successors, (250), 12 states have internal predecessors, (250), 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-11-14 01:13:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:29,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:29,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:29,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 01:13:29,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:29,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 01:13:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:13:29,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 01:13:29,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:29,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:29,917 INFO L85 PathProgramCache]: Analyzing trace with hash 114761740, now seen corresponding path program 1 times [2024-11-14 01:13:29,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:29,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865524061] [2024-11-14 01:13:29,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:29,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:31,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:31,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865524061] [2024-11-14 01:13:31,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865524061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:31,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:31,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-14 01:13:31,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775378441] [2024-11-14 01:13:31,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:31,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 01:13:31,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:31,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 01:13:31,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2024-11-14 01:13:31,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:31,936 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:31,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.363636363636363) internal successors, (250), 22 states have internal predecessors, (250), 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-11-14 01:13:31,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:31,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:31,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:31,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 01:13:31,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:13:31,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 01:13:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:13:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 01:13:33,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 01:13:33,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:33,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:33,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1989621319, now seen corresponding path program 1 times [2024-11-14 01:13:33,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:33,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005001780] [2024-11-14 01:13:33,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:33,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005001780] [2024-11-14 01:13:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005001780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:37,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:37,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2024-11-14 01:13:37,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878255421] [2024-11-14 01:13:37,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:37,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 01:13:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:37,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 01:13:37,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2024-11-14 01:13:37,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:37,378 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:37,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.193548387096774) internal successors, (254), 31 states have internal predecessors, (254), 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-11-14 01:13:37,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:37,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:37,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:37,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 01:13:37,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:13:37,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-14 01:13:37,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 01:13:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:13:39,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 01:13:39,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 01:13:39,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 01:13:39,334 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:39,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash 694028490, now seen corresponding path program 1 times [2024-11-14 01:13:39,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:39,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565885536] [2024-11-14 01:13:39,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:39,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:46,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:46,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565885536] [2024-11-14 01:13:46,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565885536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:46,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:46,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2024-11-14 01:13:46,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857396924] [2024-11-14 01:13:46,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:46,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 01:13:46,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:46,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 01:13:46,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1637, Unknown=0, NotChecked=0, Total=1806 [2024-11-14 01:13:46,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:46,472 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:46,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.953488372093023) internal successors, (256), 43 states have internal predecessors, (256), 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-11-14 01:13:46,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:46,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:46,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:46,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 01:13:46,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:13:46,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-14 01:13:46,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-14 01:13:46,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 01:13:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:13:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 01:13:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 01:13:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-14 01:13:50,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 01:13:50,871 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:50,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:50,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1258084925, now seen corresponding path program 1 times [2024-11-14 01:13:50,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:50,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608412939] [2024-11-14 01:13:50,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:50,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:54,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:54,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608412939] [2024-11-14 01:13:54,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608412939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 01:13:54,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794677999] [2024-11-14 01:13:54,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:54,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 01:13:54,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 01:13:54,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 01:13:54,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 01:13:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:54,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-14 01:13:54,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 01:13:54,895 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 13 treesize of output 9 [2024-11-14 01:13:54,974 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 23 treesize of output 22 [2024-11-14 01:13:55,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 01:13:55,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:13:55,369 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-14 01:13:55,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-14 01:13:55,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:13:55,425 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 01:13:55,426 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 38 treesize of output 16 [2024-11-14 01:13:55,580 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 23 treesize of output 13 [2024-11-14 01:13:55,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:13:55,636 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 18 treesize of output 13 [2024-11-14 01:13:55,969 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 01:13:55,977 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-14 01:13:55,977 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-11-14 01:13:56,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:13:56,016 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 29 treesize of output 13 [2024-11-14 01:13:56,168 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 23 treesize of output 13 [2024-11-14 01:13:56,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:13:56,246 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 18 treesize of output 13 [2024-11-14 01:13:56,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:13:56,420 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 29 treesize of output 13 [2024-11-14 01:13:56,459 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 29 treesize of output 13 [2024-11-14 01:13:56,650 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 01:13:56,651 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 33 treesize of output 13 [2024-11-14 01:13:56,670 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 29 treesize of output 13 [2024-11-14 01:13:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:56,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 01:14:01,635 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1)))))) is different from false [2024-11-14 01:14:01,698 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (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|))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-14 01:14:01,711 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (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))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-14 01:14:01,727 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 20))))) is different from false [2024-11-14 01:14:01,781 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-14 01:14:01,830 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (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|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-14 01:14:01,850 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| 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_29|) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse3))) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|))))))) is different from false [2024-11-14 01:14:01,890 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse1) 20)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|))))) is different from false [2024-11-14 01:14:03,730 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (v_ArrVal_1241 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse1) 20)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|)))))) is different from false [2024-11-14 01:14:03,804 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (v_ArrVal_1241 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (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|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|)))))) is different from false [2024-11-14 01:14:03,843 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (v_ArrVal_1241 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse1) 20))))))) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|)))) is different from false [2024-11-14 01:14:03,909 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (v_ArrVal_1241 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse7 .cse3) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (store (store .cse6 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| 1)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|))))))) is different from false [2024-11-14 01:14:05,488 INFO L349 Elim1Store]: treesize reduction 312, result has 39.3 percent of original size [2024-11-14 01:14:05,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 660 treesize of output 419 [2024-11-14 01:14:05,527 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-14 01:14:05,527 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 409 treesize of output 385 [2024-11-14 01:14:05,617 INFO L349 Elim1Store]: treesize reduction 72, result has 52.3 percent of original size [2024-11-14 01:14:05,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 275 treesize of output 292 [2024-11-14 01:14:05,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:14:05,654 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 377 treesize of output 377 [2024-11-14 01:14:05,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:14:05,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 294 treesize of output 284 [2024-11-14 01:14:05,746 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 146 treesize of output 130 [2024-11-14 01:14:05,861 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 17 treesize of output 9 [2024-11-14 01:14:05,918 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 17 treesize of output 9 [2024-11-14 01:14:06,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:14:06,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 86 [2024-11-14 01:14:06,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:14:06,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 241 treesize of output 227 [2024-11-14 01:14:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-14 01:14:06,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794677999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 01:14:06,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 01:14:06,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 34] total 88 [2024-11-14 01:14:06,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842756086] [2024-11-14 01:14:06,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 01:14:06,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2024-11-14 01:14:06,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:14:06,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2024-11-14 01:14:06,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=5079, Unknown=35, NotChecked=1908, Total=7656 [2024-11-14 01:14:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:14:06,582 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:14:06,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 9.704545454545455) internal successors, (854), 88 states have internal predecessors, (854), 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-11-14 01:14:06,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:14:06,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:14:06,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:14:06,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 01:14:06,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:14:06,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-14 01:14:06,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-14 01:14:06,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-11-14 01:14:06,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:14:16,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 01:14:18,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 01:14:20,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 01:14:22,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 01:14:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:14:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:14:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:14:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 01:14:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:14:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 01:14:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 01:14:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-14 01:14:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 01:14:23,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 01:14:23,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 01:14:23,696 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:14:23,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:14:23,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1610772472, now seen corresponding path program 1 times [2024-11-14 01:14:23,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:14:23,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469184390] [2024-11-14 01:14:23,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:14:23,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:14:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:14:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:14:29,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:14:29,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469184390] [2024-11-14 01:14:29,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469184390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 01:14:29,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148691706] [2024-11-14 01:14:29,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:14:29,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 01:14:29,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 01:14:29,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 01:14:29,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 01:14:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:14:29,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-14 01:14:29,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 01:14:30,003 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 13 treesize of output 9 [2024-11-14 01:14:30,036 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 22 [2024-11-14 01:14:30,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:14:30,098 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-14 01:14:30,662 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 01:14:30,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:30,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:30,685 INFO L349 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2024-11-14 01:14:30,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 40 [2024-11-14 01:14:30,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:30,735 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 01:14:30,736 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 47 treesize of output 28 [2024-11-14 01:14:30,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:14:30,948 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2024-11-14 01:14:31,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:31,034 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 20 [2024-11-14 01:14:31,452 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 01:14:31,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:31,466 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-14 01:14:31,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-14 01:14:31,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:31,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:31,503 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 38 treesize of output 25 [2024-11-14 01:14:31,749 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 38 treesize of output 16 [2024-11-14 01:14:31,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:31,832 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 20 [2024-11-14 01:14:32,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:32,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:32,109 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 38 treesize of output 25 [2024-11-14 01:14:32,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:14:32,300 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2024-11-14 01:14:32,688 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 01:14:32,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:32,703 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-14 01:14:32,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-14 01:14:32,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:32,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:32,744 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 38 treesize of output 25 [2024-11-14 01:14:32,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:14:32,817 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 01:14:32,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:32,927 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 18 treesize of output 13 [2024-11-14 01:14:33,126 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 29 treesize of output 13 [2024-11-14 01:14:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:14:33,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 01:14:47,502 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (or (< |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (forall ((v_ArrVal_1538 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| 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 ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (let ((.cse2 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse2)))) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|))))))) is different from false [2024-11-14 01:14:47,517 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| 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 ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (let ((.cse2 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse2)))) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|)))))) is different from false [2024-11-14 01:14:49,784 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse5 .cse6))) (or (forall ((v_ArrVal_1538 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (let ((.cse2 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse2)))) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|))))) (= .cse4 20)))) is different from false [2024-11-14 01:14:49,830 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse5 .cse6))) (or (= .cse0 20) (forall ((v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse2 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (or (not (= (let ((.cse3 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse3)) 20)) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|)))))))) is different from false [2024-11-14 01:14:49,919 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (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|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse5 .cse6))) (or (forall ((v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (let ((.cse2 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse2)))) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|))))) (= .cse4 20))))) is different from false [2024-11-14 01:15:07,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse5 (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|)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse2 (select .cse7 .cse4)) (.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (= .cse2 20) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (not (= (let ((.cse6 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse0 .cse6 (+ (select .cse0 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse6)) 20)))))))) is different from false [2024-11-14 01:15:19,469 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse3 (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))))) (let ((.cse6 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1527) |c_~#queue~0.base|))) (let ((.cse7 (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 .cse3 |c_~#queue~0.base| (store (store .cse7 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse2 (select .cse7 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (= .cse2 20) (not (= (let ((.cse4 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse0 .cse4 (+ (select .cse0 .cse4) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse4)) 20)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|))))))) is different from false [2024-11-14 01:15:20,043 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse3 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1527) |c_~#queue~0.base|))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse7 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse7 .cse2)) (.cse1 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (= .cse0 20) (not (= (let ((.cse5 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse1 .cse5 (+ (select .cse1 .cse5) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse5)) 20)))))))) is different from false [2024-11-14 01:15:20,181 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (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|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse6 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1527) |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse7 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse2 (select .cse7 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (= .cse2 20) (not (= (let ((.cse4 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse0 .cse4 (+ (select .cse0 .cse4) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse4)) 20)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|))))))) is different from false [2024-11-14 01:15:20,228 WARN L851 $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_ArrVal_1527 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse10 .cse1) 1)))))) (let ((.cse8 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1527) |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse9 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse4 (select .cse9 .cse3))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (= .cse4 20) (not (= (let ((.cse6 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse2 .cse6 (+ (select .cse2 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse6)) 20)) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|)))))))))) is different from false [2024-11-14 01:15:20,319 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| 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_#t~post41#1_41| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse10 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse10 .cse1) 1)))))) (let ((.cse8 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1527) |c_~#queue~0.base|))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse9 .cse7)) (.cse4 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse9 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (not (= (let ((.cse5 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse5)) 20)) (< (select .cse8 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (= .cse2 20) (< (select .cse4 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|)))))))) is different from false [2024-11-14 01:15:39,210 INFO L349 Elim1Store]: treesize reduction 462, result has 37.0 percent of original size [2024-11-14 01:15:39,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 1049 treesize of output 653 [2024-11-14 01:15:39,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:15:39,256 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 574 treesize of output 572 [2024-11-14 01:15:39,278 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 58 treesize of output 54 [2024-11-14 01:15:39,295 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 66 treesize of output 54 [2024-11-14 01:15:39,313 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 13 treesize of output 9 [2024-11-14 01:15:39,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 25 treesize of output 13 [2024-11-14 01:15:39,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:15:39,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 119 [2024-11-14 01:15:39,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 25 treesize of output 13 [2024-11-14 01:15:39,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:15:39,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 279 treesize of output 295 [2024-11-14 01:15:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-14 01:15:40,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148691706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 01:15:40,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 01:15:40,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 37, 45] total 118 [2024-11-14 01:15:40,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43801799] [2024-11-14 01:15:40,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 01:15:40,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2024-11-14 01:15:40,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:15:40,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2024-11-14 01:15:40,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1236, Invalid=9977, Unknown=173, NotChecked=2420, Total=13806 [2024-11-14 01:15:40,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:15:40,958 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:15:40,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 118 states have (on average 7.966101694915254) internal successors, (940), 118 states have internal predecessors, (940), 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-11-14 01:15:40,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:15:40,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:15:40,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:15:40,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 01:15:40,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:15:40,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-14 01:15:40,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-14 01:15:40,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-11-14 01:15:40,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-14 01:15:40,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:16:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:16:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:16:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:16:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 01:16:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:16:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 01:16:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 01:16:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-14 01:16:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 01:16:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-14 01:16:02,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 01:16:02,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 01:16:02,216 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:16:02,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:16:02,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1692506683, now seen corresponding path program 1 times [2024-11-14 01:16:02,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:16:02,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372499299] [2024-11-14 01:16:02,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:16:02,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:16:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:16:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:16:12,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:16:12,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372499299] [2024-11-14 01:16:12,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372499299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 01:16:12,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920219711] [2024-11-14 01:16:12,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:16:12,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 01:16:12,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 01:16:12,808 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 01:16:12,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 01:16:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:16:13,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 154 conjuncts are in the unsatisfiable core [2024-11-14 01:16:13,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 01:16:13,502 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-11-14 01:16:13,579 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 19 treesize of output 18 [2024-11-14 01:16:13,673 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-11-14 01:16:14,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:16:14,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:16:14,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:16:14,556 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 41 treesize of output 31 [2024-11-14 01:16:14,636 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 37 treesize of output 24 [2024-11-14 01:16:14,970 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-11-14 01:16:15,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:16:15,126 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-11-14 01:16:16,266 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-11-14 01:16:16,461 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-11-14 01:16:16,865 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-11-14 01:16:17,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:16:17,096 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 32 treesize of output 37 [2024-11-14 01:16:18,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:16:18,056 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 43 treesize of output 40 [2024-11-14 01:16:18,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:16:18,460 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 39 treesize of output 40 [2024-11-14 01:16:19,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:16:19,726 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 43 treesize of output 40 [2024-11-14 01:16:19,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:16:19,807 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 43 treesize of output 40 [2024-11-14 01:16:20,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:16:20,022 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 43 treesize of output 33 [2024-11-14 01:16:20,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:16:20,260 INFO L349 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2024-11-14 01:16:20,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2024-11-14 01:16:21,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:16:21,208 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 43 treesize of output 33 [2024-11-14 01:16:21,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:16:21,520 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 36 treesize of output 25 [2024-11-14 01:16:21,523 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 22 treesize of output 16 [2024-11-14 01:16:21,818 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 19 treesize of output 7 [2024-11-14 01:16:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:16:21,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 01:16:22,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t2Thread1of1ForFork1_dequeue_~x~0#1| 0)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or .cse0 (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse1) 0)))) (or (not .cse0) (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse1) 1)))))) is different from false [2024-11-14 01:16:22,357 WARN L851 $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 .cse0 (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse1) 0)))) (or (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse1) 1))) (not .cse0)))) is different from false [2024-11-14 01:16:23,054 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse4 (select |c_#memory_int| |c_~#stored_elements~0.base|)) (.cse5 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1829 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse4 .cse5 v_ArrVal_1829)))) (or (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse1) 1))) (not (= (let ((.cse2 (select .cse0 |c_~#queue~0.base|))) (select .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|))) 0))))) (forall ((v_ArrVal_1829 Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse4 .cse5 v_ArrVal_1829)))) (or (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store .cse6 |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse1) 0))) (= (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (select .cse7 (+ (* 4 (select .cse7 .cse3)) |c_~#queue~0.offset|))) 0)))))) is different from false [2024-11-14 01:16:35,892 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse5 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse7 (+ (* (select .cse6 .cse9) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1829))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0)) (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse3) 1)))))) (forall ((v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse11 (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1829))))) (or (= (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (select .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)))) 0) (forall ((v_ArrVal_1831 (Array Int Int))) (not (= 0 (select (select (store .cse11 |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse3)))))))))) is different from false [2024-11-14 01:17:22,902 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80) (+ |c_t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse7 (select .cse0 |c_~#queue~0.base|)) (.cse10 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse6 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse8 (+ |c_~#queue~0.offset| (* (select .cse7 .cse10) 4))) (.cse9 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (store .cse0 |c_~#queue~0.base| (store (store (store .cse7 .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse1 (store (select .cse5 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_1829))) (or (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse2) 1))) (not (= (let ((.cse3 (select (store .cse5 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0)))))) (forall ((v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse13 (store .cse0 |c_~#queue~0.base| (store (store (store .cse7 .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse11 (store (select .cse13 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_1829))) (or (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse11) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse2) 0))) (= (let ((.cse12 (select (store .cse13 |c_~#stored_elements~0.base| .cse11) |c_~#queue~0.base|))) (select .cse12 (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|))) 0))))))))) is different from false [2024-11-14 01:17:25,010 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80) (+ |c_t2Thread1of1ForFork1_dequeue_#t~mem47#1| 1))))) (let ((.cse7 (select .cse4 |c_~#queue~0.base|)) (.cse10 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse6 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse8 (+ (* (select .cse7 .cse10) 4) |c_~#queue~0.offset|)) (.cse9 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store .cse4 |c_~#queue~0.base| (store (store (store .cse7 .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse3 (store (select .cse2 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_1829))) (or (= 0 (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|)))) (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse5) 0))))))) (forall ((v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse13 (store .cse4 |c_~#queue~0.base| (store (store (store .cse7 .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse11 (store (select .cse13 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_1829))) (or (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse11) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse5) 1))) (not (= 0 (let ((.cse12 (select (store .cse13 |c_~#stored_elements~0.base| .cse11) |c_~#queue~0.base|))) (select .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|))))))))))))) is different from false [2024-11-14 01:18:50,889 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse13 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 80))) (let ((.cse0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse2 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse6 (store .cse13 .cse4 (+ (select .cse13 .cse4) 1))) (.cse7 (+ (* (select .cse13 .cse9) 4) |c_~#queue~0.offset|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse1 (store (select .cse5 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse0) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |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| (* 4 (select .cse3 .cse4))))) 0))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| 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 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse12 (store (select .cse11 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (let ((.cse10 (select (store .cse11 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (select .cse10 (+ |c_~#queue~0.offset| (* 4 (select .cse10 .cse4))))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse0) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse2) 1))))))))) is different from false [2024-11-14 01:18:51,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse10 (select |c_#memory_int| |c_~#stored_elements~0.base|)) (.cse11 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse10 (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse5 (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (let ((.cse0 (store (select (store .cse6 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse1 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse2) (not (= (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)))) 0))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse10 (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse14 (store (store (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (store (store .cse16 .cse4 (+ (select .cse16 .cse4) 1)) (+ (* (select .cse16 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (let ((.cse12 (store (select (store .cse15 |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse1 4 |~#stored_elements~0.offset|)) 0)) (= (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (select .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse4) 4)))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse2)))))))) is different from false [2024-11-14 01:18:53,397 WARN L851 $PredicateComparison]: unable to prove that (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|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse2 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse6 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (select .cse0 |c_~#stored_elements~0.base|)) (.cse12 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse5 (store (store (let ((.cse8 (select .cse7 |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 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store .cse7 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 0)) (= (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) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse6)))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_4 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse16 (store .cse0 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store (store .cse17 .cse4 (+ (select .cse17 .cse4) 1)) (+ (* (select .cse17 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ v_subst_4 1)))) (let ((.cse13 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse6) (not (= (let ((.cse14 (select (store (store .cse0 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base|))) (select .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse4) 4)))) 0)))))))))) is different from false [2024-11-14 01:18:53,547 WARN L851 $PredicateComparison]: unable to prove that (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|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (let ((.cse2 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse6 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (select .cse0 |c_~#stored_elements~0.base|)) (.cse12 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse5 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store .cse7 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 0)) (= 0 (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|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse6)))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_4 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse16 (store .cse0 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store (store .cse17 .cse4 (+ (select .cse17 .cse4) 1)) (+ |c_~#queue~0.offset| (* (select .cse17 .cse9) 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ v_subst_4 1)))) (let ((.cse13 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse6) (not (= (let ((.cse14 (select (store (store .cse0 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base|))) (select .cse14 (+ (* (select .cse14 .cse4) 4) |c_~#queue~0.offset|))) 0)))))))))) is different from false [2024-11-14 01:18:53,721 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse19 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse18 .cse19 (+ (select .cse18 .cse19) 1)))))) (let ((.cse2 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse3 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse5 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (select .cse0 |c_~#stored_elements~0.base|)) (.cse12 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_4 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse6 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ v_subst_4 1)))) (let ((.cse1 (store (select (store .cse7 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse3) (not (= (let ((.cse4 (select (store (store .cse0 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|))) 0))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse16 (store .cse0 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse14 (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store (store .cse17 .cse5 (+ (select .cse17 .cse5) 1)) (+ (* (select .cse17 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ v_subst_5 1)))) (let ((.cse15 (store (select (store .cse16 |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (= (let ((.cse13 (select (store (store .cse0 |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse13 (+ (* (select .cse13 .cse5) 4) |c_~#queue~0.offset|))) 0) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse3))))))))) is different from false [2024-11-14 01:18:54,410 WARN L851 $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|))) (let ((.cse6 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse5 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse7 (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse3 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ v_subst_6 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse4 (store (select (store .cse7 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (= (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) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse5) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse6 4 |~#stored_elements~0.offset|)) 0)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (v_subst_4 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse20 (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse18 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse1 (+ (select .cse21 .cse1) 1)) (+ (* (select .cse21 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ v_subst_7 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse19 (store (select (store .cse20 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (let ((.cse16 (select (store (store .cse17 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse16 (+ (* 4 (select .cse16 .cse1)) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse17 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse6 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse5)))))))))) is different from false [2024-11-14 01:18:55,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse3 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse5 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (v_subst_4 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse6 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) v_subst_8)) .cse10 (+ v_subst_7 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse1 (store (select (store .cse7 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse3) (not (= (let ((.cse4 (select (store (store .cse0 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse4 (+ |c_~#queue~0.offset| (* 4 (select .cse4 .cse5))))) 0)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse20 (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse18 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse5 (+ (select .cse21 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse21 .cse9) 4)) v_subst_9)) .cse10 (+ v_subst_6 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse19 (store (select (store .cse20 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (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 .cse5) 4) |c_~#queue~0.offset|))) 0) (not (= (select (select (store (store .cse17 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse3)))))))))) is different from false [2024-11-14 01:18:56,304 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse22 (+ (* (select .cse22 .cse14) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_~x#1|)))) (let ((.cse6 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (v_subst_4 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse7 (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse4 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse2 (+ (select .cse8 .cse2) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_7 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse5 (store (select (store .cse7 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse0) (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)) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse6 4 |~#stored_elements~0.offset|)) 1)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse20 (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse19 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse2 (+ (select .cse21 .cse2) 1)) (+ (* (select .cse21 .cse9) 4) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_6 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse17 (store (select (store .cse20 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse16 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse6 4 |~#stored_elements~0.offset|)) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse0) (= 0 (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 .cse2) 4) |c_~#queue~0.offset|)))))))))))))) is different from false [2024-11-14 01:18:56,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse22 (+ (* (select .cse22 .cse14) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|)))) (let ((.cse3 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse2 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse5 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (v_subst_4 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse6 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse9))) v_subst_8)) .cse10 (+ v_subst_7 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse1 (store (select (store .cse7 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse3) (not (= (let ((.cse4 (select (store (store .cse0 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|))) 0)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse20 (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse18 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse5 (+ (select .cse21 .cse5) 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse21 .cse9))) v_subst_9)) .cse10 (+ v_subst_6 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse19 (store (select (store .cse20 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (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 .cse5) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse3) (not (= (select (select (store (store .cse17 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 0)))))))))))) is different from false [2024-11-14 01:18:57,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse12 (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse22 (+ (* (select .cse22 .cse14) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|)))) (let ((.cse2 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse6 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (v_subst_4 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse5 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_7 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse1 (store (select (store .cse7 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 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)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse6))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse20 (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .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|) v_subst_9)) .cse10 (+ v_subst_6 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse17 (store (select (store .cse20 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse16 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse6) (= (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| (* 4 (select .cse18 .cse4))))) 0))))))))))) is different from false [2024-11-14 01:18:59,530 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse5 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse11 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse14 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_4 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse9 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse13 .cse14 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse12 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse12 .cse8) 1)))))) (let ((.cse6 (store (select .cse9 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse7 (select (store .cse9 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse3 (+ (select .cse7 .cse3) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse1 4 |~#stored_elements~0.offset|)) 1)) (not (= (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse5))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse21 (store .cse13 .cse14 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse21 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse21 .cse8) 1)))))) (let ((.cse18 (store (select .cse20 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |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 .cse3 (+ (select .cse19 .cse3) 1)) (+ (* (select .cse19 .cse8) 4) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_6 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse15 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= 0 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse1 4 |~#stored_elements~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse5) (= (let ((.cse16 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse3) 4)))) 0)))))))))) is different from false [2024-11-14 01:19:01,961 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse10 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse13 (+ (* (select .cse12 .cse7) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_4 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse8 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse11 (store .cse12 .cse13 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse11 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse11 .cse7) 1)))))) (let ((.cse5 (store (select .cse8 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse10) |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse2 (store (store (let ((.cse6 (select (store .cse8 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (store (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)) (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_subst_8)) .cse9 (+ v_subst_7 1)) .cse7 (+ v_subst_4 1)))) (let ((.cse3 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| .cse2) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse2) |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse4))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse19 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse20 (store .cse12 .cse13 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse20 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse20 .cse7) 1)))))) (let ((.cse17 (store (select .cse19 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse10) |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse16 (store (store (let ((.cse18 (select (store .cse19 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (store (store .cse18 .cse1 (+ (select .cse18 .cse1) 1)) (+ (* (select .cse18 .cse7) 4) |c_~#queue~0.offset|) v_subst_9)) .cse9 (+ v_subst_6 1)) .cse7 (+ v_subst_5 1)))) (let ((.cse14 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|)) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse4) (= (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base|))) (select .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse1) 4)))) 0)))))))))) is different from false [2024-11-14 01:19:04,039 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse12 (+ (* (select .cse11 .cse7) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_4 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse8 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse10 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse10 .cse7) 1))))) (.cse4 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse5 (store (select .cse8 |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse2 (store (store (let ((.cse6 (select (store .cse8 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (store (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)) (+ |c_~#queue~0.offset| (* (select .cse6 .cse7) 4)) v_subst_8)) .cse9 (+ v_subst_7 1)) .cse7 (+ v_subst_4 1)))) (let ((.cse3 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| .cse2) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse2) |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse4) 1)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse19 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse20 (store .cse11 .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse20 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse20 .cse7) 1))))) (.cse14 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse17 (store (select .cse19 |c_~#stored_elements~0.base|) .cse14 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse16 (store (store (let ((.cse18 (select (store .cse19 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (store (store .cse18 .cse1 (+ (select .cse18 .cse1) 1)) (+ |c_~#queue~0.offset| (* (select .cse18 .cse7) 4)) v_subst_9)) .cse9 (+ v_subst_6 1)) .cse7 (+ v_subst_5 1)))) (let ((.cse13 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse14) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (= (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|))) 0)))))))))) is different from false [2024-11-14 01:19:08,326 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_4 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse8 (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse7) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse11 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse11 .cse7) 1)))) (.cse1 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse5 (store (select (store .cse10 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (store (store .cse6 .cse3 (+ (select .cse6 .cse3) 1)) (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_subst_8)) .cse9 (+ v_subst_7 1)) .cse7 (+ v_subst_4 1)))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse1) 1)) (not (= (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse20 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse19 (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse7) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse21 .cse7) 1)))) (.cse16 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse17 (store (select (store .cse20 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) .cse16 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse14 (store (store (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (store (store .cse18 .cse3 (+ (select .cse18 .cse3) 1)) (+ (* (select .cse18 .cse7) 4) |c_~#queue~0.offset|) v_subst_9)) .cse9 (+ v_subst_6 1)) .cse7 (+ v_subst_5 1)))) (let ((.cse15 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (= (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse16) 0))))))))))) is different from false [2024-11-14 01:19:12,142 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.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|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_4 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse11 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse8) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse2 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse7 (select (store (store .cse0 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |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)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse21 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse20 (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse8) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse22 .cse8) 1)))) (.cse17 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse18 (store (select (store .cse21 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse17 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse15 (store (store (let ((.cse19 (select (store (store .cse0 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse4 (+ (select .cse19 .cse4) 1)) (+ (* (select .cse19 .cse8) 4) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_6 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse16 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (= (let ((.cse14 (select (store (store .cse0 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse14 (+ (* (select .cse14 .cse4) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse17) 0))))))))))) is different from false [2024-11-14 01:19:12,590 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse2 (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_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse11 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse5 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_6 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (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) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse5) 0))))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_4 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse21 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse20 (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse22 .cse8) 1)))) (.cse17 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse18 (store (select (store .cse21 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse17 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse15 (store (store (let ((.cse19 (select (store (store .cse2 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse1 (+ (select .cse19 .cse1) 1)) (+ (* (select .cse19 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse16 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (let ((.cse14 (select (store (store .cse2 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse17) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1)))))))))) is different from false [2024-11-14 01:19:12,933 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse24 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse25 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse24 .cse25 (+ (select .cse24 .cse25) 1)))))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse11 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse2 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse7 (select (store (store .cse0 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_6 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |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 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_4 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse21 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse20 (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse22 .cse8) 1)))) (.cse17 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse18 (store (select (store .cse21 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse17 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse15 (store (store (let ((.cse19 (select (store (store .cse0 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse4 (+ (select .cse19 .cse4) 1)) (+ (* (select .cse19 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse16 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (let ((.cse14 (select (store (store .cse0 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse14 (+ (* 4 (select .cse14 .cse4)) |c_~#queue~0.offset|))) 0)) (not (= 1 (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse17)))))))))))) is different from false [2024-11-14 01:19:16,963 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse16 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse15 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse17 (+ (select .cse14 .cse16) 1))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_11 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse14 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse16 .cse17)))) (let ((.cse11 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse8) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse10 (+ v_subst_11 1)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse5 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)) (+ (* 4 (select .cse7 .cse8)) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_6 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (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) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse5) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1))))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_4 Int) (v_subst_10 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse14 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse16 .cse17)))) (let ((.cse26 (store .cse19 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse25 (let ((.cse27 (let ((.cse28 (select .cse26 |c_~#queue~0.base|))) (store .cse28 (+ |c_~#queue~0.offset| (* (select .cse28 .cse8) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse27 .cse10 (+ v_subst_10 1)) .cse8 (+ (select .cse27 .cse8) 1)))) (.cse22 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse23 (store (select (store .cse26 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base|) .cse22 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse20 (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 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse21 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (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 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse22) 1))))))))))))) is different from false [2024-11-14 01:19:20,753 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse15 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse16 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse18 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_11 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse14 (store .cse17 .cse18 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse14 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse16 (+ (select .cse14 .cse16) 1)))))) (let ((.cse11 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse10 (+ v_subst_11 1)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse2 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse7 (select (store (store .cse0 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)) (+ |c_~#queue~0.offset| (* (select .cse7 .cse8) 4)) v_subst_9)) .cse10 (+ v_subst_6 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |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) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1))))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_4 Int) (v_subst_10 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse30 (store .cse17 .cse18 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse30 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse16 (+ (select .cse30 .cse16) 1)))))) (let ((.cse27 (store .cse19 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse28 .cse10 (+ v_subst_10 1)) .cse8 (+ (select .cse28 .cse8) 1)))) (.cse21 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse21 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (store (store (let ((.cse25 (select (store (store .cse19 |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 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse20 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse21) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (let ((.cse22 (select (store (store .cse19 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse22 (+ (* (select .cse22 .cse4) 4) |c_~#queue~0.offset|))) 0)))))))))))) is different from false [2024-11-14 01:19:21,535 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse17 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse18 .cse17)) (.cse5 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse16 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_11 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse15 (store .cse18 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse15 .cse16 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse17 (+ (select .cse15 .cse17) 1)))))) (let ((.cse12 (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse10 (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse11 (+ v_subst_11 1)) .cse9 (+ (select .cse13 .cse9) 1)))) (.cse3 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse7 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse8 (select (store (store .cse1 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) v_subst_9)) .cse11 (+ v_subst_6 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse2 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse3) 0)) (= (let ((.cse4 (select (store (store .cse1 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (select .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_4 Int) (v_subst_10 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse30 (store .cse18 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse30 .cse16 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse17 (+ (select .cse30 .cse17) 1)))))) (let ((.cse27 (store .cse19 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* (select .cse29 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse28 .cse11 (+ v_subst_10 1)) .cse9 (+ (select .cse28 .cse9) 1)))) (.cse21 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse21 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (store (store (let ((.cse25 (select (store (store .cse19 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (store (store .cse25 .cse5 (+ (select .cse25 .cse5) 1)) (+ (* (select .cse25 .cse9) 4) |c_~#queue~0.offset|) v_subst_8)) .cse11 (+ v_subst_7 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse20 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse21) 1)) (not (= 0 (let ((.cse22 (select (store (store .cse19 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse5) 4)))))) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1)))))))))))))) is different from false [2024-11-14 01:19:24,405 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse16 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse15 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse18 (select .cse17 .cse16))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_4 Int) (v_subst_10 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse14 (store .cse17 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse14 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse16 (+ (select .cse14 .cse16) 1)))))) (let ((.cse11 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse10 (+ v_subst_10 1)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse5 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (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)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse5) 1)))))))))) (< .cse18 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_11 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse30 (store .cse17 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse30 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse16 (+ (select .cse30 .cse16) 1)))))) (let ((.cse27 (store .cse19 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse28 .cse10 (+ v_subst_11 1)) .cse8 (+ (select .cse28 .cse8) 1)))) (.cse21 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse21 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (store (store (let ((.cse25 (select (store (store .cse19 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (store (store .cse25 .cse1 (+ (select .cse25 .cse1) 1)) (+ (* (select .cse25 .cse8) 4) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_6 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse20 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse21) 0)) (= 0 (let ((.cse22 (select (store (store .cse19 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse22 (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1))))))))) (< .cse18 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|)))))) is different from false [2024-11-14 01:19:28,560 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse14 .cse8)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_4 Int) (v_subst_10 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse9 (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse13 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ 1 (select .cse13 .cse8))))) |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse11 .cse10 (+ v_subst_10 1)) .cse8 (+ (select .cse11 .cse8) 1)))) (.cse5 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse2 (+ (select .cse7 .cse2) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse4 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse5) 1)))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_11 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse21 (let ((.cse22 (let ((.cse23 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse24 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse24 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ 1 (select .cse24 .cse8))))) |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse10 (+ v_subst_11 1)) .cse8 (+ (select .cse22 .cse8) 1)))) (.cse18 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse19 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse18 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse16 (store (store (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse2 (+ (select .cse20 .cse2) 1)) (+ (* (select .cse20 .cse8) 4) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_6 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse17 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (= (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse18) 0))))))))))))) is different from false [2024-11-14 01:19:45,937 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (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|) 0)))) (let ((.cse15 (select .cse3 |c_~#queue~0.base|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse15 .cse9))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_11 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse10 (let ((.cse12 (let ((.cse13 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse14 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse14 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse14 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse13 .cse9))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse11 (+ v_subst_11 1)) .cse9 (+ (select .cse12 .cse9) 1)))) (.cse6 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse7 (store (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse8 (select (store (store .cse3 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse8 .cse2 (+ (select .cse8 .cse2) 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) v_subst_9)) .cse11 (+ v_subst_6 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse5 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (= (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) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse6) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_4 Int) (v_subst_10 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse22 (let ((.cse23 (let ((.cse24 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse25 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse25 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse25 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* 4 (select .cse24 .cse9))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse23 .cse11 (+ v_subst_10 1)) .cse9 (+ (select .cse23 .cse9) 1)))) (.cse19 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse20 (store (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse19 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse21 (select (store (store .cse3 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (store (store .cse21 .cse2 (+ (select .cse21 .cse2) 1)) (+ |c_~#queue~0.offset| (* (select .cse21 .cse9) 4)) v_subst_8)) .cse11 (+ v_subst_7 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse18 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (let ((.cse16 (select (store (store .cse3 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (select .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse2) 4)))) 0)) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse19) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1))))))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))))))) is different from false [2024-11-14 01:19:46,693 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 84) 0) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (let ((.cse14 (select .cse2 |c_~#queue~0.base|)) (.cse8 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse15 (select .cse14 .cse8))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_4 Int) (v_subst_10 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse9 (let ((.cse11 (let ((.cse12 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse13 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse13 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse13 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse8) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse11 .cse10 (+ v_subst_10 1)) .cse8 (+ (select .cse11 .cse8) 1)))) (.cse5 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (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)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse5) 1)))))))) (< .cse15 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_11 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse22 (let ((.cse23 (let ((.cse24 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse25 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse25 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse25 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse8) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse23 .cse10 (+ v_subst_11 1)) .cse8 (+ (select .cse23 .cse8) 1)))) (.cse19 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse20 (store (select (store (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse19 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse21 (select (store (store .cse2 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (store (store .cse21 .cse1 (+ (select .cse21 .cse1) 1)) (+ |c_~#queue~0.offset| (* (select .cse21 .cse8) 4)) v_subst_9)) .cse10 (+ v_subst_6 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse18 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (= (let ((.cse16 (select (store (store .cse2 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (select .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse1) 4)))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse19) 0)))))))) (< .cse15 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))))))) is different from false [2024-11-14 01:19:51,271 INFO L349 Elim1Store]: treesize reduction 462, result has 37.0 percent of original size [2024-11-14 01:19:51,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 16624 treesize of output 3054 [2024-11-14 01:19:51,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:19:51,347 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 4852 treesize of output 4850 [2024-11-14 01:19:51,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:19:51,908 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 3901923351 treesize of output 3657697533 Received shutdown request... [2024-11-14 01:27:09,262 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 01:27:09,274 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-14 01:27:09,274 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-14 01:27:09,280 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-14 01:27:09,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 01:27:09,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 01:27:09,467 WARN L596 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 341 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-31-5-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-3-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-5-2-5-3-5-3-9-3-9-3-5-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-1 context. [2024-11-14 01:27:09,468 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 01:27:09,468 INFO L320 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (3/3) [2024-11-14 01:27:09,469 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 01:27:09,469 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 01:27:09,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-14 01:27:09,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 01:27:09 BasicIcfg [2024-11-14 01:27:09,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 01:27:09,486 INFO L158 Benchmark]: Toolchain (without parser) took 835671.37ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 70.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-11-14 01:27:09,486 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 100.7MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 01:27:09,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.59ms. Allocated memory is still 100.7MB. Free memory was 70.4MB in the beginning and 39.5MB in the end (delta: 31.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-11-14 01:27:09,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.55ms. Allocated memory is still 100.7MB. Free memory was 39.5MB in the beginning and 36.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-14 01:27:09,487 INFO L158 Benchmark]: Boogie Preprocessor took 33.84ms. Allocated memory is still 100.7MB. Free memory was 36.5MB in the beginning and 34.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 01:27:09,487 INFO L158 Benchmark]: RCFGBuilder took 619.83ms. Allocated memory is still 100.7MB. Free memory was 34.4MB in the beginning and 54.1MB in the end (delta: -19.7MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. [2024-11-14 01:27:09,487 INFO L158 Benchmark]: TraceAbstraction took 834377.95ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 53.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-11-14 01:27:09,488 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.24ms. Allocated memory is still 100.7MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 578.59ms. Allocated memory is still 100.7MB. Free memory was 70.4MB in the beginning and 39.5MB in the end (delta: 31.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.55ms. Allocated memory is still 100.7MB. Free memory was 39.5MB in the beginning and 36.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.84ms. Allocated memory is still 100.7MB. Free memory was 36.5MB in the beginning and 34.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 619.83ms. Allocated memory is still 100.7MB. Free memory was 34.4MB in the beginning and 54.1MB in the end (delta: -19.7MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. * TraceAbstraction took 834377.95ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 53.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14600, independent: 14431, independent conditional: 1837, independent unconditional: 12594, dependent: 169, dependent conditional: 138, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14467, independent: 14431, independent conditional: 1837, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14467, independent: 14431, independent conditional: 1837, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14485, independent: 14431, independent conditional: 1837, independent unconditional: 12594, dependent: 54, dependent conditional: 23, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14485, independent: 14431, independent conditional: 0, independent unconditional: 14431, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14485, independent: 14431, independent conditional: 0, independent unconditional: 14431, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11761, independent: 11728, independent conditional: 0, independent unconditional: 11728, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11761, independent: 11724, independent conditional: 0, independent unconditional: 11724, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 586, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 530, dependent conditional: 27, dependent unconditional: 502, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 14485, independent: 2703, independent conditional: 0, independent unconditional: 2703, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 11761, unknown conditional: 2, unknown unconditional: 11759] , Statistics on independence cache: Total cache size (in pairs): 11761, Positive cache size: 11728, Positive conditional cache size: 0, Positive unconditional cache size: 11728, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1855, Maximal queried relation: 4, Independence queries for same thread: 133, Persistent sets #1 benchmarks: Persistent set computation time: 0.8s, Number of persistent set computation: 690, Number of trivial persistent sets: 435, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12625, independent: 12594, independent conditional: 0, independent unconditional: 12594, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14600, independent: 14431, independent conditional: 1837, independent unconditional: 12594, dependent: 169, dependent conditional: 138, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14467, independent: 14431, independent conditional: 1837, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14467, independent: 14431, independent conditional: 1837, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14485, independent: 14431, independent conditional: 1837, independent unconditional: 12594, dependent: 54, dependent conditional: 23, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14485, independent: 14431, independent conditional: 0, independent unconditional: 14431, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14485, independent: 14431, independent conditional: 0, independent unconditional: 14431, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11761, independent: 11728, independent conditional: 0, independent unconditional: 11728, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11761, independent: 11724, independent conditional: 0, independent unconditional: 11724, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 586, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 530, dependent conditional: 27, dependent unconditional: 502, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 14485, independent: 2703, independent conditional: 0, independent unconditional: 2703, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 11761, unknown conditional: 2, unknown unconditional: 11759] , Statistics on independence cache: Total cache size (in pairs): 11761, Positive cache size: 11728, Positive conditional cache size: 0, Positive unconditional cache size: 11728, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1855, Maximal queried relation: 4, Independence queries for same thread: 133 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6585, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 30, dependent conditional: 15, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 6570, independent: 6094, independent conditional: 0, independent unconditional: 6094, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 462, unknown conditional: 0, unknown unconditional: 462] , Statistics on independence cache: Total cache size (in pairs): 12221, Positive cache size: 12189, Positive conditional cache size: 0, Positive unconditional cache size: 12189, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 372, Maximal queried relation: 0, Independence queries for same thread: 15, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 529, Number of trivial persistent sets: 523, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6198, independent: 6183, independent conditional: 0, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6585, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 30, dependent conditional: 15, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 6570, independent: 6094, independent conditional: 0, independent unconditional: 6094, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 462, unknown conditional: 0, unknown unconditional: 462] , Statistics on independence cache: Total cache size (in pairs): 12221, Positive cache size: 12189, Positive conditional cache size: 0, Positive unconditional cache size: 12189, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 372, Maximal queried relation: 0, Independence queries for same thread: 15 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18302, independent: 17642, independent conditional: 5457, independent unconditional: 12185, dependent: 660, dependent conditional: 616, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17686, independent: 17642, independent conditional: 5457, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17686, independent: 17642, independent conditional: 5457, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17686, independent: 17642, independent conditional: 5457, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17686, independent: 17642, independent conditional: 0, independent unconditional: 17642, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17686, independent: 17642, independent conditional: 0, independent unconditional: 17642, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2465, independent: 2443, independent conditional: 0, independent unconditional: 2443, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2465, independent: 2440, independent conditional: 0, independent unconditional: 2440, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 278, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 17686, independent: 15199, independent conditional: 0, independent unconditional: 15199, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2465, unknown conditional: 0, unknown unconditional: 2465] , Statistics on independence cache: Total cache size (in pairs): 14686, Positive cache size: 14632, Positive conditional cache size: 0, Positive unconditional cache size: 14632, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5457, Maximal queried relation: 0, Independence queries for same thread: 616, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 493, Number of trivial persistent sets: 413, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12229, independent: 12185, independent conditional: 0, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18302, independent: 17642, independent conditional: 5457, independent unconditional: 12185, dependent: 660, dependent conditional: 616, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17686, independent: 17642, independent conditional: 5457, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17686, independent: 17642, independent conditional: 5457, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17686, independent: 17642, independent conditional: 5457, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17686, independent: 17642, independent conditional: 0, independent unconditional: 17642, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17686, independent: 17642, independent conditional: 0, independent unconditional: 17642, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2465, independent: 2443, independent conditional: 0, independent unconditional: 2443, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2465, independent: 2440, independent conditional: 0, independent unconditional: 2440, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 278, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 17686, independent: 15199, independent conditional: 0, independent unconditional: 15199, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2465, unknown conditional: 0, unknown unconditional: 2465] , Statistics on independence cache: Total cache size (in pairs): 14686, Positive cache size: 14632, Positive conditional cache size: 0, Positive unconditional cache size: 14632, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5457, Maximal queried relation: 0, Independence queries for same thread: 616 - PositiveResult [Line: 1032]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1059]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 341 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-31-5-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-3-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-5-2-5-3-5-3-9-3-9-3-5-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-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 476 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 3.7s, 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: 56, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1043 NumberOfCodeBlocks, 1043 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1037 ConstructedInterpolants, 0 QuantifiedInterpolants, 4040 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 476 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, 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: 2, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 476 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 824.1s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 47.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: 254, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 107.6s InterpolantComputationTime, 3243 NumberOfCodeBlocks, 3243 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3901 ConstructedInterpolants, 408 QuantifiedInterpolants, 112911 SizeOfPredicates, 108 NumberOfNonLiveVariables, 1731 ConjunctsInSsa, 208 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, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown