/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 --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-aee53f6 [2024-11-15 21:18:11,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-15 21:18:11,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-15 21:18:11,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-15 21:18:11,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-15 21:18:11,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-15 21:18:11,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-15 21:18:11,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-15 21:18:11,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-15 21:18:11,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-15 21:18:11,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-15 21:18:11,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-15 21:18:11,830 INFO L153 SettingsManager]: * Use SBE=true [2024-11-15 21:18:11,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-15 21:18:11,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-15 21:18:11,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-15 21:18:11,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-15 21:18:11,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-15 21:18:11,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-15 21:18:11,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-15 21:18:11,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-15 21:18:11,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-15 21:18:11,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-15 21:18:11,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-15 21:18:11,833 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-15 21:18:11,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-15 21:18:11,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-15 21:18:11,833 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-15 21:18:11,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-15 21:18:11,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-15 21:18:11,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-15 21:18:11,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-15 21:18:11,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-15 21:18:11,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-15 21:18:11,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-15 21:18:11,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-15 21:18:11,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-15 21:18:11,834 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-15 21:18:11,834 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-15 21:18:11,834 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2024-11-15 21:18:12,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-15 21:18:12,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-15 21:18:12,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-15 21:18:12,114 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-15 21:18:12,114 INFO L274 PluginConnector]: CDTParser initialized [2024-11-15 21:18:12,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2024-11-15 21:18:13,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-15 21:18:13,746 INFO L384 CDTParser]: Found 1 translation units. [2024-11-15 21:18:13,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longest.i [2024-11-15 21:18:13,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/84c1da285/4496607f4b9349eca8f173d4d7443b97/FLAG14f6cc1bc [2024-11-15 21:18:13,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/84c1da285/4496607f4b9349eca8f173d4d7443b97 [2024-11-15 21:18:13,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-15 21:18:13,788 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-15 21:18:13,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-15 21:18:13,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-15 21:18:13,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-15 21:18:13,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:18:13" (1/1) ... [2024-11-15 21:18:13,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62adff49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:13, skipping insertion in model container [2024-11-15 21:18:13,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:18:13" (1/1) ... [2024-11-15 21:18:13,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-15 21:18:14,199 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_longest.i[43296,43309] [2024-11-15 21:18:14,208 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_longest.i[43503,43516] [2024-11-15 21:18:14,212 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_longest.i[43783,43796] [2024-11-15 21:18:14,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-15 21:18:14,272 INFO L200 MainTranslator]: Completed pre-run [2024-11-15 21:18:14,318 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_longest.i[43296,43309] [2024-11-15 21:18:14,319 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_longest.i[43503,43516] [2024-11-15 21:18:14,320 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_longest.i[43783,43796] [2024-11-15 21:18:14,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-15 21:18:14,466 INFO L204 MainTranslator]: Completed translation [2024-11-15 21:18:14,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:14 WrapperNode [2024-11-15 21:18:14,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-15 21:18:14,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-15 21:18:14,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-15 21:18:14,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-15 21:18:14,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:14" (1/1) ... [2024-11-15 21:18:14,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:14" (1/1) ... [2024-11-15 21:18:14,633 INFO L138 Inliner]: procedures = 277, calls = 1659, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1841 [2024-11-15 21:18:14,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-15 21:18:14,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-15 21:18:14,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-15 21:18:14,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-15 21:18:14,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:14" (1/1) ... [2024-11-15 21:18:14,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:14" (1/1) ... [2024-11-15 21:18:14,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:14" (1/1) ... [2024-11-15 21:18:14,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:14" (1/1) ... [2024-11-15 21:18:14,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:14" (1/1) ... [2024-11-15 21:18:14,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:14" (1/1) ... [2024-11-15 21:18:14,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:14" (1/1) ... [2024-11-15 21:18:14,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:14" (1/1) ... [2024-11-15 21:18:14,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-15 21:18:14,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-15 21:18:14,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-15 21:18:14,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-15 21:18:14,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:14" (1/1) ... [2024-11-15 21:18:14,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-15 21:18:14,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 21:18:14,797 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-15 21:18:14,799 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-15 21:18:14,825 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-15 21:18:14,825 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-15 21:18:14,825 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-15 21:18:14,825 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-15 21:18:14,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-15 21:18:14,825 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-15 21:18:14,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-15 21:18:14,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-15 21:18:14,825 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-15 21:18:14,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-15 21:18:14,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-15 21:18:14,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-15 21:18:14,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-15 21:18:14,827 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-15 21:18:14,995 INFO L238 CfgBuilder]: Building ICFG [2024-11-15 21:18:14,998 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-15 21:18:16,927 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-15 21:18:16,928 INFO L287 CfgBuilder]: Performing block encoding [2024-11-15 21:18:17,006 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-15 21:18:17,007 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-15 21:18:17,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:18:17 BoogieIcfgContainer [2024-11-15 21:18:17,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-15 21:18:17,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-15 21:18:17,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-15 21:18:17,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-15 21:18:17,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:18:13" (1/3) ... [2024-11-15 21:18:17,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c209bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:18:17, skipping insertion in model container [2024-11-15 21:18:17,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:14" (2/3) ... [2024-11-15 21:18:17,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c209bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:18:17, skipping insertion in model container [2024-11-15 21:18:17,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:18:17" (3/3) ... [2024-11-15 21:18:17,018 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2024-11-15 21:18:17,032 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-15 21:18:17,034 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longest.i that has 3 procedures, 1855 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2024-11-15 21:18:17,034 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-15 21:18:17,213 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-15 21:18:17,319 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:18:17,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-15 21:18:17,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 21:18:17,322 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-15 21:18:17,324 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-15 21:18:17,408 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:18:17,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-15 21:18:17,429 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;@20d9b9c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:18:17,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:18:17,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:18:17,950 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:18:17,953 INFO L132 ounterexampleChecker]: Examining path program with hash 2146919359, occurence #1 [2024-11-15 21:18:17,953 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:18:17,953 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:18:17,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:18:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash 795487247, now seen corresponding path program 1 times [2024-11-15 21:18:17,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:18:17,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200477338] [2024-11-15 21:18:17,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:18:17,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:18:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:18:19,892 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-15 21:18:19,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:18:19,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200477338] [2024-11-15 21:18:19,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200477338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:18:19,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:18:19,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-15 21:18:19,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960547725] [2024-11-15 21:18:19,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:18:19,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-15 21:18:19,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:18:19,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-15 21:18:19,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-15 21:18:19,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:19,935 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:18:19,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 849.0) internal successors, (1698), 2 states have internal predecessors, (1698), 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-15 21:18:19,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:20,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:20,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-15 21:18:20,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:18:20,097 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:18:20,099 INFO L132 ounterexampleChecker]: Examining path program with hash 1396869455, occurence #1 [2024-11-15 21:18:20,099 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:18:20,099 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:18:20,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:18:20,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1988372438, now seen corresponding path program 1 times [2024-11-15 21:18:20,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:18:20,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474865239] [2024-11-15 21:18:20,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:18:20,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:18:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:18:23,012 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-15 21:18:23,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:18:23,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474865239] [2024-11-15 21:18:23,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474865239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:18:23,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:18:23,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-15 21:18:23,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811957313] [2024-11-15 21:18:23,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:18:23,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-15 21:18:23,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:18:23,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-15 21:18:23,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-15 21:18:23,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:23,067 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:18:23,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 424.0) internal successors, (1696), 4 states have internal predecessors, (1696), 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-15 21:18:23,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:23,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:23,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-15 21:18:23,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:18:23,301 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:18:23,303 INFO L132 ounterexampleChecker]: Examining path program with hash 1972939459, occurence #1 [2024-11-15 21:18:23,303 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:18:23,303 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:18:23,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:18:23,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1632284371, now seen corresponding path program 1 times [2024-11-15 21:18:23,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:18:23,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505899761] [2024-11-15 21:18:23,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:18:23,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:18:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:18:32,056 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-15 21:18:32,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:18:32,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505899761] [2024-11-15 21:18:32,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505899761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:18:32,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:18:32,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-15 21:18:32,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854608868] [2024-11-15 21:18:32,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:18:32,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-15 21:18:32,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:18:32,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-15 21:18:32,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-15 21:18:32,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:32,062 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:18:32,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 142.91666666666666) internal successors, (1715), 12 states have internal predecessors, (1715), 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-15 21:18:32,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:32,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:32,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-15 21:18:36,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-15 21:18:36,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:18:36,933 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:18:36,935 INFO L132 ounterexampleChecker]: Examining path program with hash 2094085330, occurence #1 [2024-11-15 21:18:36,935 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:18:36,935 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:18:36,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:18:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash -995860402, now seen corresponding path program 1 times [2024-11-15 21:18:36,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:18:36,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257402778] [2024-11-15 21:18:36,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:18:36,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:18:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:18:48,217 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-15 21:18:48,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:18:48,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257402778] [2024-11-15 21:18:48,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257402778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:18:48,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:18:48,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-15 21:18:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937246479] [2024-11-15 21:18:48,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:18:48,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-15 21:18:48,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:18:48,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-15 21:18:48,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2024-11-15 21:18:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:48,226 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:18:48,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 71.625) internal successors, (1719), 24 states have internal predecessors, (1719), 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-15 21:18:48,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:48,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:48,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-15 21:18:48,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:55,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-15 21:18:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-15 21:18:55,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-15 21:18:55,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:18:55,489 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:18:55,490 INFO L132 ounterexampleChecker]: Examining path program with hash -1500246281, occurence #1 [2024-11-15 21:18:55,491 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:18:55,491 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:18:55,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:18:55,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1970430640, now seen corresponding path program 1 times [2024-11-15 21:18:55,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:18:55,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24986740] [2024-11-15 21:18:55,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:18:55,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:18:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:18:56,151 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-15 21:18:56,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:18:56,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24986740] [2024-11-15 21:18:56,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24986740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:18:56,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:18:56,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-15 21:18:56,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172301113] [2024-11-15 21:18:56,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:18:56,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-15 21:18:56,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:18:56,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-15 21:18:56,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-15 21:18:56,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:56,156 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:18:56,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 429.25) internal successors, (1717), 4 states have internal predecessors, (1717), 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-15 21:18:56,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:56,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:56,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-15 21:18:56,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-15 21:18:56,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-15 21:18:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-15 21:18:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:56,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-15 21:18:56,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:18:56,457 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:18:56,459 INFO L132 ounterexampleChecker]: Examining path program with hash -1266961889, occurence #1 [2024-11-15 21:18:56,459 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:18:56,459 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:18:56,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:18:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1582825080, now seen corresponding path program 1 times [2024-11-15 21:18:56,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:18:56,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269400042] [2024-11-15 21:18:56,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:18:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:18:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:18:57,410 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-15 21:18:57,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:18:57,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269400042] [2024-11-15 21:18:57,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269400042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:18:57,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:18:57,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:18:57,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677380262] [2024-11-15 21:18:57,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:18:57,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:18:57,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:18:57,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:18:57,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:18:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:57,415 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:18:57,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 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-15 21:18:57,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:57,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:57,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-15 21:18:57,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-15 21:18:57,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:57,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:57,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:57,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:57,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-15 21:18:57,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-15 21:18:57,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:57,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:18:57,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-15 21:18:57,945 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:18:57,945 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:18:57,947 INFO L132 ounterexampleChecker]: Examining path program with hash -1490832722, occurence #1 [2024-11-15 21:18:57,947 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:18:57,947 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:18:57,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:18:57,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1311794446, now seen corresponding path program 1 times [2024-11-15 21:18:57,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:18:57,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467549151] [2024-11-15 21:18:57,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:18:57,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:18:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:18:59,094 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-15 21:18:59,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:18:59,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467549151] [2024-11-15 21:18:59,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467549151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:18:59,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:18:59,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:18:59,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029767572] [2024-11-15 21:18:59,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:18:59,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:18:59,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:18:59,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:18:59,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:18:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:59,098 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:18:59,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 587.0) internal successors, (1761), 3 states have internal predecessors, (1761), 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-15 21:18:59,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:59,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:59,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-15 21:18:59,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-15 21:18:59,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:59,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:18:59,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-15 21:18:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-15 21:18:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:18:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:18:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:18:59,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:18:59,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-15 21:18:59,233 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-15 21:18:59,234 INFO L320 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2024-11-15 21:18:59,256 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:18:59,260 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:18:59,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-15 21:18:59,260 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;@20d9b9c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:18:59,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-15 21:18:59,310 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-15 21:18:59,310 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:18:59,312 INFO L132 ounterexampleChecker]: Examining path program with hash 217000412, occurence #1 [2024-11-15 21:18:59,312 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:18:59,312 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:18:59,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:18:59,313 INFO L85 PathProgramCache]: Analyzing trace with hash 268447021, now seen corresponding path program 1 times [2024-11-15 21:18:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:18:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91981849] [2024-11-15 21:18:59,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:18:59,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:18:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:18:59,741 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-15 21:18:59,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:18:59,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91981849] [2024-11-15 21:18:59,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91981849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:18:59,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:18:59,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-15 21:18:59,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296374134] [2024-11-15 21:18:59,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:18:59,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-15 21:18:59,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:18:59,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-15 21:18:59,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-15 21:18:59,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:59,745 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:18:59,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 829.0) internal successors, (1658), 2 states have internal predecessors, (1658), 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-15 21:18:59,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:18:59,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-15 21:18:59,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-15 21:18:59,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-15 21:18:59,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-15 21:18:59,876 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-15 21:18:59,876 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2024-11-15 21:18:59,900 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:18:59,901 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:18:59,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2024-11-15 21:18:59,902 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;@20d9b9c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:18:59,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:18:59,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:18:59,984 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:18:59,986 INFO L132 ounterexampleChecker]: Examining path program with hash 2025994999, occurence #1 [2024-11-15 21:18:59,986 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:18:59,986 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:18:59,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:18:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1103165845, now seen corresponding path program 1 times [2024-11-15 21:18:59,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:18:59,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710186465] [2024-11-15 21:18:59,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:18:59,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:19:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:19:00,449 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-15 21:19:00,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:19:00,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710186465] [2024-11-15 21:19:00,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710186465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:19:00,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:19:00,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-15 21:19:00,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834150885] [2024-11-15 21:19:00,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:19:00,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-15 21:19:00,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:19:00,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-15 21:19:00,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-15 21:19:00,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:00,454 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:19:00,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 871.0) internal successors, (1742), 2 states have internal predecessors, (1742), 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-15 21:19:00,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:00,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-15 21:19:00,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:19:00,486 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:19:00,487 INFO L132 ounterexampleChecker]: Examining path program with hash 1275945095, occurence #1 [2024-11-15 21:19:00,488 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:19:00,488 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:19:00,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:19:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash -653941028, now seen corresponding path program 1 times [2024-11-15 21:19:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:19:00,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466637441] [2024-11-15 21:19:00,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:19:00,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:19:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:19:01,226 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-15 21:19:01,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:19:01,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466637441] [2024-11-15 21:19:01,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466637441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:19:01,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:19:01,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-15 21:19:01,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747376523] [2024-11-15 21:19:01,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:19:01,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-15 21:19:01,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:19:01,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-15 21:19:01,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-15 21:19:01,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:01,230 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:19:01,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 435.0) internal successors, (1740), 4 states have internal predecessors, (1740), 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-15 21:19:01,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:01,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:01,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:01,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:01,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-15 21:19:01,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:19:01,279 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:19:01,281 INFO L132 ounterexampleChecker]: Examining path program with hash -1255342674, occurence #1 [2024-11-15 21:19:01,281 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:19:01,281 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:19:01,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:19:01,283 INFO L85 PathProgramCache]: Analyzing trace with hash 695952985, now seen corresponding path program 1 times [2024-11-15 21:19:01,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:19:01,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555664068] [2024-11-15 21:19:01,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:19:01,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:19:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:19:02,175 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-15 21:19:02,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:19:02,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555664068] [2024-11-15 21:19:02,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555664068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:19:02,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:19:02,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:19:02,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726666760] [2024-11-15 21:19:02,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:19:02,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:19:02,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:19:02,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:19:02,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:19:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:02,179 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:19:02,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 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-15 21:19:02,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:02,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:02,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:02,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:19:02,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-15 21:19:02,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:19:02,466 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:19:02,468 INFO L132 ounterexampleChecker]: Examining path program with hash 1642733354, occurence #1 [2024-11-15 21:19:02,468 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:19:02,468 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:19:02,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:19:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash 228867594, now seen corresponding path program 1 times [2024-11-15 21:19:02,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:19:02,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013493357] [2024-11-15 21:19:02,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:19:02,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:19:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:19:03,038 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-15 21:19:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:19:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013493357] [2024-11-15 21:19:03,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013493357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:19:03,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:19:03,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-15 21:19:03,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223410372] [2024-11-15 21:19:03,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:19:03,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-15 21:19:03,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:19:03,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-15 21:19:03,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-15 21:19:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:03,042 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:19:03,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 450.0) internal successors, (1800), 4 states have internal predecessors, (1800), 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-15 21:19:03,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:03,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:03,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:19:03,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:03,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:19:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:03,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-15 21:19:03,136 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:19:03,136 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:19:03,138 INFO L132 ounterexampleChecker]: Examining path program with hash 1594642768, occurence #1 [2024-11-15 21:19:03,138 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:19:03,138 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:19:03,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:19:03,139 INFO L85 PathProgramCache]: Analyzing trace with hash -911218776, now seen corresponding path program 1 times [2024-11-15 21:19:03,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:19:03,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735411873] [2024-11-15 21:19:03,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:19:03,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:19:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:19:08,934 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-15 21:19:08,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:19:08,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735411873] [2024-11-15 21:19:08,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735411873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:19:08,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:19:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-15 21:19:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870339653] [2024-11-15 21:19:08,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:19:08,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-15 21:19:08,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:19:08,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-15 21:19:08,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-15 21:19:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:08,938 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:19:08,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 119.86666666666666) internal successors, (1798), 15 states have internal predecessors, (1798), 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-15 21:19:08,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:08,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:08,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:19:08,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:08,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:19:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:14,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:19:14,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-15 21:19:14,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:19:14,823 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:19:14,824 INFO L132 ounterexampleChecker]: Examining path program with hash 697518124, occurence #1 [2024-11-15 21:19:14,824 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:19:14,824 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:19:14,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:19:14,826 INFO L85 PathProgramCache]: Analyzing trace with hash 268259363, now seen corresponding path program 1 times [2024-11-15 21:19:14,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:19:14,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662278053] [2024-11-15 21:19:14,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:19:14,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:19:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:19:22,785 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-15 21:19:22,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:19:22,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662278053] [2024-11-15 21:19:22,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662278053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:19:22,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:19:22,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-15 21:19:22,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319483080] [2024-11-15 21:19:22,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:19:22,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-15 21:19:22,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:19:22,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-15 21:19:22,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-15 21:19:22,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:22,788 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:19:22,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 112.625) internal successors, (1802), 16 states have internal predecessors, (1802), 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-15 21:19:22,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:22,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:22,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:19:22,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:22,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:19:22,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:19:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:19:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:19:28,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-15 21:19:28,662 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:19:28,662 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:19:28,664 INFO L132 ounterexampleChecker]: Examining path program with hash -370938387, occurence #1 [2024-11-15 21:19:28,664 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:19:28,664 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:19:28,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:19:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2108223053, now seen corresponding path program 1 times [2024-11-15 21:19:28,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:19:28,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693232200] [2024-11-15 21:19:28,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:19:28,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:19:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:19:37,492 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-15 21:19:37,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:19:37,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693232200] [2024-11-15 21:19:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693232200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:19:37,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:19:37,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-15 21:19:37,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332747728] [2024-11-15 21:19:37,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:19:37,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-15 21:19:37,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:19:37,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-15 21:19:37,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-11-15 21:19:37,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:37,497 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:19:37,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 81.9090909090909) internal successors, (1802), 22 states have internal predecessors, (1802), 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-15 21:19:37,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:37,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:37,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:19:37,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:37,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:19:37,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:19:37,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:19:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-15 21:19:45,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-15 21:19:45,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:19:45,844 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:19:45,845 INFO L132 ounterexampleChecker]: Examining path program with hash -1268063031, occurence #1 [2024-11-15 21:19:45,845 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:19:45,845 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:19:45,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:19:45,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2098756680, now seen corresponding path program 1 times [2024-11-15 21:19:45,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:19:45,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898852836] [2024-11-15 21:19:45,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:19:45,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:19:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:20:01,006 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-15 21:20:01,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:20:01,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898852836] [2024-11-15 21:20:01,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898852836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:20:01,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:20:01,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-15 21:20:01,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542414382] [2024-11-15 21:20:01,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:20:01,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-15 21:20:01,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:20:01,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-15 21:20:01,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2024-11-15 21:20:01,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:20:01,010 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:20:01,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 64.5) internal successors, (1806), 28 states have internal predecessors, (1806), 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-15 21:20:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:20:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:20:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:20:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:20:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:20:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:20:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-15 21:20:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:20:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:20:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:20:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:20:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:20:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:20:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:20:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-15 21:20:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-15 21:20:07,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-15 21:20:07,532 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:20:07,532 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:20:07,533 INFO L132 ounterexampleChecker]: Examining path program with hash -30927166, occurence #1 [2024-11-15 21:20:07,533 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:20:07,534 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:20:07,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:20:07,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1800972629, now seen corresponding path program 1 times [2024-11-15 21:20:07,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:20:07,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301696933] [2024-11-15 21:20:07,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:20:07,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:20:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:20:37,510 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-15 21:20:37,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:20:37,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301696933] [2024-11-15 21:20:37,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301696933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:20:37,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:20:37,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2024-11-15 21:20:37,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039169614] [2024-11-15 21:20:37,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:20:37,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-15 21:20:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:20:37,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-15 21:20:37,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1860, Unknown=0, NotChecked=0, Total=2070 [2024-11-15 21:20:37,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:20:37,514 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:20:37,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 39.30434782608695) internal successors, (1808), 46 states have internal predecessors, (1808), 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-15 21:20:37,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:20:37,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:20:37,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:20:37,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:20:37,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:20:37,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:20:37,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-15 21:20:37,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-15 21:20:37,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:20:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:20:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:20:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:20:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:20:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:20:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:20:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-15 21:20:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-15 21:20:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-15 21:20:57,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-15 21:20:57,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:20:57,393 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:20:57,395 INFO L132 ounterexampleChecker]: Examining path program with hash -1682493469, occurence #1 [2024-11-15 21:20:57,395 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:20:57,395 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:20:57,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:20:57,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1988737854, now seen corresponding path program 1 times [2024-11-15 21:20:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:20:57,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996653962] [2024-11-15 21:20:57,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:20:57,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:20:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:21:13,002 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-15 21:21:13,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:21:13,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996653962] [2024-11-15 21:21:13,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996653962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-15 21:21:13,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015495091] [2024-11-15 21:21:13,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:21:13,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-15 21:21:13,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 21:21:13,005 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-15 21:21:13,005 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-15 21:21:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:21:13,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 3967 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-15 21:21:13,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-15 21:21:16,477 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-15 21:21:16,520 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-15 21:21:16,913 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-15 21:21:16,930 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2024-11-15 21:21:16,930 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-15 21:21:17,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:21:17,063 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-15 21:21:17,064 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 31 [2024-11-15 21:21:17,267 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 3 [2024-11-15 21:21:17,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:21:17,344 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-15 21:21:17,638 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-15 21:21:17,646 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-15 21:21:17,647 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-15 21:21:17,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:21:17,709 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-15 21:21:17,863 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 31 treesize of output 15 [2024-11-15 21:21:17,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:21:17,920 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-15 21:21:18,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:21:18,076 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-15 21:21:18,130 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-15 21:21:18,307 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-15 21:21:18,317 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-15 21:21:18,318 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 2 case distinctions, treesize of input 45 treesize of output 35 [2024-11-15 21:21:18,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:21:18,369 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-15 21:21:18,390 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-15 21:21:18,416 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-15 21:21:18,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-15 21:21:18,486 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 10 treesize of output 4 [2024-11-15 21:21:21,044 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1338) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) is different from false [2024-11-15 21:21:41,010 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1334) |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1338) |c_~#queue~0.base|) .cse1) 800) (= 800 .cse4))))))) is different from false [2024-11-15 21:21:41,040 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_31| Int)) (or (< |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_31|) (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_31| 1))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1334) |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1338) |c_~#queue~0.base|) .cse1) 800) (= 800 .cse4))))))))) is different from false [2024-11-15 21:21:43,683 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| Int) (v_ArrVal_1338 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1334 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_31| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_31| 1))))) (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1334) |c_~#queue~0.base|))) (let ((.cse1 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_26|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select .cse1 .cse2))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| 1)) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1338) |c_~#queue~0.base|) .cse2) 800) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_31|) (= .cse3 800) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|)))))))) is different from false [2024-11-15 21:21:46,502 INFO L349 Elim1Store]: treesize reduction 273, result has 40.9 percent of original size [2024-11-15 21:21:46,502 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 434 treesize of output 376 [2024-11-15 21:21:46,546 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-15 21:21:46,546 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 323 treesize of output 301 [2024-11-15 21:21:46,641 INFO L349 Elim1Store]: treesize reduction 72, result has 52.3 percent of original size [2024-11-15 21:21:46,642 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 128 treesize of output 187 [2024-11-15 21:21:46,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:21:46,672 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 178 treesize of output 178 [2024-11-15 21:21:46,720 INFO L349 Elim1Store]: treesize reduction 40, result has 29.8 percent of original size [2024-11-15 21:21:46,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 176 treesize of output 127 [2024-11-15 21:21:46,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:21:46,761 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 69 treesize of output 67 [2024-11-15 21:21:46,776 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 28 treesize of output 20 [2024-11-15 21:21:46,914 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-15 21:21:47,056 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-15 21:21:47,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:21:47,084 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 92 treesize of output 94 [2024-11-15 21:21:47,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:21:47,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 152 treesize of output 146 [2024-11-15 21:21:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 31 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:21:51,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015495091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-15 21:21:51,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-15 21:21:51,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 37] total 92 [2024-11-15 21:21:51,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966801032] [2024-11-15 21:21:51,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-15 21:21:51,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2024-11-15 21:21:51,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:21:51,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2024-11-15 21:21:51,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=843, Invalid=6701, Unknown=128, NotChecked=700, Total=8372 [2024-11-15 21:21:51,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:21:51,285 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:21:51,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 60.19565217391305) internal successors, (5538), 92 states have internal predecessors, (5538), 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-15 21:21:51,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:21:51,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:21:51,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:21:51,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:21:51,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:21:51,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:21:51,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-15 21:21:51,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-15 21:21:51,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-11-15 21:21:51,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:22:34,931 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-15 21:22:39,703 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-15 21:22:45,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-15 21:23:02,440 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-15 21:23:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:23:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:23:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:23:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:23:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:23:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:23:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-15 21:23:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-15 21:23:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-15 21:23:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-15 21:23:02,553 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-15 21:23:02,735 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,SelfDestructingSolverStorable17 [2024-11-15 21:23:02,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:23:02,735 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:23:02,736 INFO L132 ounterexampleChecker]: Examining path program with hash 621610321, occurence #1 [2024-11-15 21:23:02,736 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:23:02,736 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:23:02,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:23:02,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1308059833, now seen corresponding path program 1 times [2024-11-15 21:23:02,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:23:02,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226281504] [2024-11-15 21:23:02,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:23:02,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:23:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:23:28,461 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-15 21:23:28,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:23:28,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226281504] [2024-11-15 21:23:28,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226281504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-15 21:23:28,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380199529] [2024-11-15 21:23:28,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:23:28,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-15 21:23:28,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 21:23:28,464 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-15 21:23:28,464 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-15 21:23:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:23:29,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 3972 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-15 21:23:29,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-15 21:23:36,297 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-15 21:23:36,396 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-15 21:23:36,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:23:36,518 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-15 21:23:37,697 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-15 21:23:37,745 INFO L349 Elim1Store]: treesize reduction 102, result has 21.5 percent of original size [2024-11-15 21:23:37,745 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-15 21:23:37,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:23:37,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:23:37,898 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-15 21:23:37,899 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 43 [2024-11-15 21:23:38,282 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-15 21:23:38,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:23:38,455 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-15 21:23:39,602 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-15 21:23:39,643 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2024-11-15 21:23:39,643 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-15 21:23:39,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:23:39,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:23:39,859 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-15 21:23:40,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:23:40,431 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 40 treesize of output 27 [2024-11-15 21:23:40,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:23:40,689 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-15 21:23:41,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:23:41,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:23:41,437 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-15 21:23:42,042 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-15 21:23:43,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-15 21:23:43,314 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-15 21:23:43,314 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-11-15 21:23:43,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:23:43,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:23:43,509 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-15 21:23:43,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:23:43,872 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-15 21:23:44,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:23:44,038 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-15 21:23:44,409 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-15 21:23:44,428 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-15 21:23:44,511 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-15 21:23:44,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-15 21:23:44,717 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1628 (Array Int Int))) (not (= 800 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|))))) is different from false [2024-11-15 21:23:57,439 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse3 (+ (* 4 (select .cse0 .cse5)) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (not (= 800 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 .cse2) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse1))) (= (select (store (store (store .cse0 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse2) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5) 800))))) is different from false [2024-11-15 21:23:57,681 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse1 .cse6) 4)))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2) 800)) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (= 800 (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6))))))) is different from false [2024-11-15 21:23:58,476 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))))) (let ((.cse0 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse0 .cse5) 4))) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (= (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5) 800) (not (= 800 (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2))) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|))))))) is different from false [2024-11-15 21:24:01,008 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (select .cse7 .cse8))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ .cse9 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse1 .cse6) 4))) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (not (= 800 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2))) (= (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6) 800) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|)))))) (= 800 .cse9)))) is different from false [2024-11-15 21:24:01,192 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse8 .cse9))) (or (= 800 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ .cse0 1))))) (let ((.cse1 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse5 (+ |c_~#queue~0.offset| (* (select .cse1 .cse6) 4))) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (= 800 (select (store (store (store .cse1 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse4) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse6)) (not (= (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 .cse4) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2) 800))))))))))) is different from false [2024-11-15 21:24:01,253 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse9 (select .cse7 .cse8))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ .cse9 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse1 .cse6) 4)))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2) 800)) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (= 800 (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse6))))))) (= 800 .cse9))))) (< (select .cse10 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)))) is different from false [2024-11-15 21:24:01,366 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse10 (store .cse7 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse9 (select .cse10 .cse8))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ .cse9 1))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ (* (select .cse0 .cse6) 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse1) 800)) (< (select .cse7 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (= .cse9 800) (= 800 (select (store (store (store .cse0 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse6)))))))))) is different from false [2024-11-15 21:24:05,376 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (v_ArrVal_1618 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse0 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1618) |c_~#queue~0.base|))) (let ((.cse9 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select .cse9 .cse1))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|))) (let ((.cse6 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse7 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|)) (.cse5 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (= .cse2 800) (= 800 (select (store (store (store .cse3 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse6) .cse7 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse1)) (< (select .cse3 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (not (= (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse3 .cse5 .cse6) .cse7 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse5) 800)))))))))) is different from false [2024-11-15 21:24:05,455 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (v_ArrVal_1618 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))))) (let ((.cse8 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1618) |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse5))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse9 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (= (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse5) 800) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (= 800 .cse6) (not (= (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2) 800)) (< (select .cse8 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|))))))))) (< |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|))) is different from false [2024-11-15 21:24:05,540 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (v_ArrVal_1618 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))))) (let ((.cse10 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_1618) |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse11 .cse5))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse11 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (= (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse5) 800) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (= 800 .cse8) (not (= (select (select (store (store .cse9 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2) 800)) (< (select .cse10 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)))))))))) is different from false [2024-11-15 21:24:05,931 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (v_ArrVal_1618 (Array Int Int)) (v_ArrVal_1628 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))))) (let ((.cse10 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1618) |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse9 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select .cse11 .cse9))) (let ((.cse4 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse11 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse9 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|))) (let ((.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse7 (+ |c_~#queue~0.offset| (* (select .cse4 .cse9) 4)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (= 800 .cse2) (not (= (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 .cse6) .cse7 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse5) 800)) (< (select .cse4 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (< (select .cse10 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (= (select (store (store (store .cse4 .cse8 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse6) .cse7 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse9) 800)))))))))) is different from false [2024-11-15 21:24:06,246 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (v_ArrVal_1618 (Array Int Int)) (v_ArrVal_1628 (Array Int Int))) (let ((.cse9 (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|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1618) |c_~#queue~0.base|))) (let ((.cse11 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_38|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse11 .cse1))) (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse11 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse1 (+ 1 .cse8))) |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|))) (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse6 (+ (* 4 (select .cse3 .cse1)) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 .cse5) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse4) 800)) (= 800 .cse8) (< (select .cse3 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (< (select .cse9 .cse10) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (= (select (store (store (store .cse3 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse5) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse1) 800)))))))))) is different from false [2024-11-15 21:24:06,357 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (v_ArrVal_1618 (Array Int Int)) (v_ArrVal_1628 (Array Int Int))) (let ((.cse9 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))))) (let ((.cse10 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1618) |c_~#queue~0.base|))) (let ((.cse12 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_38|)) (.cse8 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse11 (select .cse12 .cse8))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse12 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse8 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse6 (+ (* 4 (select .cse2 .cse8)) |c_~#queue~0.offset|))) (or (< (select .cse2 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (not (= (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 .cse5) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse3) 800)) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (= (select (store (store (store .cse2 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse5) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse8) 800) (< (select .cse10 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (= 800 .cse11))))))))))))) is different from false [2024-11-15 21:24:06,564 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_1618 (Array Int Int)) (v_ArrVal_1628 (Array Int Int))) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))))) (let ((.cse8 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_1618) |c_~#queue~0.base|))) (let ((.cse12 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_38|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse11 (select .cse12 .cse7))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse12 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse7 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|))) (let ((.cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse6 (+ (* (select .cse2 .cse7) 4) |c_~#queue~0.offset|)) (.cse4 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (= (select (store (store (store .cse2 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse5) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse7) 800) (< (select .cse2 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (< (select .cse8 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (not (= 800 (select (select (store (store .cse9 |c_~#queue~0.base| (store (store (store (store .cse2 .cse4 .cse5) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse4))) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (= .cse11 800))))))))))) is different from false [2024-11-15 21:24:20,798 INFO L349 Elim1Store]: treesize reduction 410, result has 38.6 percent of original size [2024-11-15 21:24:20,798 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 1492 treesize of output 825 [2024-11-15 21:24:20,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:24:20,865 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 883 treesize of output 881 [2024-11-15 21:24:20,891 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 46 treesize of output 30 [2024-11-15 21:24:20,924 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 38 treesize of output 30 [2024-11-15 21:24:20,958 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 59 treesize of output 55 [2024-11-15 21:24:21,057 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-15 21:24:21,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:24:21,315 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 123 treesize of output 131 [2024-11-15 21:24:21,523 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-15 21:24:21,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:24:21,676 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 307 treesize of output 315 [2024-11-15 21:24:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2024-11-15 21:24:40,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380199529] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-15 21:24:40,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-15 21:24:40,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 38, 47] total 121 [2024-11-15 21:24:40,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499451018] [2024-11-15 21:24:40,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-15 21:24:40,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2024-11-15 21:24:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:24:40,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2024-11-15 21:24:40,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=9622, Unknown=125, NotChecked=3330, Total=14520 [2024-11-15 21:24:40,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:24:40,583 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:24:40,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 46.29752066115702) internal successors, (5602), 121 states have internal predecessors, (5602), 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-15 21:24:40,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:24:40,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:24:40,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:24:40,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:24:40,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:24:40,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:24:40,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-15 21:24:40,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-15 21:24:40,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-11-15 21:24:40,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-11-15 21:24:40,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:26:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:26:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:26:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:26:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-15 21:26:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:26:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:26:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-15 21:26:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-15 21:26:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-15 21:26:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-15 21:26:37,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-15 21:26:37,814 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-15 21:26:37,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-15 21:26:37,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:26:37,996 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:26:37,996 INFO L132 ounterexampleChecker]: Examining path program with hash -1485015522, occurence #1 [2024-11-15 21:26:37,996 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:26:37,996 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:26:37,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:26:37,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1451431204, now seen corresponding path program 1 times [2024-11-15 21:26:37,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:26:37,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398855207] [2024-11-15 21:26:37,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:26:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:26:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:27:18,414 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-15 21:27:18,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:27:18,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398855207] [2024-11-15 21:27:18,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398855207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-15 21:27:18,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023274403] [2024-11-15 21:27:18,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:27:18,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-15 21:27:18,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 21:27:18,417 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-15 21:27:18,418 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-15 21:27:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:27:19,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 3975 conjuncts, 150 conjuncts are in the unsatisfiable core [2024-11-15 21:27:19,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-15 21:27:32,802 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-15 21:27:32,928 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-15 21:27:33,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:27:33,080 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-15 21:27:34,940 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-15 21:27:35,000 INFO L349 Elim1Store]: treesize reduction 102, result has 21.5 percent of original size [2024-11-15 21:27:35,000 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-15 21:27:35,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:35,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:35,329 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-15 21:27:35,330 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 43 [2024-11-15 21:27:36,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:27:36,097 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-15 21:27:36,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:36,431 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-15 21:27:38,418 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-15 21:27:38,442 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-11-15 21:27:38,442 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2024-11-15 21:27:38,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:38,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:38,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:38,711 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 47 treesize of output 37 [2024-11-15 21:27:39,244 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-15 21:27:39,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:39,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:27:39,596 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2024-11-15 21:27:41,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:41,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:41,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:41,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:41,099 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 51 treesize of output 44 [2024-11-15 21:27:41,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:41,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:27:41,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 44 [2024-11-15 21:27:43,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:43,511 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-15 21:27:43,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:43,599 INFO L349 Elim1Store]: treesize reduction 78, result has 33.9 percent of original size [2024-11-15 21:27:43,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 78 [2024-11-15 21:27:44,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:44,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:44,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:44,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:44,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:44,026 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 58 treesize of output 51 [2024-11-15 21:27:45,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:45,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:27:45,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-11-15 21:27:45,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:45,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:27:45,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 45 [2024-11-15 21:27:47,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:47,587 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 50 treesize of output 37 [2024-11-15 21:27:47,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:27:47,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 18 [2024-11-15 21:27:47,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-15 21:27:47,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-15 21:27:48,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-15 21:27:48,488 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-15 21:27:48,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-15 21:27:49,413 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t2Thread1of1ForFork1_dequeue_#t~mem43#1| 0)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or (not .cse0) (forall ((v_ArrVal_1918 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse1) 1)))) (or .cse0 (forall ((v_ArrVal_1918 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse1) 0)))))) is different from false [2024-11-15 21:27:50,447 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.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_1916 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse4 .cse5 v_ArrVal_1916)))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_1918 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 0)))))) (forall ((v_ArrVal_1916 Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse4 .cse5 v_ArrVal_1916)))) (or (forall ((v_ArrVal_1918 (Array Int Int))) (not (= (select (select (store .cse6 |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 1))) (not (= (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (select .cse7 (+ (* 4 (select .cse7 .cse1)) |c_~#queue~0.offset|))) 0))))))) is different from false [2024-11-15 21:27:51,037 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse5 (select .cse4 |c_~#stored_elements~0.base|)) (.cse6 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1916 Int)) (let ((.cse0 (store .cse4 |c_~#stored_elements~0.base| (store .cse5 .cse6 v_ArrVal_1916)))) (or (forall ((v_ArrVal_1918 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse1) 1))) (not (= (let ((.cse2 (select .cse0 |c_~#queue~0.base|))) (select .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)))) 0))))) (forall ((v_ArrVal_1916 Int)) (let ((.cse8 (store .cse4 |c_~#stored_elements~0.base| (store .cse5 .cse6 v_ArrVal_1916)))) (or (= (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (select .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)))) 0) (forall ((v_ArrVal_1918 (Array Int Int))) (not (= (select (select (store .cse8 |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse1) 0))))))))) is different from false [2024-11-15 21:27:51,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (let ((.cse3 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (select .cse4 |c_~#stored_elements~0.base|)) (.cse6 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1916 Int)) (let ((.cse2 (store .cse4 |c_~#stored_elements~0.base| (store .cse5 .cse6 v_ArrVal_1916)))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_1918 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 1)))))) (forall ((v_ArrVal_1916 Int)) (let ((.cse7 (store .cse4 |c_~#stored_elements~0.base| (store .cse5 .cse6 v_ArrVal_1916)))) (or (forall ((v_ArrVal_1918 (Array Int Int))) (not (= (select (select (store .cse7 |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 0))) (= (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (select .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|))) 0))))))) is different from false [2024-11-15 21:30:29,647 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse17 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse7 (select .cse16 .cse17)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse27)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse27))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse16 .cse17 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse1) 1)) (.cse12 (+ (* (select .cse10 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse11) .cse12 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse14))) (let ((.cse3 (store (store (store (store .cse10 .cse1 .cse11) .cse12 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 (+ .cse5 1)))) (let ((.cse4 (store (select (store .cse8 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (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)) (= 800 .cse5) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse6) 1)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse7)))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse16 .cse17 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse23 (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse24 (select .cse23 |c_~#queue~0.base|))) (let ((.cse25 (+ (select .cse24 .cse1) 1)) (.cse26 (+ (* (select .cse24 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse18 (select (store (store (store .cse24 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse25) .cse26 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse14))) (let ((.cse22 (store (store (store (store .cse24 .cse1 .cse25) .cse26 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 (+ .cse18 1)))) (let ((.cse20 (store (select (store .cse23 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= 800 .cse18) (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse6) 0)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse7) (= (let ((.cse21 (select (store (store .cse19 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|))) 0))))))))))))) is different from false [2024-11-15 21:30:30,632 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse18 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (select .cse16 .cse18)) (.cse7 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse28)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse28)) (.cse17 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse2) 1)) (.cse12 (+ (* (select .cse10 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse11) .cse12 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse14))) (let ((.cse4 (store (store (store (store .cse10 .cse2 .cse11) .cse12 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse13 (+ v_subst_1 1)) .cse14 (+ .cse0 1)))) (let ((.cse5 (store (select (store .cse8 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= .cse0 800) (= (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) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse6) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 0))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store .cse21 |c_~#stored_elements~0.base| (store (select .cse21 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse25 (select .cse24 |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse2) 1)) (.cse27 (+ (* (select .cse25 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse19 (select (store (store (store .cse25 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse26) .cse27 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse14))) (let ((.cse22 (store (store (store (store .cse25 .cse2 .cse26) .cse27 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse13 (+ v_subst_2 1)) .cse14 (+ .cse19 1)))) (let ((.cse23 (store (select (store .cse24 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= .cse19 800) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse6) (not (= (let ((.cse20 (select (store (store .cse21 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (select .cse20 (+ |c_~#queue~0.offset| (* (select .cse20 .cse2) 4)))) 0)) (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 1)))))))))))))) is different from false [2024-11-15 21:30:31,473 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse16 (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|)) (.cse18 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse5 (select .cse16 .cse18)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse28)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse28)) (.cse17 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse1) 1)) (.cse12 (+ |c_~#queue~0.offset| (* (select .cse10 .cse14) 4)))) (let ((.cse7 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse11) .cse12 v_subst_3) .cse14))) (let ((.cse3 (store (store (store (store .cse10 .cse1 .cse11) .cse12 v_subst_3) .cse13 (+ v_subst_1 1)) .cse14 (+ .cse7 1)))) (let ((.cse4 (store (select (store .cse8 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (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_enqueue_#t~post41#1_54| .cse5) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse6) 0)) (= .cse7 800)))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse25 (select .cse24 |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse1) 1)) (.cse27 (+ |c_~#queue~0.offset| (* (select .cse25 .cse14) 4)))) (let ((.cse23 (select (store (store (store .cse25 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse26) .cse27 v_subst_4) .cse14))) (let ((.cse22 (store (store (store (store .cse25 .cse1 .cse26) .cse27 v_subst_4) .cse13 (+ v_subst_2 1)) .cse14 (+ .cse23 1)))) (let ((.cse20 (store (select (store .cse24 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse6) 1)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse5) (not (= (let ((.cse21 (select (store (store .cse19 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse1) 4)))) 0)) (= .cse23 800))))))))))))) is different from false [2024-11-15 21:30:31,810 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse28 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse16 (let ((.cse29 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse29 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse29 .cse18) 4)) |c_t1Thread1of1ForFork0_enqueue_~x#1|)))) (let ((.cse7 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse6 (select .cse16 .cse18)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse28)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse28)) (.cse17 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse2) 1)) (.cse12 (+ |c_~#queue~0.offset| (* (select .cse10 .cse14) 4)))) (let ((.cse0 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse11) .cse12 v_subst_3) .cse14))) (let ((.cse4 (store (store (store (store .cse10 .cse2 .cse11) .cse12 v_subst_3) .cse13 (+ v_subst_1 1)) .cse14 (+ .cse0 1)))) (let ((.cse5 (store (select (store .cse8 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= 800 .cse0) (= (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) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse6) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 0))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store .cse21 |c_~#stored_elements~0.base| (store (select .cse21 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse25 (select .cse24 |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse2) 1)) (.cse27 (+ |c_~#queue~0.offset| (* (select .cse25 .cse14) 4)))) (let ((.cse19 (select (store (store (store .cse25 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse26) .cse27 v_subst_4) .cse14))) (let ((.cse22 (store (store (store (store .cse25 .cse2 .cse26) .cse27 v_subst_4) .cse13 (+ v_subst_2 1)) .cse14 (+ .cse19 1)))) (let ((.cse23 (store (select (store .cse24 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= 800 .cse19) (not (= (let ((.cse20 (select (store (store .cse21 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (select .cse20 (+ (* (select .cse20 .cse2) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 1)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse6)))))))))))))) is different from false [2024-11-15 21:30:32,204 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse28 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse16 (let ((.cse29 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse29 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse29 .cse18) 4)) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|)))) (let ((.cse4 (select .cse16 .cse18)) (.cse2 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse28)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#queue~0.offset| 3204)) (.cse6 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse28)) (.cse17 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse6) 1)) (.cse12 (+ (* (select .cse10 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse6 .cse11) .cse12 v_subst_4) .cse14))) (let ((.cse7 (store (store (store (store .cse10 .cse6 .cse11) .cse12 v_subst_4) .cse13 (+ v_subst_2 1)) .cse14 (+ .cse3 1)))) (let ((.cse1 (store (select (store .cse8 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse2) 1)) (= .cse3 800) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse4) (not (= (let ((.cse5 (select (store (store .cse0 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse6) 4)))) 0))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse25 (select .cse24 |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse6) 1)) (.cse27 (+ (* (select .cse25 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse19 (select (store (store (store .cse25 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse6 .cse26) .cse27 v_subst_3) .cse14))) (let ((.cse23 (store (store (store (store .cse25 .cse6 .cse26) .cse27 v_subst_3) .cse13 (+ v_subst_1 1)) .cse14 (+ .cse19 1)))) (let ((.cse21 (store (select (store .cse24 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse4) (= .cse19 800) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse2) 0)) (= (let ((.cse22 (select (store (store .cse20 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse22 (+ (* (select .cse22 .cse6) 4) |c_~#queue~0.offset|))) 0)))))))))))))) is different from false [2024-11-15 21:30:32,513 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse28 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse16 (let ((.cse29 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse29 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse29 .cse18))) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|)))) (let ((.cse6 (select .cse16 .cse18)) (.cse2 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse28)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#queue~0.offset| 3204)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse28)) (.cse17 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse4) 1)) (.cse12 (+ (* (select .cse10 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse11) .cse12 v_subst_4) .cse14))) (let ((.cse5 (store (store (store (store .cse10 .cse4 .cse11) .cse12 v_subst_4) .cse13 (+ v_subst_2 1)) .cse14 (+ .cse7 1)))) (let ((.cse1 (store (select (store .cse8 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse2) 1)) (not (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)))) 0)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse6) (= 800 .cse7)))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store .cse21 |c_~#stored_elements~0.base| (store (select .cse21 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse25 (select .cse24 |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse4) 1)) (.cse27 (+ (* (select .cse25 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse19 (select (store (store (store .cse25 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse26) .cse27 v_subst_3) .cse14))) (let ((.cse22 (store (store (store (store .cse25 .cse4 .cse26) .cse27 v_subst_3) .cse13 (+ v_subst_1 1)) .cse14 (+ .cse19 1)))) (let ((.cse23 (store (select (store .cse24 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= .cse19 800) (= (let ((.cse20 (select (store (store .cse21 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (select .cse20 (+ (* (select .cse20 .cse4) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse6) (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse2) 0))))))))))))))) is different from false [2024-11-15 21:30:33,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse28 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse3 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse28)) (.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse28)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse17 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (store .cse16 .cse17 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse14 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store (select .cse14 |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse10 (select (store .cse14 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse5) 1)) (.cse12 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse11) .cse12 v_subst_3) .cse1))) (let ((.cse6 (store (store (store (store .cse10 .cse5 .cse11) .cse12 v_subst_3) .cse13 (+ v_subst_1 1)) .cse1 (+ .cse7 1)))) (let ((.cse2 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse0 .cse1)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 0)) (= 0 (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (select .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse5) 4))))) (= 800 .cse7))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse19 (store .cse16 .cse17 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse27 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse19 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse23 (store (select .cse27 |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse24 (select (store .cse27 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (let ((.cse25 (+ (select .cse24 .cse5) 1)) (.cse26 (+ (* (select .cse24 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse18 (select (store (store (store .cse24 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse25) .cse26 v_subst_4) .cse1))) (let ((.cse21 (store (store (store (store .cse24 .cse5 .cse25) .cse26 v_subst_4) .cse13 (+ v_subst_2 1)) .cse1 (+ .cse18 1)))) (let ((.cse22 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= 800 .cse18) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse19 .cse1)) (not (= (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse20 (+ (* (select .cse20 .cse5) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 1))))))))))))))) is different from false [2024-11-15 21:30:35,474 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse28 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse28)) (.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse28)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse17 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (store .cse16 .cse17 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse14 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store (select .cse14 |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse10 (select (store .cse14 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse5) 1)) (.cse12 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse11) .cse12 v_subst_3) .cse1))) (let ((.cse6 (store (store (store (store .cse10 .cse5 .cse11) .cse12 v_subst_3) .cse13 (+ v_subst_1 1)) .cse1 (+ .cse7 1)))) (let ((.cse2 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse0 .cse1)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 0)) (= 0 (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (select .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse5) 4))))) (= 800 .cse7))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse19 (store .cse16 .cse17 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse27 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse19 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse23 (store (select .cse27 |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse24 (select (store .cse27 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (let ((.cse25 (+ (select .cse24 .cse5) 1)) (.cse26 (+ (* (select .cse24 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse18 (select (store (store (store .cse24 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse25) .cse26 v_subst_4) .cse1))) (let ((.cse21 (store (store (store (store .cse24 .cse5 .cse25) .cse26 v_subst_4) .cse13 (+ v_subst_2 1)) .cse1 (+ .cse18 1)))) (let ((.cse22 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= 800 .cse18) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse19 .cse1)) (not (= (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse20 (+ (* (select .cse20 .cse5) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 1))))))))))))))) is different from false [2024-11-15 21:30:37,361 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (+ |c_~#stored_elements~0.offset| 8)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse16 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (store .cse15 .cse16 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse14 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store (select .cse14 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse10 (select (store .cse14 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse3) 1)) (.cse12 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse11) .cse12 v_subst_4) .cse1))) (let ((.cse4 (store (store (store (store .cse10 .cse3 .cse11) .cse12 v_subst_4) .cse13 (+ v_subst_2 1)) .cse1 (+ .cse6 1)))) (let ((.cse5 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse0 .cse1)) (not (= (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse2 (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse3))))) 0)) (= .cse6 800) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 1)))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse17 (store .cse15 .cse16 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse26 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse17 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse22 (store (select .cse26 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (select (store .cse26 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (let ((.cse24 (+ (select .cse23 .cse3) 1)) (.cse25 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse18 (select (store (store (store .cse23 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse24) .cse25 v_subst_3) .cse1))) (let ((.cse21 (store (store (store (store .cse23 .cse3 .cse24) .cse25 v_subst_3) .cse13 (+ v_subst_1 1)) .cse1 (+ .cse18 1)))) (let ((.cse19 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse17 .cse1)) (= .cse18 800) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 0)) (= (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse20 (+ (* 4 (select .cse20 .cse3)) |c_~#queue~0.offset|))) 0)))))))))))))) is different from false [2024-11-15 21:30:41,055 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_~#stored_elements~0.offset| 8)) (.cse6 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse0 (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse14 (store (store .cse0 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse8 (store (select (store .cse15 |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse6) 1)) (.cse12 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse6 .cse11) .cse12 v_subst_3) .cse1))) (let ((.cse7 (store (store (store (store .cse10 .cse6 .cse11) .cse12 v_subst_3) .cse13 (+ v_subst_1 1)) .cse1 (+ .cse4 1)))) (let ((.cse2 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse0 .cse1)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 0)) (= .cse4 800) (= (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (select .cse5 (+ (* (select .cse5 .cse6) 4) |c_~#queue~0.offset|))) 0)))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse27 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse21 (let ((.cse28 (select .cse27 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse26 (store (store .cse21 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse22 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (let ((.cse24 (+ (select .cse23 .cse6) 1)) (.cse25 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse17 (select (store (store (store .cse23 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse6 .cse24) .cse25 v_subst_4) .cse1))) (let ((.cse19 (store (store (store (store .cse23 .cse6 .cse24) .cse25 v_subst_4) .cse13 (+ v_subst_2 1)) .cse1 (+ .cse17 1)))) (let ((.cse20 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= .cse17 800) (not (= (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse18 (+ (* (select .cse18 .cse6) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse21 .cse1)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 1))))))))))))))) is different from false [2024-11-15 21:30:44,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse14 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse16 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse7 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store .cse7 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse9 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse11 (select (store (store .cse2 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (let ((.cse12 (+ (select .cse11 .cse1) 1)) (.cse13 (+ (* (select .cse11 .cse8) 4) |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store (store .cse11 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse12) .cse13 v_subst_4) .cse8))) (let ((.cse3 (store (store (store (store .cse11 .cse1 .cse12) .cse13 v_subst_4) .cse14 (+ v_subst_2 1)) .cse8 (+ .cse5 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0)) (= .cse5 800) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse6) 1)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse7 .cse8))))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse28 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse19 (let ((.cse29 (select .cse28 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse27 (store (store .cse19 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse23 (store (select (store .cse28 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse24 (select (store (store .cse2 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (let ((.cse25 (+ (select .cse24 .cse1) 1)) (.cse26 (+ (* (select .cse24 .cse8) 4) |c_~#queue~0.offset|))) (let ((.cse18 (select (store (store (store .cse24 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse25) .cse26 v_subst_3) .cse8))) (let ((.cse22 (store (store (store (store .cse24 .cse1 .cse25) .cse26 v_subst_3) .cse14 (+ v_subst_1 1)) .cse8 (+ .cse18 1)))) (let ((.cse20 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (= 800 .cse18) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse19 .cse8)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse6) 0)) (= (let ((.cse21 (select (store (store .cse2 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|))) 0)))))))))))))) is different from false [2024-11-15 21:30:45,046 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse14 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse16 (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse6 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store .cse6 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse9 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse11 (select (store (store .cse3 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (let ((.cse12 (+ (select .cse11 .cse2) 1)) (.cse13 (+ (* (select .cse11 .cse7) 4) |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse11 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse12) .cse13 v_subst_4) .cse7))) (let ((.cse4 (store (store (store (store .cse11 .cse2 .cse12) .cse13 v_subst_4) .cse14 (+ v_subst_2 1)) .cse7 (+ .cse0 1)))) (let ((.cse5 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (= .cse0 800) (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)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse6 .cse7)) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse8) 1))))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse28 (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse18 (let ((.cse29 (select .cse28 |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* (select .cse29 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse27 (store (store .cse18 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse23 (store (select (store .cse28 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse24 (select (store (store .cse3 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (let ((.cse25 (+ (select .cse24 .cse2) 1)) (.cse26 (+ (* (select .cse24 .cse7) 4) |c_~#queue~0.offset|))) (let ((.cse19 (select (store (store (store .cse24 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse25) .cse26 v_subst_3) .cse7))) (let ((.cse21 (store (store (store (store .cse24 .cse2 .cse25) .cse26 v_subst_3) .cse14 (+ v_subst_1 1)) .cse7 (+ .cse19 1)))) (let ((.cse22 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse18 .cse7)) (= .cse19 800) (= (let ((.cse20 (select (store (store .cse3 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse20 (+ (* 4 (select .cse20 .cse2)) |c_~#queue~0.offset|))) 0) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse8) 0))))))))))))))) is different from false [2024-11-15 21:30:45,406 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse14 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 3204)) (.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse30 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse31 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse30 .cse31 (+ (select .cse30 .cse31) 1)))))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse16 (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse7 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store .cse7 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse9 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse11 (select (store (store .cse1 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (let ((.cse12 (+ (select .cse11 .cse5) 1)) (.cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse11 .cse8))))) (let ((.cse0 (select (store (store (store .cse11 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse12) .cse13 v_subst_3) .cse8))) (let ((.cse6 (store (store (store (store .cse11 .cse5 .cse12) .cse13 v_subst_3) .cse14 (+ v_subst_1 1)) .cse8 (+ .cse0 1)))) (let ((.cse2 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (= .cse0 800) (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_1918) |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_enqueue_#t~post41#1_54| (select .cse7 .cse8))))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse28 (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse21 (let ((.cse29 (select .cse28 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse27 (store (store .cse21 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse23 (store (select (store .cse28 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse24 (select (store (store .cse1 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (let ((.cse25 (+ (select .cse24 .cse5) 1)) (.cse26 (+ |c_~#queue~0.offset| (* 4 (select .cse24 .cse8))))) (let ((.cse22 (select (store (store (store .cse24 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse25) .cse26 v_subst_4) .cse8))) (let ((.cse20 (store (store (store (store .cse24 .cse5 .cse25) .cse26 v_subst_4) .cse14 (+ v_subst_2 1)) .cse8 (+ .cse22 1)))) (let ((.cse18 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 1)) (not (= (let ((.cse19 (select (store (store .cse1 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (select .cse19 (+ (* (select .cse19 .cse5) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse21 .cse8)) (= .cse22 800)))))))))))))) is different from false [2024-11-15 21:30:48,973 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse14 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 3204)) (.cse19 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse21 (+ (select .cse18 .cse20) 1))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 .cse21)))) (let ((.cse16 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse7 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse8) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store .cse7 .cse14 (+ v_subst_6 1)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse9 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse11 (select (store (store .cse2 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (let ((.cse12 (+ (select .cse11 .cse1) 1)) (.cse13 (+ (* (select .cse11 .cse8) 4) |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store (store .cse11 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse12) .cse13 v_subst_4) .cse8))) (let ((.cse3 (store (store (store (store .cse11 .cse1 .cse12) .cse13 v_subst_4) .cse14 (+ v_subst_2 1)) .cse8 (+ .cse6 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse5) 1)) (= 800 .cse6) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse7 .cse8)))))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse23 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 .cse21)))) (let ((.cse33 (store .cse23 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse27 (let ((.cse34 (select .cse33 |c_~#queue~0.base|))) (store .cse34 (+ |c_~#queue~0.offset| (* (select .cse34 .cse8) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse32 (store (store .cse27 .cse14 (+ v_subst_5 1)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse28 (store (select (store .cse33 |c_~#queue~0.base| .cse32) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse29 (select (store (store .cse23 |c_~#queue~0.base| .cse32) |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base|))) (let ((.cse30 (+ (select .cse29 .cse1) 1)) (.cse31 (+ (* (select .cse29 .cse8) 4) |c_~#queue~0.offset|))) (let ((.cse26 (select (store (store (store .cse29 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse30) .cse31 v_subst_3) .cse8))) (let ((.cse24 (store (store (store (store .cse29 .cse1 .cse30) .cse31 v_subst_3) .cse14 (+ v_subst_1 1)) .cse8 (+ .cse26 1)))) (let ((.cse25 (store (select (store (store .cse23 |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (= (let ((.cse22 (select (store (store .cse23 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (select .cse22 (+ |c_~#queue~0.offset| (* 4 (select .cse22 .cse1))))) 0) (= 800 .cse26) (not (= (select (select (store (store .cse23 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse5) 0)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse27 .cse8))))))))))))))))) is different from false [2024-11-15 21:30:51,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse14 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 3204)) (.cse19 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse20 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse22 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse18 (store .cse21 .cse22 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse18 .cse20) 1)))))) (let ((.cse16 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse5 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store .cse5 .cse14 (+ v_subst_5 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse9 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse11 (select (store (store .cse2 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (let ((.cse12 (+ (select .cse11 .cse1) 1)) (.cse13 (+ (* (select .cse11 .cse6) 4) |c_~#queue~0.offset|))) (let ((.cse8 (select (store (store (store .cse11 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse12) .cse13 v_subst_3) .cse6))) (let ((.cse3 (store (store (store (store .cse11 .cse1 .cse12) .cse13 v_subst_3) .cse14 (+ v_subst_1 1)) .cse6 (+ .cse8 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (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| (* 4 (select .cse0 .cse1))))) 0) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse5 .cse6)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 0)) (= .cse8 800))))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse24 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse36 (store .cse21 .cse22 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse36 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse36 .cse20) 1)))))) (let ((.cse34 (store .cse24 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse28 (let ((.cse35 (select .cse34 |c_~#queue~0.base|))) (store .cse35 (+ (* (select .cse35 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse33 (store (store .cse28 .cse14 (+ v_subst_6 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse29 (store (select (store .cse34 |c_~#queue~0.base| .cse33) |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse30 (select (store (store .cse24 |c_~#queue~0.base| .cse33) |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base|))) (let ((.cse31 (+ (select .cse30 .cse1) 1)) (.cse32 (+ (* (select .cse30 .cse6) 4) |c_~#queue~0.offset|))) (let ((.cse27 (select (store (store (store .cse30 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse31) .cse32 v_subst_4) .cse6))) (let ((.cse25 (store (store (store (store .cse30 .cse1 .cse31) .cse32 v_subst_4) .cse14 (+ v_subst_2 1)) .cse6 (+ .cse27 1)))) (let ((.cse26 (store (select (store (store .cse24 |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (not (= (let ((.cse23 (select (store (store .cse24 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base|))) (select .cse23 (+ (* 4 (select .cse23 .cse1)) |c_~#queue~0.offset|))) 0)) (= 800 .cse27) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse28 .cse6)) (not (= (select (select (store (store .cse24 |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 1)))))))))))))))) is different from false [2024-11-15 21:30:52,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse22 (select .cse21 .cse20)) (.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse14 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204)) (.cse19 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse18 (store .cse21 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse18 .cse20) 1)))))) (let ((.cse16 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse6 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store .cse6 .cse14 (+ v_subst_6 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse9 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse11 (select (store (store .cse2 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (let ((.cse12 (+ (select .cse11 .cse1) 1)) (.cse13 (+ |c_~#queue~0.offset| (* (select .cse11 .cse7) 4)))) (let ((.cse5 (select (store (store (store .cse11 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse12) .cse13 v_subst_4) .cse7))) (let ((.cse3 (store (store (store (store .cse11 .cse1 .cse12) .cse13 v_subst_4) .cse14 (+ v_subst_2 1)) .cse7 (+ .cse5 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (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)) (= .cse5 800) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse6 .cse7)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse8) 1)))))))))))))) (< .cse22 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse22 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse24 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse36 (store .cse21 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse36 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse36 .cse20) 1)))))) (let ((.cse34 (store .cse24 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse23 (let ((.cse35 (select .cse34 |c_~#queue~0.base|))) (store .cse35 (+ |c_~#queue~0.offset| (* (select .cse35 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse33 (store (store .cse23 .cse14 (+ v_subst_5 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse29 (store (select (store .cse34 |c_~#queue~0.base| .cse33) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse30 (select (store (store .cse24 |c_~#queue~0.base| .cse33) |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base|))) (let ((.cse31 (+ (select .cse30 .cse1) 1)) (.cse32 (+ (* (select .cse30 .cse7) 4) |c_~#queue~0.offset|))) (let ((.cse28 (select (store (store (store .cse30 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse31) .cse32 v_subst_3) .cse7))) (let ((.cse27 (store (store (store (store .cse30 .cse1 .cse31) .cse32 v_subst_3) .cse14 (+ v_subst_1 1)) .cse7 (+ 1 .cse28)))) (let ((.cse25 (store (select (store (store .cse24 |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse23 .cse7)) (not (= (select (select (store (store .cse24 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse8) 0)) (= (let ((.cse26 (select (store (store .cse24 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (select .cse26 (+ |c_~#queue~0.offset| (* (select .cse26 .cse1) 4)))) 0) (= 800 .cse28)))))))))))))))))) is different from false [2024-11-15 21:30:54,111 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse21 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select .cse22 .cse21)) (.cse11 (+ |c_~#stored_elements~0.offset| 8)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse15 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse20 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~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_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse19 (store .cse22 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse19 .cse20 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse21 (+ (select .cse19 .cse21) 1)))))) (let ((.cse17 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse1 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse16 (store (store .cse1 .cse15 (+ v_subst_5 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse10 (store (select (store .cse17 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse12 (select (store (store .cse5 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (let ((.cse13 (+ (select .cse12 .cse4) 1)) (.cse14 (+ |c_~#queue~0.offset| (* (select .cse12 .cse2) 4)))) (let ((.cse9 (select (store (store (store .cse12 .cse15 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse13) .cse14 v_subst_3) .cse2))) (let ((.cse6 (store (store (store (store .cse12 .cse4 .cse13) .cse14 v_subst_3) .cse15 (+ v_subst_1 1)) .cse2 (+ .cse9 1)))) (let ((.cse7 (store (select (store (store .cse5 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse11 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse1 .cse2)) (= (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0) (not (= (select (select (store (store .cse5 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse8) 0)) (= 800 .cse9))))))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse26 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse36 (store .cse22 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse36 .cse20 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse21 (+ (select .cse36 .cse21) 1)))))) (let ((.cse34 (store .cse26 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse23 (let ((.cse35 (select .cse34 |c_~#queue~0.base|))) (store .cse35 (+ (* (select .cse35 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse33 (store (store .cse23 .cse15 (+ v_subst_6 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse29 (store (select (store .cse34 |c_~#queue~0.base| .cse33) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse30 (select (store (store .cse26 |c_~#queue~0.base| .cse33) |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base|))) (let ((.cse31 (+ (select .cse30 .cse4) 1)) (.cse32 (+ (* (select .cse30 .cse2) 4) |c_~#queue~0.offset|))) (let ((.cse24 (select (store (store (store .cse30 .cse15 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse31) .cse32 v_subst_4) .cse2))) (let ((.cse27 (store (store (store (store .cse30 .cse4 .cse31) .cse32 v_subst_4) .cse15 (+ v_subst_2 1)) .cse2 (+ .cse24 1)))) (let ((.cse28 (store (select (store (store .cse26 |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse11 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse23 .cse2)) (= .cse24 800) (not (= (let ((.cse25 (select (store (store .cse26 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base|))) (select .cse25 (+ (* (select .cse25 .cse4) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse26 |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse8) 1))))))))))))))))))) is different from false [2024-11-15 21:30:57,657 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse18 (select .cse17 .cse6))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse16 (store .cse17 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse16 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ (select .cse16 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse14 (store (store .cse5 .cse13 (+ v_subst_5 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse8 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse1) 1)) (.cse12 (+ (* 4 (select .cse10 .cse6)) |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse11) .cse12 v_subst_3) .cse6))) (let ((.cse2 (store (store (store (store .cse10 .cse1 .cse11) .cse12 v_subst_3) .cse13 (+ v_subst_1 1)) .cse6 (+ .cse4 1)))) (let ((.cse3 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse2) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= (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 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|))) 0) (= 800 .cse4) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse5 .cse6)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 0)))))))))))) (< .cse18 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse23 (let ((.cse29 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse30 (store .cse17 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse30 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ (select .cse30 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse28 (store (store .cse23 .cse13 (+ v_subst_6 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse24 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base| .cse28) |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse25 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse28) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse1) 1)) (.cse27 (+ (* 4 (select .cse25 .cse6)) |c_~#queue~0.offset|))) (let ((.cse22 (select (store (store (store .cse25 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse26) .cse27 v_subst_4) .cse6))) (let ((.cse20 (store (store (store (store .cse25 .cse1 .cse26) .cse27 v_subst_4) .cse13 (+ v_subst_2 1)) .cse6 (+ .cse22 1)))) (let ((.cse21 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (not (= (let ((.cse19 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse1) 4)))) 0)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 1)) (= 800 .cse22) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse23 .cse6)))))))))))) (< .cse18 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|)))))) is different from false [2024-11-15 21:31:16,283 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (let ((.cse19 (select .cse4 |c_~#queue~0.base|)) (.cse9 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse19 .cse9)) (.cse11 (+ |c_~#stored_elements~0.offset| 8)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse15 (+ 3208 |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_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse8 (let ((.cse17 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse18 (store .cse19 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse18 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse18 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse16 (store (store .cse8 .cse15 (+ v_subst_5 1)) .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse10 (store (select (store (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse12 (select (store (store .cse4 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (let ((.cse13 (+ (select .cse12 .cse3) 1)) (.cse14 (+ (* (select .cse12 .cse9) 4) |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store (store .cse12 .cse15 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse13) .cse14 v_subst_3) .cse9))) (let ((.cse5 (store (store (store (store .cse12 .cse3 .cse13) .cse14 v_subst_3) .cse15 (+ v_subst_1 1)) .cse9 (+ .cse1 1)))) (let ((.cse6 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse11 v_ArrVal_1916))) (or (= 800 .cse1) (= (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (select .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)))) 0) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 0)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse8 .cse9)))))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse24 (let ((.cse30 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse31 (store .cse19 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse31 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse31 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse29 (store (store .cse24 .cse15 (+ v_subst_6 1)) .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse25 (store (select (store (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse26 (select (store (store .cse4 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (let ((.cse27 (+ (select .cse26 .cse3) 1)) (.cse28 (+ (* (select .cse26 .cse9) 4) |c_~#queue~0.offset|))) (let ((.cse20 (select (store (store (store .cse26 .cse15 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse27) .cse28 v_subst_4) .cse9))) (let ((.cse22 (store (store (store (store .cse26 .cse3 .cse27) .cse28 v_subst_4) .cse15 (+ v_subst_2 1)) .cse9 (+ .cse20 1)))) (let ((.cse23 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse11 v_ArrVal_1916))) (or (= .cse20 800) (not (= (let ((.cse21 (select (store (store .cse4 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (select .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse3) 4)))) 0)) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 1)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse24 .cse9)))))))))))))))))) is different from false [2024-11-15 21:31:16,908 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (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| 3204) 0) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (let ((.cse19 (select .cse3 |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse19 .cse7)) (.cse11 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#stored_elements~0.offset| 4)) (.cse15 (+ 3208 |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_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (let ((.cse17 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse18 (store .cse19 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse18 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse18 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse16 (store (store .cse6 .cse15 (+ v_subst_5 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse10 (store (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) .cse9 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse12 (select (store (store .cse3 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (let ((.cse13 (+ (select .cse12 .cse2) 1)) (.cse14 (+ |c_~#queue~0.offset| (* (select .cse12 .cse7) 4)))) (let ((.cse8 (select (store (store (store .cse12 .cse15 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse13) .cse14 v_subst_3) .cse7))) (let ((.cse4 (store (store (store (store .cse12 .cse2 .cse13) .cse14 v_subst_3) .cse15 (+ v_subst_1 1)) .cse7 (+ .cse8 1)))) (let ((.cse5 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse11 v_ArrVal_1916))) (or (= (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse6 .cse7)) (= 800 .cse8) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse9) 0)))))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse23 (let ((.cse30 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse31 (store .cse19 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse31 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse31 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse29 (store (store .cse23 .cse15 (+ v_subst_6 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse25 (store (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base|) .cse9 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse26 (select (store (store .cse3 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (let ((.cse27 (+ 1 (select .cse26 .cse2))) (.cse28 (+ |c_~#queue~0.offset| (* (select .cse26 .cse7) 4)))) (let ((.cse24 (select (store (store (store .cse26 .cse15 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse27) .cse28 v_subst_4) .cse7))) (let ((.cse21 (store (store (store (store .cse26 .cse2 .cse27) .cse28 v_subst_4) .cse15 (+ v_subst_2 1)) .cse7 (+ .cse24 1)))) (let ((.cse22 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse11 v_ArrVal_1916))) (or (not (= (let ((.cse20 (select (store (store .cse3 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse20 (+ (* (select .cse20 .cse2) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse23 .cse7)) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse9) 1)) (= 800 .cse24))))))))))))))))) is different from false [2024-11-15 21:31:19,829 INFO L349 Elim1Store]: treesize reduction 462, result has 37.0 percent of original size [2024-11-15 21:31:19,830 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 19177 treesize of output 4095 [2024-11-15 21:31:19,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:31:19,935 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 8062 treesize of output 8060 [2024-11-15 21:31:20,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-15 21:31:20,628 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 9376639 treesize of output 8584097 Received shutdown request... [2024-11-15 21:31:40,066 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:31:40,074 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-15 21:31:40,074 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-15 21:31:40,074 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-15 21:31:40,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-15 21:31:40,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-15 21:31:40,271 WARN L596 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1893 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-34-5-2-3-3-3-3-2-3-2-3-2-3-2-3-3-3-2-3-3-3-2-3-2-3-2-2-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-66-5-3-5-3-5-3-5-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-3-2-3-3-2-3-1 context. [2024-11-15 21:31:40,272 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-15 21:31:40,272 INFO L320 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (3/3) [2024-11-15 21:31:40,274 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-15 21:31:40,274 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-15 21:31:40,291 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-15 21:31:40,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:31:40 BasicIcfg [2024-11-15 21:31:40,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-15 21:31:40,293 INFO L158 Benchmark]: Toolchain (without parser) took 806504.62ms. Allocated memory was 100.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 70.3MB in the beginning and 557.4MB in the end (delta: -487.1MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2024-11-15 21:31:40,293 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-15 21:31:40,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 678.91ms. Allocated memory is still 100.7MB. Free memory was 70.0MB in the beginning and 23.1MB in the end (delta: 46.9MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2024-11-15 21:31:40,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 164.91ms. Allocated memory is still 100.7MB. Free memory was 23.1MB in the beginning and 55.0MB in the end (delta: -31.8MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2024-11-15 21:31:40,293 INFO L158 Benchmark]: Boogie Preprocessor took 130.16ms. Allocated memory is still 100.7MB. Free memory was 55.0MB in the beginning and 44.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2024-11-15 21:31:40,293 INFO L158 Benchmark]: RCFGBuilder took 2242.35ms. Allocated memory was 100.7MB in the beginning and 130.0MB in the end (delta: 29.4MB). Free memory was 44.5MB in the beginning and 40.8MB in the end (delta: 3.6MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB. [2024-11-15 21:31:40,294 INFO L158 Benchmark]: TraceAbstraction took 803282.67ms. Allocated memory was 130.0MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 39.9MB in the beginning and 557.4MB in the end (delta: -517.5MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2024-11-15 21:31:40,295 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.19ms. Allocated memory is still 100.7MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 678.91ms. Allocated memory is still 100.7MB. Free memory was 70.0MB in the beginning and 23.1MB in the end (delta: 46.9MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 164.91ms. Allocated memory is still 100.7MB. Free memory was 23.1MB in the beginning and 55.0MB in the end (delta: -31.8MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 130.16ms. Allocated memory is still 100.7MB. Free memory was 55.0MB in the beginning and 44.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2242.35ms. Allocated memory was 100.7MB in the beginning and 130.0MB in the end (delta: 29.4MB). Free memory was 44.5MB in the beginning and 40.8MB in the end (delta: 3.6MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB. * TraceAbstraction took 803282.67ms. Allocated memory was 130.0MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 39.9MB in the beginning and 557.4MB in the end (delta: -517.5MB). Peak memory consumption was 1.4GB. 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: 14647, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 181, dependent conditional: 150, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14502, independent: 14466, independent conditional: 1872, 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: 14502, independent: 14466, independent conditional: 1872, 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: 14520, independent: 14466, independent conditional: 1872, 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: 14520, independent: 14466, independent conditional: 0, independent unconditional: 14466, 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: 14520, independent: 14466, independent conditional: 0, independent unconditional: 14466, 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: 489, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 432, dependent conditional: 22, dependent unconditional: 410, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 14520, independent: 2738, independent conditional: 0, independent unconditional: 2738, 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: 1890, Maximal queried relation: 4, Independence queries for same thread: 145, Persistent sets #1 benchmarks: Persistent set computation time: 0.7s, Number of persistent set computation: 2245, Number of trivial persistent sets: 1990, 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: 14647, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 181, dependent conditional: 150, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14502, independent: 14466, independent conditional: 1872, 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: 14502, independent: 14466, independent conditional: 1872, 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: 14520, independent: 14466, independent conditional: 1872, 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: 14520, independent: 14466, independent conditional: 0, independent unconditional: 14466, 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: 14520, independent: 14466, independent conditional: 0, independent unconditional: 14466, 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: 489, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 432, dependent conditional: 22, dependent unconditional: 410, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 14520, independent: 2738, independent conditional: 0, independent unconditional: 2738, 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: 1890, Maximal queried relation: 4, Independence queries for same thread: 145 - 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 2081, Number of trivial persistent sets: 2075, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 18363, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 679, dependent conditional: 635, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 5499, 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: 17728, independent: 17684, independent conditional: 5499, 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: 17728, independent: 17684, independent conditional: 5499, 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: 17728, independent: 17684, independent conditional: 0, independent unconditional: 17684, 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: 17728, independent: 17684, independent conditional: 0, independent unconditional: 17684, 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: 233, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 17728, independent: 15241, independent conditional: 0, independent unconditional: 15241, 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: 5499, Maximal queried relation: 0, Independence queries for same thread: 635, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 2048, Number of trivial persistent sets: 1968, 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: 18363, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 679, dependent conditional: 635, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 5499, 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: 17728, independent: 17684, independent conditional: 5499, 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: 17728, independent: 17684, independent conditional: 5499, 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: 17728, independent: 17684, independent conditional: 0, independent unconditional: 17684, 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: 17728, independent: 17684, independent conditional: 0, independent unconditional: 17684, 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: 233, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 17728, independent: 15241, independent conditional: 0, independent unconditional: 15241, 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: 5499, Maximal queried relation: 0, Independence queries for same thread: 635 - 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 1893 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-34-5-2-3-3-3-3-2-3-2-3-2-3-2-3-3-3-2-3-3-3-2-3-2-3-2-2-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-66-5-3-5-3-5-3-5-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-3-2-3-3-2-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 2028 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 41.9s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 14.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 53, 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.8s SatisfiabilityAnalysisTime, 26.0s InterpolantComputationTime, 12053 NumberOfCodeBlocks, 12053 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 12046 ConstructedInterpolants, 0 QuantifiedInterpolants, 23474 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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, 2028 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, 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.3s InterpolantComputationTime, 1658 NumberOfCodeBlocks, 1658 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 1657 ConstructedInterpolants, 0 QuantifiedInterpolants, 1657 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, 2028 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 760.4s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 235.5s, 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: 258, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 219.0s InterpolantComputationTime, 23609 NumberOfCodeBlocks, 23609 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 27370 ConstructedInterpolants, 366 QuantifiedInterpolants, 227150 SizeOfPredicates, 111 NumberOfNonLiveVariables, 7939 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 136/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