/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-9b88b13 [2024-11-17 12:00:19,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 12:00:19,477 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-17 12:00:19,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 12:00:19,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 12:00:19,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 12:00:19,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 12:00:19,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 12:00:19,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 12:00:19,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 12:00:19,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 12:00:19,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 12:00:19,511 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 12:00:19,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 12:00:19,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 12:00:19,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 12:00:19,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 12:00:19,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 12:00:19,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 12:00:19,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 12:00:19,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 12:00:19,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 12:00:19,512 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 12:00:19,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 12:00:19,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 12:00:19,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-17 12:00:19,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 12:00:19,512 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-17 12:00:19,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 12:00:19,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-17 12:00:19,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 12:00:19,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 12:00:19,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 12:00:19,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 12:00:19,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 12:00:19,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 12:00:19,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-17 12:00:19,513 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-17 12:00:19,513 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-17 12:00:19,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP [2024-11-17 12:00:19,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 12:00:19,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 12:00:19,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 12:00:19,785 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 12:00:19,785 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 12:00:19,786 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-17 12:00:21,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/3e9fa9d96/05bf892175ce43819d187f7b6af9750c/FLAG836975048 [2024-11-17 12:00:21,430 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 12:00:21,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longest.i [2024-11-17 12:00:21,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/3e9fa9d96/05bf892175ce43819d187f7b6af9750c/FLAG836975048 [2024-11-17 12:00:21,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/3e9fa9d96/05bf892175ce43819d187f7b6af9750c [2024-11-17 12:00:21,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 12:00:21,471 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-17 12:00:21,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 12:00:21,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 12:00:21,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 12:00:21,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:00:21" (1/1) ... [2024-11-17 12:00:21,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fead652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:21, skipping insertion in model container [2024-11-17 12:00:21,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:00:21" (1/1) ... [2024-11-17 12:00:21,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 12:00:21,827 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-17 12:00:21,836 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-17 12:00:21,841 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-17 12:00:21,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 12:00:21,909 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 12:00:21,983 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-17 12:00:21,984 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-17 12:00:21,989 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-17 12:00:21,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 12:00:22,150 INFO L204 MainTranslator]: Completed translation [2024-11-17 12:00:22,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:22 WrapperNode [2024-11-17 12:00:22,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 12:00:22,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 12:00:22,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 12:00:22,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 12:00:22,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:22" (1/1) ... [2024-11-17 12:00:22,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:22" (1/1) ... [2024-11-17 12:00:22,292 INFO L138 Inliner]: procedures = 274, calls = 1656, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1838 [2024-11-17 12:00:22,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 12:00:22,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 12:00:22,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 12:00:22,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 12:00:22,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:22" (1/1) ... [2024-11-17 12:00:22,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:22" (1/1) ... [2024-11-17 12:00:22,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:22" (1/1) ... [2024-11-17 12:00:22,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:22" (1/1) ... [2024-11-17 12:00:22,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:22" (1/1) ... [2024-11-17 12:00:22,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:22" (1/1) ... [2024-11-17 12:00:22,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:22" (1/1) ... [2024-11-17 12:00:22,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:22" (1/1) ... [2024-11-17 12:00:22,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 12:00:22,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-17 12:00:22,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-17 12:00:22,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-17 12:00:22,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:22" (1/1) ... [2024-11-17 12:00:22,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-17 12:00:22,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-17 12:00:22,521 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-17 12:00:22,526 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-17 12:00:22,547 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-17 12:00:22,548 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-17 12:00:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-17 12:00:22,548 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-17 12:00:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-17 12:00:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-17 12:00:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-17 12:00:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-17 12:00:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 12:00:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-17 12:00:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 12:00:22,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 12:00:22,550 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 12:00:22,721 INFO L238 CfgBuilder]: Building ICFG [2024-11-17 12:00:22,723 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 12:00:24,659 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 12:00:24,659 INFO L287 CfgBuilder]: Performing block encoding [2024-11-17 12:00:24,730 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 12:00:24,734 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-17 12:00:24,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:00:24 BoogieIcfgContainer [2024-11-17 12:00:24,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-17 12:00:24,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 12:00:24,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 12:00:24,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 12:00:24,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:00:21" (1/3) ... [2024-11-17 12:00:24,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21da8616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:00:24, skipping insertion in model container [2024-11-17 12:00:24,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:22" (2/3) ... [2024-11-17 12:00:24,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21da8616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:00:24, skipping insertion in model container [2024-11-17 12:00:24,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:00:24" (3/3) ... [2024-11-17 12:00:24,743 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2024-11-17 12:00:24,757 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 12:00:24,759 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longest.i that has 3 procedures, 1852 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2024-11-17 12:00:24,759 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 12:00:24,965 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-17 12:00:25,070 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 12:00:25,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-17 12:00:25,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-17 12:00:25,073 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-17 12:00:25,075 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-17 12:00:25,174 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-17 12:00:25,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2024-11-17 12:00:25,193 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;@e17bc72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 12:00:25,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-17 12:00:25,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:25,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:25,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1539306567, now seen corresponding path program 1 times [2024-11-17 12:00:25,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:25,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824258158] [2024-11-17 12:00:25,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:25,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:27,822 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-17 12:00:27,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:27,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824258158] [2024-11-17 12:00:27,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824258158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:27,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:27,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 12:00:27,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425581744] [2024-11-17 12:00:27,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:27,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 12:00:27,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:27,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 12:00:27,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 12:00:27,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:27,872 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:27,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 847.5) internal successors, (1695), 2 states have internal predecessors, (1695), 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-17 12:00:27,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:28,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:28,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 12:00:28,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:28,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1863304432, now seen corresponding path program 1 times [2024-11-17 12:00:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433957599] [2024-11-17 12:00:28,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:28,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:30,192 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-17 12:00:30,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:30,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433957599] [2024-11-17 12:00:30,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433957599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:30,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:30,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 12:00:30,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801956234] [2024-11-17 12:00:30,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:30,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 12:00:30,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:30,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 12:00:30,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 12:00:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:30,208 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:30,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 423.25) internal successors, (1693), 4 states have internal predecessors, (1693), 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-17 12:00:30,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:30,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:30,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:30,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:30,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 12:00:30,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:30,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:30,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1735665203, now seen corresponding path program 1 times [2024-11-17 12:00:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:30,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699315831] [2024-11-17 12:00:30,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:30,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:38,951 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-17 12:00:38,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:38,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699315831] [2024-11-17 12:00:38,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699315831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:38,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:38,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 12:00:38,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981398762] [2024-11-17 12:00:38,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:38,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 12:00:38,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:38,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 12:00:38,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-17 12:00:38,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:38,958 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:38,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 142.66666666666666) internal successors, (1712), 12 states have internal predecessors, (1712), 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-17 12:00:38,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:38,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:38,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:00:43,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 12:00:43,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:43,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash 545281582, now seen corresponding path program 1 times [2024-11-17 12:00:43,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:43,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566999770] [2024-11-17 12:00:43,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:43,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:54,802 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-17 12:00:54,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:54,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566999770] [2024-11-17 12:00:54,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566999770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:54,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:54,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-17 12:00:54,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580469785] [2024-11-17 12:00:54,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:54,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 12:00:54,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:54,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 12:00:54,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2024-11-17 12:00:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:54,809 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:54,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 71.5) internal successors, (1716), 24 states have internal predecessors, (1716), 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-17 12:00:54,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:54,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:54,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:00:54,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:05,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:05,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:05,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:01:05,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-17 12:01:05,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 12:01:05,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:01:05,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:01:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1759805104, now seen corresponding path program 1 times [2024-11-17 12:01:05,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:01:05,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402112833] [2024-11-17 12:01:05,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:05,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:01:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:06,293 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-17 12:01:06,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:06,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402112833] [2024-11-17 12:01:06,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402112833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:01:06,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:01:06,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 12:01:06,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117005710] [2024-11-17 12:01:06,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:01:06,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 12:01:06,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:06,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 12:01:06,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 12:01:06,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:06,298 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:06,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 428.5) internal successors, (1714), 4 states have internal predecessors, (1714), 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-17 12:01:06,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:06,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:06,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:01:06,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-17 12:01:06,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:06,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:06,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:06,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:01:06,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 12:01:06,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:06,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 12:01:06,571 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:01:06,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:01:06,573 INFO L85 PathProgramCache]: Analyzing trace with hash 847686819, now seen corresponding path program 1 times [2024-11-17 12:01:06,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:01:06,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892635991] [2024-11-17 12:01:06,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:06,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:01:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:07,717 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-17 12:01:07,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:07,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892635991] [2024-11-17 12:01:07,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892635991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:01:07,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:01:07,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 12:01:07,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705958269] [2024-11-17 12:01:07,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:01:07,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 12:01:07,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:07,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 12:01:07,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 12:01:07,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:07,722 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:07,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.3333333333334) internal successors, (1744), 3 states have internal predecessors, (1744), 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-17 12:01:07,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:07,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:07,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:01:07,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-17 12:01:07,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:07,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:01:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 12:01:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:08,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 12:01:08,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:01:08,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:01:08,173 INFO L85 PathProgramCache]: Analyzing trace with hash 930453673, now seen corresponding path program 1 times [2024-11-17 12:01:08,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:01:08,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637532257] [2024-11-17 12:01:08,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:08,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:01:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:09,364 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-17 12:01:09,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:09,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637532257] [2024-11-17 12:01:09,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637532257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:01:09,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:01:09,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 12:01:09,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961779093] [2024-11-17 12:01:09,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:01:09,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 12:01:09,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:09,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 12:01:09,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 12:01:09,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:09,369 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:09,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.0) internal successors, (1758), 3 states have internal predecessors, (1758), 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-17 12:01:09,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:09,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:09,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:01:09,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-17 12:01:09,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:09,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:09,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:09,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:09,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:09,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:01:09,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 12:01:09,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:09,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:09,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-17 12:01:09,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 12:01:09,500 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-17 12:01:09,502 INFO L320 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork1 was SAFE (1/3) [2024-11-17 12:01:09,519 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 12:01:09,519 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-17 12:01:09,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-17 12:01:09,520 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;@e17bc72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 12:01:09,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-17 12:01:09,567 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-17 12:01:09,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:01:09,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1383004005, now seen corresponding path program 1 times [2024-11-17 12:01:09,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:01:09,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610238828] [2024-11-17 12:01:09,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:09,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:01:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:09,990 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-17 12:01:09,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:09,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610238828] [2024-11-17 12:01:09,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610238828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:01:09,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:01:09,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 12:01:09,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840656232] [2024-11-17 12:01:09,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:01:09,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 12:01:09,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:09,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 12:01:09,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 12:01:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:09,997 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:09,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 827.5) internal successors, (1655), 2 states have internal predecessors, (1655), 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-17 12:01:09,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:10,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:10,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-17 12:01:10,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-17 12:01:10,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-17 12:01:10,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 12:01:10,098 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-17 12:01:10,098 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2024-11-17 12:01:10,115 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 12:01:10,116 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-17 12:01:10,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork0 ======== [2024-11-17 12:01:10,117 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;@e17bc72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 12:01:10,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-17 12:01:10,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:01:10,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:01:10,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1461269944, now seen corresponding path program 1 times [2024-11-17 12:01:10,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:01:10,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308542998] [2024-11-17 12:01:10,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:10,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:01:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:10,631 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-17 12:01:10,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:10,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308542998] [2024-11-17 12:01:10,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308542998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:01:10,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:01:10,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 12:01:10,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655305196] [2024-11-17 12:01:10,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:01:10,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 12:01:10,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:10,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 12:01:10,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 12:01:10,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:10,635 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:10,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 869.5) internal successors, (1739), 2 states have internal predecessors, (1739), 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-17 12:01:10,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:10,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:10,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 12:01:10,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:01:10,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:01:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash -203488911, now seen corresponding path program 1 times [2024-11-17 12:01:10,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:01:10,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293462564] [2024-11-17 12:01:10,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:10,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:01:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:11,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-17 12:01:11,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:11,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293462564] [2024-11-17 12:01:11,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293462564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:01:11,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:01:11,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 12:01:11,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793935937] [2024-11-17 12:01:11,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:01:11,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 12:01:11,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:11,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 12:01:11,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 12:01:11,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:11,453 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:11,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 434.25) internal successors, (1737), 4 states have internal predecessors, (1737), 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-17 12:01:11,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:11,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:11,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:11,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:11,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 12:01:11,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:01:11,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:01:11,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1208535604, now seen corresponding path program 1 times [2024-11-17 12:01:11,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:01:11,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939518524] [2024-11-17 12:01:11,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:11,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:01:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:12,414 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-17 12:01:12,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:12,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939518524] [2024-11-17 12:01:12,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939518524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:01:12,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:01:12,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 12:01:12,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778370387] [2024-11-17 12:01:12,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:01:12,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 12:01:12,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:12,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 12:01:12,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 12:01:12,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:12,418 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:12,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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-17 12:01:12,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:12,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:12,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:12,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 12:01:12,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:01:12,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:01:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash -370126647, now seen corresponding path program 1 times [2024-11-17 12:01:12,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:01:12,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622700498] [2024-11-17 12:01:12,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:12,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:01:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:13,179 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-17 12:01:13,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:13,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622700498] [2024-11-17 12:01:13,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622700498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:01:13,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:01:13,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 12:01:13,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328138437] [2024-11-17 12:01:13,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:01:13,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 12:01:13,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:13,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 12:01:13,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 12:01:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:13,183 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:13,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 449.25) internal successors, (1797), 4 states have internal predecessors, (1797), 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-17 12:01:13,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:13,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:13,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:13,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:13,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 12:01:13,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:01:13,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:01:13,273 INFO L85 PathProgramCache]: Analyzing trace with hash 963864999, now seen corresponding path program 1 times [2024-11-17 12:01:13,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:01:13,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530573001] [2024-11-17 12:01:13,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:13,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:01:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:20,586 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-17 12:01:20,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:20,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530573001] [2024-11-17 12:01:20,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530573001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:01:20,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:01:20,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-17 12:01:20,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344081730] [2024-11-17 12:01:20,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:01:20,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 12:01:20,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:20,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 12:01:20,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-17 12:01:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:20,590 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:20,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 128.21428571428572) internal successors, (1795), 14 states have internal predecessors, (1795), 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-17 12:01:20,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:20,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:20,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:20,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:20,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:25,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 12:01:25,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 12:01:25,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:01:25,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:01:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash -962829876, now seen corresponding path program 1 times [2024-11-17 12:01:25,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:01:25,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363718186] [2024-11-17 12:01:25,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:25,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:01:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:34,387 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-17 12:01:34,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:34,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363718186] [2024-11-17 12:01:34,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363718186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:01:34,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:01:34,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-17 12:01:34,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920764914] [2024-11-17 12:01:34,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:01:34,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 12:01:34,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:34,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 12:01:34,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-11-17 12:01:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:34,391 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:34,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 81.77272727272727) internal successors, (1799), 22 states have internal predecessors, (1799), 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-17 12:01:34,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:34,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:34,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:34,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:34,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-17 12:01:34,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 12:01:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:01:42,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 12:01:42,856 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:01:42,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:01:42,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1880442567, now seen corresponding path program 1 times [2024-11-17 12:01:42,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:01:42,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354791786] [2024-11-17 12:01:42,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:01:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:55,860 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-17 12:01:55,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:55,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354791786] [2024-11-17 12:01:55,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354791786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:01:55,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:01:55,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-17 12:01:55,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914090565] [2024-11-17 12:01:55,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:01:55,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-17 12:01:55,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:55,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-17 12:01:55,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2024-11-17 12:01:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:55,864 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:55,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 64.39285714285714) internal successors, (1803), 28 states have internal predecessors, (1803), 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-17 12:01:55,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:55,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:55,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:55,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:55,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-17 12:01:55,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:01:55,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:02:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:02:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:02:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:02:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:02:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 12:02:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:02:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 12:02:03,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 12:02:03,502 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:02:03,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:02:03,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1147437910, now seen corresponding path program 1 times [2024-11-17 12:02:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:02:03,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368543711] [2024-11-17 12:02:03,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:02:03,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:02:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:02:22,925 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-17 12:02:22,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:02:22,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368543711] [2024-11-17 12:02:22,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368543711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:02:22,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:02:22,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2024-11-17 12:02:22,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795166014] [2024-11-17 12:02:22,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:02:22,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-17 12:02:22,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:02:22,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-17 12:02:22,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2024-11-17 12:02:22,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:02:22,930 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:02:22,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 47.5) internal successors, (1805), 38 states have internal predecessors, (1805), 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-17 12:02:22,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:02:22,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:02:22,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:02:22,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:02:22,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-17 12:02:22,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:02:22,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-17 12:02:22,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:02:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:02:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:02:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:02:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:02:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 12:02:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:02:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-17 12:02:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-17 12:02:39,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 12:02:39,474 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:02:39,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:02:39,475 INFO L85 PathProgramCache]: Analyzing trace with hash 836915645, now seen corresponding path program 1 times [2024-11-17 12:02:39,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:02:39,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943331542] [2024-11-17 12:02:39,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:02:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:02:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:02:53,052 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-17 12:02:53,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:02:53,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943331542] [2024-11-17 12:02:53,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943331542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 12:02:53,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699015168] [2024-11-17 12:02:53,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:02:53,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 12:02:53,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-17 12:02:53,055 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-17 12:02:53,056 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-17 12:02:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:02:53,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 3807 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-17 12:02:53,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 12:02:56,084 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-17 12:02:56,137 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-17 12:02:56,494 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 12:02:56,510 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2024-11-17 12:02:56,510 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-17 12:02:56,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:02:56,637 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 12:02:56,638 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-17 12:02:56,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-17 12:02:56,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:02:56,908 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-17 12:02:57,206 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 12:02:57,213 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-17 12:02:57,214 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-17 12:02:57,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:02:57,286 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-17 12:02:57,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-17 12:02:57,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:02:57,478 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-17 12:02:57,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:02:57,668 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-17 12:02:57,713 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-17 12:02:57,889 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-17 12:02:57,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-17 12:02:57,908 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-17 12:02:57,959 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-17 12:02:57,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 12:02:59,243 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 800)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-17 12:02:59,253 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 800)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-17 12:02:59,264 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-17 12:02:59,303 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 800)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-17 12:02:59,350 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|) .cse1) 800))))) is different from false [2024-11-17 12:02:59,366 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|) .cse1)))))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|)))) is different from false [2024-11-17 12:03:03,213 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_523 (Array Int Int)) (v_ArrVal_520 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_520) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_523) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|) .cse1) 800)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|)))))) is different from false [2024-11-17 12:03:03,312 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_523 (Array Int Int)) (v_ArrVal_520 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (v_ArrVal_517 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_517)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_520) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_523) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|)))))) is different from false [2024-11-17 12:03:03,353 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33|) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_523 (Array Int Int)) (v_ArrVal_520 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (v_ArrVal_517 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_517))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_520) .cse1 (+ 1 (select .cse7 .cse1))))))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_523) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= 800 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|) .cse3))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|))))))))) is different from false [2024-11-17 12:03:03,427 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_523 (Array Int Int)) (v_ArrVal_520 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_517 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse7 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_517))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_520) .cse3 (+ (select .cse7 .cse3) 1)))))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_523) |c_~#queue~0.base|))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33|) (not (= 800 (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|))))))) is different from false [2024-11-17 12:03:04,842 INFO L349 Elim1Store]: treesize reduction 306, result has 39.5 percent of original size [2024-11-17 12:03:04,843 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 650 treesize of output 417 [2024-11-17 12:03:04,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:03:04,905 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 420 treesize of output 420 [2024-11-17 12:03:04,932 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 93 treesize of output 85 [2024-11-17 12:03:04,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 12:03:05,060 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-17 12:03:05,163 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-17 12:03:05,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:03:05,228 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 89 treesize of output 91 [2024-11-17 12:03:05,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:03:05,407 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 235 treesize of output 213 [2024-11-17 12:03:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-17 12:03:08,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699015168] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 12:03:08,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 12:03:08,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 34] total 89 [2024-11-17 12:03:08,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024995186] [2024-11-17 12:03:08,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 12:03:08,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2024-11-17 12:03:08,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:03:08,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2024-11-17 12:03:08,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=5474, Unknown=65, NotChecked=1630, Total=7832 [2024-11-17 12:03:08,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:03:08,707 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:03:08,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 62.056179775280896) internal successors, (5523), 89 states have internal predecessors, (5523), 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-17 12:03:08,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:03:08,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:03:08,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:03:08,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:03:08,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-17 12:03:08,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:03:08,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-17 12:03:08,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-11-17 12:03:08,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:03:43,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 12:03:51,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 12:03:52,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 12:03:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:03:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:03:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:03:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:03:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 12:03:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:03:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-17 12:03:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-17 12:03:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-17 12:03:53,133 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-17 12:03:53,315 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,SelfDestructingSolverStorable16 [2024-11-17 12:03:53,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:03:53,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:03:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash -435169736, now seen corresponding path program 1 times [2024-11-17 12:03:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:03:53,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533620990] [2024-11-17 12:03:53,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:03:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:03:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:04:13,445 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-17 12:04:13,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:04:13,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533620990] [2024-11-17 12:04:13,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533620990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 12:04:13,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082644975] [2024-11-17 12:04:13,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:04:13,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 12:04:13,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-17 12:04:13,447 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-17 12:04:13,448 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-17 12:04:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:04:13,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 3812 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-17 12:04:13,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 12:04:18,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 12:04:18,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-17 12:04:18,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-17 12:04:19,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:04:19,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:04:19,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:04:19,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-11-17 12:04:19,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2024-11-17 12:04:19,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-17 12:04:19,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:04:19,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-17 12:04:20,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:04:20,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:04:20,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2024-11-17 12:04:20,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-17 12:04:20,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-17 12:04:20,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:04:20,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-17 12:04:20,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-17 12:04:20,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-17 12:04:21,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-17 12:04:21,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-17 12:04:21,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-17 12:04:21,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:04:21,566 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-17 12:04:21,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 12:04:21,792 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-17 12:04:21,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 12:04:21,877 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_670 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800))) is different from false [2024-11-17 12:04:32,206 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_42| Int) (v_ArrVal_659 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_663 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_659) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (not (= (let ((.cse3 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (let ((.cse5 (+ 3208 |c_~#queue~0.offset|))) (store (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 .cse5 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|))) (store (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)) (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|)) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_42| 1))) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse3)) 800))))) is different from false [2024-11-17 12:04:32,565 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_42| Int) (v_ArrVal_659 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_663 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_659) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (not (= (let ((.cse4 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (let ((.cse6 (+ 3208 |c_~#queue~0.offset|))) (store (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse5 .cse6 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|))) (store (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)) (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|)) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_42| 1))) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse4)) 800)))))) is different from false [2024-11-17 12:04:32,884 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_42| Int) (v_ArrVal_659 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_656 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_656) .cse8 (+ (select .cse7 .cse8) 1)))))) (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_659) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (not (= (let ((.cse2 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (let ((.cse5 (+ 3208 |c_~#queue~0.offset|))) (store (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 .cse5 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|))) (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse3))) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|)) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_42| 1))) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse2)) 800)) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|))))) is different from false [2024-11-17 12:04:32,953 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_654 Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_42| Int) (v_ArrVal_659 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_656 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_654)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_656) .cse8 (+ (select .cse7 .cse8) 1)))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_659) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (not (= 800 (let ((.cse4 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (let ((.cse6 (+ 3208 |c_~#queue~0.offset|))) (store (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse5 .cse6 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|))) (store (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)) (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|)) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_42| 1))) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse4)))))))) is different from false [2024-11-17 12:04:32,983 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_654 Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_42| Int) (v_ArrVal_659 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_656 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (store .cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) v_ArrVal_654))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_656) .cse8 (+ (select .cse7 .cse8) 1)))))) (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_659) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (let ((.cse2 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (let ((.cse5 (+ 3208 |c_~#queue~0.offset|))) (store (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 .cse5 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|))) (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* (select .cse1 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|)) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_42| 1))) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse2)))) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|))))) (< (select .cse9 .cse8) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|)))) is different from false [2024-11-17 12:04:33,036 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_654 Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_42| Int) (v_ArrVal_659 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_670 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_656 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse9 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) v_ArrVal_654))) (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_656) .cse1 (+ 1 (select .cse9 .cse1))))))) (let ((.cse8 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_659) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (not (= (let ((.cse4 (+ 3200 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (let ((.cse7 (+ 3208 |c_~#queue~0.offset|))) (store (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse6 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse6 .cse7 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse5 (+ (select .cse6 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|))) (store (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)) (+ (* (select .cse3 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|)) .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_42| 1))) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse4)) 800)) (< (select .cse8 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|)))))) is different from false [2024-11-17 12:04:37,375 INFO L349 Elim1Store]: treesize reduction 454, result has 37.2 percent of original size [2024-11-17 12:04:37,375 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 1149 treesize of output 666 [2024-11-17 12:04:37,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:04:37,411 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 539 treesize of output 537 [2024-11-17 12:04:37,426 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 95 treesize of output 91 [2024-11-17 12:04:37,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 12:04:37,489 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-17 12:04:37,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:04:37,573 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 119 treesize of output 127 [2024-11-17 12:04:37,739 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-17 12:04:37,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:04:37,809 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 238 treesize of output 258 [2024-11-17 12:04:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-17 12:04:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082644975] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 12:04:40,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 12:04:40,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36, 43] total 111 [2024-11-17 12:04:40,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835367974] [2024-11-17 12:04:40,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 12:04:40,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2024-11-17 12:04:40,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:04:40,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2024-11-17 12:04:40,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1415, Invalid=9219, Unknown=106, NotChecked=1470, Total=12210 [2024-11-17 12:04:40,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:04:40,753 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:04:40,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 50.414414414414416) internal successors, (5596), 111 states have internal predecessors, (5596), 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-17 12:04:40,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:04:40,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:04:40,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:04:40,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:04:40,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-17 12:04:40,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:04:40,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-17 12:04:40,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-11-17 12:04:40,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-17 12:04:40,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:05:31,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 12:05:40,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 12:05:41,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:05:41,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:05:41,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:05:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:05:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 12:05:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:05:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-17 12:05:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-17 12:05:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-17 12:05:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-17 12:05:41,330 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-17 12:05:41,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-17 12:05:41,514 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:05:41,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:05:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1657801765, now seen corresponding path program 1 times [2024-11-17 12:05:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:05:41,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666886662] [2024-11-17 12:05:41,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:05:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:05:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:06:37,768 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-17 12:06:37,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:06:37,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666886662] [2024-11-17 12:06:37,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666886662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 12:06:37,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343869635] [2024-11-17 12:06:37,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:06:37,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 12:06:37,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-17 12:06:37,771 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-17 12:06:37,773 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-17 12:06:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:06:38,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 3815 conjuncts, 153 conjuncts are in the unsatisfiable core [2024-11-17 12:06:38,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 12:06:49,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 12:06:49,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-17 12:06:50,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-17 12:06:51,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:06:51,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:06:51,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:06:51,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-11-17 12:06:51,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2024-11-17 12:06:51,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-17 12:06:52,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:06:52,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-17 12:06:53,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-17 12:06:53,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-11-17 12:06:54,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-17 12:06:54,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:06:54,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2024-11-17 12:06:56,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:06:56,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2024-11-17 12:06:56,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:06:56,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2024-11-17 12:06:58,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:06:58,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2024-11-17 12:06:58,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:06:58,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2024-11-17 12:06:58,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:06:58,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-11-17 12:06:58,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:06:58,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2024-11-17 12:06:59,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:06:59,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2024-11-17 12:06:59,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-17 12:07:00,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:07:00,177 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-17 12:07:00,553 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-17 12:07:00,655 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-17 12:07:00,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 12:07:01,145 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset|)) (.cse1 (= |c_t2Thread1of1ForFork0_dequeue_~x~0#1| 0))) (and (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse0) 0))) .cse1) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse0) 1))) (not .cse1)))) is different from false [2024-11-17 12:08:05,831 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse9 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse7 (+ (* (select .cse6 .cse9) 4) |c_~#queue~0.offset|)) (.cse8 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse8 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse0 (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse1) 0))) (= (let ((.cse2 (select (store .cse4 |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)))) 0))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse12 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse8 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse10 (store (select .cse12 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse1) 1))) (not (= (let ((.cse11 (select (store .cse12 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (select .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)))) 0))))))))) is different from false [2024-11-17 12:08:18,463 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 3200) (+ |c_t2Thread1of1ForFork0_dequeue_#t~mem47#1| 1))))) (let ((.cse7 (select .cse4 |c_~#queue~0.base|)) (.cse10 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse8 (+ (* (select .cse7 .cse10) 4) |c_~#queue~0.offset|)) (.cse9 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse2 (store .cse4 |c_~#queue~0.base| (store (store (store .cse7 .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse3 (store (select .cse2 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_813))) (or (= (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0) (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse5) 0))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse13 (store .cse4 |c_~#queue~0.base| (store (store (store .cse7 .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse11 (store (select .cse13 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse11) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse5) 1))) (not (= (let ((.cse12 (select (store .cse13 |c_~#stored_elements~0.base| .cse11) |c_~#queue~0.base|))) (select .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse1) 4)))) 0)))))))))) is different from false [2024-11-17 12:08:20,555 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (let ((.cse14 (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|)) (.cse15 (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 3200))) (store .cse14 .cse15 (+ (select .cse14 .cse15) 1)))))) (let ((.cse7 (select .cse0 |c_~#queue~0.base|)) (.cse10 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse6 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse8 (+ (* (select .cse7 .cse10) 4) |c_~#queue~0.offset|)) (.cse9 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse5 (store .cse0 |c_~#queue~0.base| (store (store (store .cse7 .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse1 (store (select .cse5 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse2) 0))) (= (let ((.cse3 (select (store .cse5 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse12 (store .cse0 |c_~#queue~0.base| (store (store (store .cse7 .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse13 (store (select .cse12 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_813))) (or (not (= (let ((.cse11 (select (store .cse12 |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base|))) (select .cse11 (+ (* (select .cse11 .cse4) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse2) 1))))))))))) is different from false [2024-11-17 12:08:39,403 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base|)) (.cse12 (+ |c_t2Thread1of1ForFork0_dequeue_#in~q#1.offset| 3200))) (let ((.cse5 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 3204)) (.cse11 (+ 3208 |c_t2Thread1of1ForFork0_dequeue_#in~q#1.offset|)) (.cse13 (+ (select .cse10 .cse12) 1))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_807 Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base| (store (store .cse10 .cse11 v_ArrVal_807) .cse12 .cse13)))) (let ((.cse2 (store .cse4 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse8 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse3 (store (select .cse2 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_813))) (or (= (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))))) 0) (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse5) 0)))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_807 Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse14 (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base| (store (store .cse10 .cse11 v_ArrVal_807) .cse12 .cse13)))) (let ((.cse17 (store .cse14 |c_~#queue~0.base| (store (store (let ((.cse18 (select .cse14 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse8 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse15 (store (select .cse17 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse14 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse5) 1))) (not (= (let ((.cse16 (select (store .cse17 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse1))))) 0)))))))))) is different from false [2024-11-17 12:09:40,684 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse22 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (let ((.cse2 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse7 (+ |c_~#stored_elements~0.offset| 8 .cse22)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse11 (+ |c_~#stored_elements~0.offset| 4 .cse22)) (.cse13 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse14 .cse15)))) (let ((.cse6 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse5 (store (store (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse10 (+ v_subst_6 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse1 (store (select (store .cse6 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse2) 0))) (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_5 Int) (v_subst_4 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse14 .cse15)))) (let ((.cse20 (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse19 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse4 (+ (select .cse21 .cse4) 1)) (+ (* (select .cse21 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse10 (+ v_subst_5 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse17 (store (select (store .cse20 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse16 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse2) 1))) (not (= (let ((.cse18 (select (store (store .cse16 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse4) 4)))) 0))))))))))) is different from false [2024-11-17 12:09:43,326 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse22 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (let ((.cse2 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse7 (+ |c_~#stored_elements~0.offset| 8 .cse22)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse11 (+ |c_~#stored_elements~0.offset| 4 .cse22)) (.cse13 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_subst_8 Int) (v_subst_5 Int) (v_subst_4 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse14 .cse15)))) (let ((.cse6 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse5 (store (store (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) v_subst_8)) .cse10 (+ v_subst_5 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse1 (store (select (store .cse6 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_815) |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 (+ (* 4 (select .cse3 .cse4)) |c_~#queue~0.offset|))) 0)))))))) (forall ((v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse14 .cse15)))) (let ((.cse20 (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse19 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse4 (+ (select .cse21 .cse4) 1)) (+ |c_~#queue~0.offset| (* (select .cse21 .cse9) 4)) v_subst_7)) .cse10 (+ v_subst_6 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse17 (store (select (store .cse20 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse16 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse2) 0))) (= (let ((.cse18 (select (store (store .cse16 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse18 (+ (* (select .cse18 .cse4) 4) |c_~#queue~0.offset|))) 0)))))))))) is different from false [2024-11-17 12:12:57,363 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_~#stored_elements~0.offset| 8)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_799 (Array Int Int)) (v_subst_8 Int) (v_subst_5 Int) (v_subst_4 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse11 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse8) 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse12 .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse8 (+ (select .cse12 .cse8) 1))))) (let ((.cse5 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (store (store .cse7 .cse3 (+ (select .cse7 .cse3) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_5 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse6 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse1) 1))) (not (= (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|))) 0))))))))) (forall ((v_ArrVal_799 (Array Int Int)) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse20 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse19 (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse8) 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse21 .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse8 (+ (select .cse21 .cse8) 1))))) (let ((.cse17 (store (select (store .cse20 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse15 (store (store (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (store (store .cse18 .cse3 (+ (select .cse18 .cse3) 1)) (+ (* (select .cse18 .cse8) 4) |c_~#queue~0.offset|) v_subst_7)) .cse10 (+ v_subst_6 1)) .cse8 (+ v_subst_3 1)))) (let ((.cse16 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) .cse6 v_ArrVal_813))) (or (= (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse14 (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse1) 0)))))))))))) is different from false [2024-11-17 12:12:58,971 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (and (forall ((v_ArrVal_799 (Array Int Int)) (v_subst_8 Int) (v_subst_5 Int) (v_subst_4 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse12 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse10 (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse13 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse13 .cse9) 1))))) (let ((.cse6 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse8 (select (store (store .cse0 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_8)) .cse11 (+ v_subst_5 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse2) 1))) (not (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0))))))))) (forall ((v_ArrVal_799 (Array Int Int)) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse21 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse20 (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse22 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse22 .cse9) 1))))) (let ((.cse18 (store (select (store .cse21 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse16 (store (store (let ((.cse19 (select (store (store .cse0 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse4 (+ (select .cse19 .cse4) 1)) (+ (* (select .cse19 .cse9) 4) |c_~#queue~0.offset|) v_subst_7)) .cse11 (+ v_subst_6 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse17 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_813))) (or (= (let ((.cse15 (select (store (store .cse0 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse4) 4) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse2) 0)))))))))))) is different from false [2024-11-17 12:12:59,146 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_799 (Array Int Int)) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse12 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse10 (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse13 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse13 .cse9) 1))))) (let ((.cse6 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse8 (select (store (store .cse0 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_7)) .cse11 (+ v_subst_6 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse2) 0))) (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0)))))))) (forall ((v_ArrVal_799 (Array Int Int)) (v_subst_8 Int) (v_subst_5 Int) (v_subst_4 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse21 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse20 (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse22 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse22 .cse9) 1))))) (let ((.cse18 (store (select (store .cse21 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse16 (store (store (let ((.cse19 (select (store (store .cse0 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse4 (+ (select .cse19 .cse4) 1)) (+ (* (select .cse19 .cse9) 4) |c_~#queue~0.offset|) v_subst_8)) .cse11 (+ v_subst_5 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse17 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_813))) (or (not (= (let ((.cse15 (select (store (store .cse0 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse4) 4)))) 0)) (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse2) 1)))))))))))) is different from false [2024-11-17 12:12:59,338 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse24 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse25 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse24 .cse25 (+ (select .cse24 .cse25) 1)))))) (and (forall ((v_ArrVal_799 (Array Int Int)) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse12 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse10 (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse13 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse13 .cse9) 1))))) (let ((.cse6 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse8 (select (store (store .cse0 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ (* 4 (select .cse8 .cse9)) |c_~#queue~0.offset|) v_subst_7)) .cse11 (+ v_subst_6 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse2) 0))) (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0)))))))) (forall ((v_ArrVal_799 (Array Int Int)) (v_subst_8 Int) (v_subst_5 Int) (v_subst_4 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse21 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse20 (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse22 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse22 .cse9) 1))))) (let ((.cse18 (store (select (store .cse21 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse16 (store (store (let ((.cse19 (select (store (store .cse0 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse4 (+ (select .cse19 .cse4) 1)) (+ (* 4 (select .cse19 .cse9)) |c_~#queue~0.offset|) v_subst_8)) .cse11 (+ v_subst_5 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse17 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_813))) (or (not (= (let ((.cse15 (select (store (store .cse0 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse15 (+ (* 4 (select .cse15 .cse4)) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse2) 1)))))))))))) is different from false [2024-11-17 12:13:00,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse17 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse16 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse18 (+ (select .cse15 .cse17) 1))) (and (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_796 Int) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_796) .cse17 .cse18)))) (let ((.cse12 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse10 (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse13 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse13 .cse9) 1))))) (let ((.cse6 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_7)) .cse11 (+ v_subst_6 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_813))) (or (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0) (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse5) 0))))))))))) (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_796 Int) (v_subst_8 Int) (v_subst_5 Int) (v_subst_4 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_796) .cse17 .cse18)))) (let ((.cse26 (store .cse19 |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse25 (let ((.cse27 (let ((.cse28 (select .cse26 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse27 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse27 .cse9) 1))))) (let ((.cse23 (store (select (store .cse26 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse22 (store (store (let ((.cse24 (select (store (store .cse19 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (store (store .cse24 .cse1 (+ (select .cse24 .cse1) 1)) (+ (* (select .cse24 .cse9) 4) |c_~#queue~0.offset|) v_subst_8)) .cse11 (+ v_subst_5 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse20 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse5) 1))) (not (= (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-17 12:13:01,572 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse16 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse17 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse19 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_796 Int) (v_ArrVal_793 Int) (v_subst_8 Int) (v_subst_5 Int) (v_subst_4 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse15 (store .cse18 .cse19 v_ArrVal_793))) (store (store .cse15 .cse16 v_ArrVal_796) .cse17 (+ (select .cse15 .cse17) 1)))))) (let ((.cse12 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse10 (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse13 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse13 .cse9) 1))))) (let ((.cse6 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_8)) .cse11 (+ v_subst_5 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_813))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse5) 1))))))))))) (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_796 Int) (v_ArrVal_793 Int) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse30 (store .cse18 .cse19 v_ArrVal_793))) (store (store .cse30 .cse16 v_ArrVal_796) .cse17 (+ (select .cse30 .cse17) 1)))))) (let ((.cse27 (store .cse20 |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse28 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse28 .cse9) 1))))) (let ((.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse23 (store (store (let ((.cse25 (select (store (store .cse20 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (store (store .cse25 .cse1 (+ (select .cse25 .cse1) 1)) (+ (* (select .cse25 .cse9) 4) |c_~#queue~0.offset|) v_subst_7)) .cse11 (+ v_subst_6 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse21 (store (select (store (store .cse20 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse22 (select (store (store .cse20 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse22 (+ (* 4 (select .cse22 .cse1)) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-11-17 12:13:01,993 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse18 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse19 .cse18)) (.cse8 (+ |c_~#stored_elements~0.offset| 8)) (.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 3208 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 3204)) (.cse17 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_796 Int) (v_ArrVal_793 Int) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse16 (store .cse19 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_793))) (store (store .cse16 .cse17 v_ArrVal_796) .cse18 (+ (select .cse16 .cse18) 1)))))) (let ((.cse13 (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse11 (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse14 .cse12 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ (select .cse14 .cse10) 1))))) (let ((.cse7 (store (select (store .cse13 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse9 (select (store (store .cse1 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse9 .cse5 (+ (select .cse9 .cse5) 1)) (+ (* (select .cse9 .cse10) 4) |c_~#queue~0.offset|) v_subst_7)) .cse12 (+ v_subst_6 1)) .cse10 (+ v_subst_3 1)))) (let ((.cse2 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_815) |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 (+ (* 4 (select .cse4 .cse5)) |c_~#queue~0.offset|))) 0))))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_796 Int) (v_ArrVal_793 Int) (v_subst_8 Int) (v_subst_5 Int) (v_subst_4 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse30 (store .cse19 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_793))) (store (store .cse30 .cse17 v_ArrVal_796) .cse18 (+ (select .cse30 .cse18) 1)))))) (let ((.cse27 (store .cse21 |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse28 .cse12 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ (select .cse28 .cse10) 1))))) (let ((.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse22 (store (store (let ((.cse25 (select (store (store .cse21 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (store (store .cse25 .cse5 (+ (select .cse25 .cse5) 1)) (+ (* (select .cse25 .cse10) 4) |c_~#queue~0.offset|) v_subst_8)) .cse12 (+ v_subst_5 1)) .cse10 (+ v_subst_4 1)))) (let ((.cse23 (store (select (store (store .cse21 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_813))) (or (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 .cse5) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse3) 1)))))))))))))))) is different from false [2024-11-17 12:13:03,036 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse18 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse8 (+ |c_~#stored_elements~0.offset| 8)) (.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 3208 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 3204)) (.cse17 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse0 (select .cse19 .cse18))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_796 Int) (v_ArrVal_793 Int) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse16 (store .cse19 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4)) v_ArrVal_793))) (store (store .cse16 .cse17 v_ArrVal_796) .cse18 (+ (select .cse16 .cse18) 1)))))) (let ((.cse13 (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse11 (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse14 .cse12 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ (select .cse14 .cse10) 1))))) (let ((.cse7 (store (select (store .cse13 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse9 (select (store (store .cse1 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse9 .cse5 (+ (select .cse9 .cse5) 1)) (+ (* (select .cse9 .cse10) 4) |c_~#queue~0.offset|) v_subst_7)) .cse12 (+ v_subst_6 1)) .cse10 (+ v_subst_3 1)))) (let ((.cse2 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_815) |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))))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_796 Int) (v_ArrVal_793 Int) (v_subst_8 Int) (v_subst_5 Int) (v_subst_4 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse30 (store .cse19 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4)) v_ArrVal_793))) (store (store .cse30 .cse17 v_ArrVal_796) .cse18 (+ (select .cse30 .cse18) 1)))))) (let ((.cse27 (store .cse21 |c_~#stored_elements~0.base| v_ArrVal_799))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse28 .cse12 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ (select .cse28 .cse10) 1))))) (let ((.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse22 (store (store (let ((.cse25 (select (store (store .cse21 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (store (store .cse25 .cse5 (+ (select .cse25 .cse5) 1)) (+ (* (select .cse25 .cse10) 4) |c_~#queue~0.offset|) v_subst_8)) .cse12 (+ v_subst_5 1)) .cse10 (+ v_subst_4 1)))) (let ((.cse23 (store (select (store (store .cse21 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_813))) (or (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 .cse5) 4)))) 0)) (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse3) 1))))))))))) (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|)))))) is different from false [2024-11-17 12:13:04,378 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 8)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse15 (select .cse14 .cse8))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_796 Int) (v_ArrVal_793 Int) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse9 (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (store .cse14 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_793))) (store (store .cse13 .cse10 v_ArrVal_796) .cse8 (+ (select .cse13 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_799) |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse8)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse11 .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse8 (+ (select .cse11 .cse8) 1))))) (let ((.cse5 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_799) |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (store (store .cse7 .cse3 (+ (select .cse7 .cse3) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_7)) .cse10 (+ v_subst_6 1)) .cse8 (+ v_subst_3 1)))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse6 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse1) 0))) (= (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) 0))))))) (< .cse15 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_796 Int) (v_ArrVal_793 Int) (v_subst_8 Int) (v_subst_5 Int) (v_subst_4 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse21 (let ((.cse22 (let ((.cse23 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse24 (store .cse14 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_793))) (store (store .cse24 .cse10 v_ArrVal_796) .cse8 (+ (select .cse24 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_799) |c_~#queue~0.base|))) (store .cse23 (+ (* 4 (select .cse23 .cse8)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse22 .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse8 (+ (select .cse22 .cse8) 1))))) (let ((.cse19 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_799) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse3 (+ (select .cse20 .cse3) 1)) (+ (* (select .cse20 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_5 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse16 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) .cse6 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse1) 1))) (not (= (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse17 (+ (* 4 (select .cse17 .cse3)) |c_~#queue~0.offset|))) 0)))))))) (< .cse15 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|)))))) is different from false [2024-11-17 12:13:11,431 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (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 ((.cse16 (select .cse1 |c_~#queue~0.base|)) (.cse10 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse16 .cse10)) (.cse8 (+ |c_~#stored_elements~0.offset| 8)) (.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_796 Int) (v_ArrVal_793 Int) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse11 (let ((.cse13 (let ((.cse14 (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse15 (store .cse16 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_793))) (store (store .cse15 .cse12 v_ArrVal_796) .cse10 (+ (select .cse15 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_799) |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse10)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse13 .cse12 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ (select .cse13 .cse10) 1))))) (let ((.cse7 (store (select (store (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_799) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse9 (select (store (store .cse1 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse9 .cse5 (+ (select .cse9 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse9 .cse10) 4)) v_subst_7)) .cse12 (+ v_subst_6 1)) .cse10 (+ v_subst_3 1)))) (let ((.cse2 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_815) |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 (+ (* 4 (select .cse4 .cse5)) |c_~#queue~0.offset|))) 0))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_796 Int) (v_ArrVal_793 Int) (v_subst_8 Int) (v_subst_5 Int) (v_subst_4 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse22 (let ((.cse23 (let ((.cse24 (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse25 (store .cse16 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_793))) (store (store .cse25 .cse12 v_ArrVal_796) .cse10 (+ (select .cse25 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_799) |c_~#queue~0.base|))) (store .cse24 (+ (* 4 (select .cse24 .cse10)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse23 .cse12 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ (select .cse23 .cse10) 1))))) (let ((.cse20 (store (select (store (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_799) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse19 (store (store (let ((.cse21 (select (store (store .cse1 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (store (store .cse21 .cse5 (+ (select .cse21 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse21 .cse10) 4)) v_subst_8)) .cse12 (+ v_subst_5 1)) .cse10 (+ v_subst_4 1)))) (let ((.cse17 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= 1 (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse3)))) (not (= (let ((.cse18 (select (store (store .cse1 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse18 (+ (* (select .cse18 .cse5) 4) |c_~#queue~0.offset|))) 0)))))))))))))) is different from false [2024-11-17 12:13:11,920 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (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 ((.cse16 (select .cse1 |c_~#queue~0.base|)) (.cse10 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (+ |c_~#stored_elements~0.offset| 8)) (.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse16 .cse10))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_796 Int) (v_ArrVal_793 Int) (v_subst_8 Int) (v_subst_5 Int) (v_subst_4 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse11 (let ((.cse13 (let ((.cse14 (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse15 (store .cse16 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_793))) (store (store .cse15 .cse12 v_ArrVal_796) .cse10 (+ (select .cse15 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_799) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse10) 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse13 .cse12 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ (select .cse13 .cse10) 1))))) (let ((.cse7 (store (select (store (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_799) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse9 (select (store (store .cse1 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse9 .cse5 (+ (select .cse9 .cse5) 1)) (+ (* (select .cse9 .cse10) 4) |c_~#queue~0.offset|) v_subst_8)) .cse12 (+ v_subst_5 1)) .cse10 (+ v_subst_4 1)))) (let ((.cse2 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_813))) (or (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse3) 1))) (not (= (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)))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_796 Int) (v_ArrVal_793 Int) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_813 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse22 (let ((.cse23 (let ((.cse24 (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse25 (store .cse16 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_793))) (store (store .cse25 .cse12 v_ArrVal_796) .cse10 (+ (select .cse25 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_799) |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse10) 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse23 .cse12 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ (select .cse23 .cse10) 1))))) (let ((.cse20 (store (select (store (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_799) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse21 (select (store (store .cse1 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (store (store .cse21 .cse5 (+ (select .cse21 .cse5) 1)) (+ (* (select .cse21 .cse10) 4) |c_~#queue~0.offset|) v_subst_7)) .cse12 (+ v_subst_6 1)) .cse10 (+ v_subst_3 1)))) (let ((.cse19 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_813))) (or (= (let ((.cse17 (select (store (store .cse1 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse5) 4)))) 0) (forall ((v_ArrVal_815 (Array Int Int))) (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_815) |c_~#stored_elements~0.base|) .cse3) 0))))))))) (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|))))))) is different from false [2024-11-17 12:13:15,437 INFO L349 Elim1Store]: treesize reduction 454, result has 37.2 percent of original size [2024-11-17 12:13:15,438 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 16358 treesize of output 3050 [2024-11-17 12:13:15,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:13:15,520 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 4669 treesize of output 4667 [2024-11-17 12:13:16,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:13:16,021 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 230974443 treesize of output 180958194 Received shutdown request... [2024-11-17 12:13:48,589 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-17 12:13:48,592 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-17 12:13:48,592 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-17 12:13:48,597 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-17 12:13:48,623 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-17 12:13:48,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 12:13:48,802 WARN L596 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1890 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-31-5-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-4-4-4-4-3-3-3-3-3-3-3-3-3-3-3-3-4-4-3-3-3-3-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-72-5-3-3-6-4-4-4-6-4-6-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-3-3-3-3-2-2-2-2-2-2-1 context. [2024-11-17 12:13:48,803 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 12:13:48,803 INFO L320 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork0 was TIMEOUT (3/3) [2024-11-17 12:13:48,805 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 12:13:48,805 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 12:13:48,821 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-17 12:13:48,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:13:48 BasicIcfg [2024-11-17 12:13:48,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 12:13:48,822 INFO L158 Benchmark]: Toolchain (without parser) took 807351.36ms. Allocated memory was 83.9MB in the beginning and 1.0GB in the end (delta: 943.7MB). Free memory was 55.0MB in the beginning and 486.4MB in the end (delta: -431.4MB). Peak memory consumption was 826.0MB. Max. memory is 8.0GB. [2024-11-17 12:13:48,822 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-17 12:13:48,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 682.00ms. Allocated memory is still 83.9MB. Free memory was 54.7MB in the beginning and 40.9MB in the end (delta: 13.9MB). Peak memory consumption was 42.6MB. Max. memory is 8.0GB. [2024-11-17 12:13:48,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 137.71ms. Allocated memory is still 83.9MB. Free memory was 40.9MB in the beginning and 25.7MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-11-17 12:13:48,823 INFO L158 Benchmark]: Boogie Preprocessor took 187.91ms. Allocated memory was 83.9MB in the beginning and 104.9MB in the end (delta: 21.0MB). Free memory was 25.7MB in the beginning and 63.8MB in the end (delta: -38.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-17 12:13:48,823 INFO L158 Benchmark]: RCFGBuilder took 2253.13ms. Allocated memory is still 104.9MB. Free memory was 63.8MB in the beginning and 49.6MB in the end (delta: 14.2MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2024-11-17 12:13:48,823 INFO L158 Benchmark]: TraceAbstraction took 804084.28ms. Allocated memory was 104.9MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 48.9MB in the beginning and 486.4MB in the end (delta: -437.5MB). Peak memory consumption was 800.0MB. Max. memory is 8.0GB. [2024-11-17 12:13:48,824 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.21ms. Allocated memory is still 83.9MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 682.00ms. Allocated memory is still 83.9MB. Free memory was 54.7MB in the beginning and 40.9MB in the end (delta: 13.9MB). Peak memory consumption was 42.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 137.71ms. Allocated memory is still 83.9MB. Free memory was 40.9MB in the beginning and 25.7MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 187.91ms. Allocated memory was 83.9MB in the beginning and 104.9MB in the end (delta: 21.0MB). Free memory was 25.7MB in the beginning and 63.8MB in the end (delta: -38.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * RCFGBuilder took 2253.13ms. Allocated memory is still 104.9MB. Free memory was 63.8MB in the beginning and 49.6MB in the end (delta: 14.2MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * TraceAbstraction took 804084.28ms. Allocated memory was 104.9MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 48.9MB in the beginning and 486.4MB in the end (delta: -437.5MB). Peak memory consumption was 800.0MB. 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: 14649, independent: 14467, independent conditional: 1873, independent unconditional: 12594, dependent: 182, dependent conditional: 151, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14503, independent: 14467, independent conditional: 1873, 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: 14503, independent: 14467, independent conditional: 1873, 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: 14521, independent: 14467, independent conditional: 1873, 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: 14521, independent: 14467, independent conditional: 0, independent unconditional: 14467, 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: 14521, independent: 14467, independent conditional: 0, independent unconditional: 14467, 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: 324, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 259, dependent conditional: 16, dependent unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 14521, independent: 2739, independent conditional: 0, independent unconditional: 2739, 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: 1891, Maximal queried relation: 4, Independence queries for same thread: 146, Persistent sets #1 benchmarks: Persistent set computation time: 0.5s, Number of persistent set computation: 2242, Number of trivial persistent sets: 1987, 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: 14649, independent: 14467, independent conditional: 1873, independent unconditional: 12594, dependent: 182, dependent conditional: 151, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14503, independent: 14467, independent conditional: 1873, 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: 14503, independent: 14467, independent conditional: 1873, 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: 14521, independent: 14467, independent conditional: 1873, 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: 14521, independent: 14467, independent conditional: 0, independent unconditional: 14467, 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: 14521, independent: 14467, independent conditional: 0, independent unconditional: 14467, 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: 324, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 259, dependent conditional: 16, dependent unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 14521, independent: 2739, independent conditional: 0, independent unconditional: 2739, 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: 1891, Maximal queried relation: 4, Independence queries for same thread: 146 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6585, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 30, dependent conditional: 15, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 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: 2078, Number of trivial persistent sets: 2072, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6198, independent: 6183, independent conditional: 0, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6585, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 30, dependent conditional: 15, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 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: 17803, independent: 17140, independent conditional: 4955, independent unconditional: 12185, dependent: 663, dependent conditional: 619, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17184, independent: 17140, independent conditional: 4955, 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: 17184, independent: 17140, independent conditional: 4955, 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: 17184, independent: 17140, independent conditional: 4955, 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: 17184, independent: 17140, independent conditional: 0, independent unconditional: 17140, 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: 17184, independent: 17140, independent conditional: 0, independent unconditional: 17140, 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: 131, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 17184, independent: 14697, independent conditional: 0, independent unconditional: 14697, 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: 4955, Maximal queried relation: 0, Independence queries for same thread: 619, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 2045, Number of trivial persistent sets: 1965, 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: 17803, independent: 17140, independent conditional: 4955, independent unconditional: 12185, dependent: 663, dependent conditional: 619, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17184, independent: 17140, independent conditional: 4955, 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: 17184, independent: 17140, independent conditional: 4955, 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: 17184, independent: 17140, independent conditional: 4955, 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: 17184, independent: 17140, independent conditional: 0, independent unconditional: 17140, 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: 17184, independent: 17140, independent conditional: 0, independent unconditional: 17140, 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: 131, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 17184, independent: 14697, independent conditional: 0, independent unconditional: 14697, 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: 4955, Maximal queried relation: 0, Independence queries for same thread: 619 - 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 1890 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-31-5-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-4-4-4-4-3-3-3-3-3-3-3-3-3-3-3-3-4-4-3-3-3-3-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-72-5-3-3-6-4-4-4-6-4-6-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-4-3-3-3-3-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 2025 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 44.4s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 16.8s, 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.9s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 12032 NumberOfCodeBlocks, 12032 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 12025 ConstructedInterpolants, 0 QuantifiedInterpolants, 23453 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: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 2025 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 1655 NumberOfCodeBlocks, 1655 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 1654 ConstructedInterpolants, 0 QuantifiedInterpolants, 1654 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: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 2025 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 758.7s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 142.9s, 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: 239, 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, 125.2s InterpolantComputationTime, 21771 NumberOfCodeBlocks, 21771 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 25527 ConstructedInterpolants, 408 QuantifiedInterpolants, 197590 SizeOfPredicates, 99 NumberOfNonLiveVariables, 7619 ConjunctsInSsa, 216 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 147/408 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown