/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --traceabstraction.refinement.strategy.for.commutativity.condition.synthesis BADGER -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-158c277 [2024-11-14 14:56:35,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 14:56:35,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-14 14:56:35,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 14:56:35,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 14:56:35,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 14:56:35,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 14:56:35,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 14:56:35,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 14:56:35,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 14:56:35,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 14:56:35,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 14:56:35,573 INFO L153 SettingsManager]: * Use SBE=true [2024-11-14 14:56:35,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 14:56:35,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 14:56:35,574 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 14:56:35,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 14:56:35,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 14:56:35,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 14:56:35,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 14:56:35,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 14:56:35,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 14:56:35,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 14:56:35,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 14:56:35,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 14:56:35,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 14:56:35,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 14:56:35,575 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-14 14:56:35,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 14:56:35,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 14:56:35,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 14:56:35,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 14:56:35,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 14:56:35,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-14 14:56:35,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 14:56:35,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 14:56:35,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-14 14:56:35,576 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-14 14:56:35,576 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-14 14:56:35,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Refinement strategy for commutativity condition synthesis -> BADGER [2024-11-14 14:56:35,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 14:56:35,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 14:56:35,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 14:56:35,877 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 14:56:35,877 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 14:56:35,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2024-11-14 14:56:37,210 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 14:56:37,469 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 14:56:37,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_ok.i [2024-11-14 14:56:37,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/c0a50fa60/81c53f2d81f74d978b6c972f2e3cff43/FLAGb6228ab47 [2024-11-14 14:56:37,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/c0a50fa60/81c53f2d81f74d978b6c972f2e3cff43 [2024-11-14 14:56:37,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 14:56:37,504 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-14 14:56:37,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 14:56:37,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 14:56:37,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 14:56:37,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:56:37" (1/1) ... [2024-11-14 14:56:37,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a4b740e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:56:37, skipping insertion in model container [2024-11-14 14:56:37,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:56:37" (1/1) ... [2024-11-14 14:56:37,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 14:56:37,888 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_ok.i[43266,43279] [2024-11-14 14:56:37,895 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_ok.i[43543,43556] [2024-11-14 14:56:37,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 14:56:37,921 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 14:56:37,968 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_ok.i[43266,43279] [2024-11-14 14:56:37,970 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_ok.i[43543,43556] [2024-11-14 14:56:37,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 14:56:38,024 INFO L204 MainTranslator]: Completed translation [2024-11-14 14:56:38,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:56:38 WrapperNode [2024-11-14 14:56:38,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 14:56:38,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 14:56:38,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 14:56:38,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 14:56:38,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:56:38" (1/1) ... [2024-11-14 14:56:38,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:56:38" (1/1) ... [2024-11-14 14:56:38,082 INFO L138 Inliner]: procedures = 277, calls = 95, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 238 [2024-11-14 14:56:38,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 14:56:38,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 14:56:38,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 14:56:38,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 14:56:38,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:56:38" (1/1) ... [2024-11-14 14:56:38,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:56:38" (1/1) ... [2024-11-14 14:56:38,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:56:38" (1/1) ... [2024-11-14 14:56:38,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:56:38" (1/1) ... [2024-11-14 14:56:38,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:56:38" (1/1) ... [2024-11-14 14:56:38,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:56:38" (1/1) ... [2024-11-14 14:56:38,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:56:38" (1/1) ... [2024-11-14 14:56:38,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:56:38" (1/1) ... [2024-11-14 14:56:38,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 14:56:38,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 14:56:38,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 14:56:38,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 14:56:38,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:56:38" (1/1) ... [2024-11-14 14:56:38,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 14:56:38,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 14:56:38,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 14:56:38,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 14:56:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-14 14:56:38,174 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-14 14:56:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-14 14:56:38,174 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-14 14:56:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 14:56:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-14 14:56:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 14:56:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 14:56:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-14 14:56:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 14:56:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 14:56:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 14:56:38,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 14:56:38,176 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 14:56:38,289 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 14:56:38,291 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 14:56:38,701 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 14:56:38,701 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 14:56:38,730 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 14:56:38,730 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 14:56:38,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:56:38 BoogieIcfgContainer [2024-11-14 14:56:38,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 14:56:38,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 14:56:38,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 14:56:38,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 14:56:38,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 02:56:37" (1/3) ... [2024-11-14 14:56:38,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666520c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:56:38, skipping insertion in model container [2024-11-14 14:56:38,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:56:38" (2/3) ... [2024-11-14 14:56:38,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666520c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:56:38, skipping insertion in model container [2024-11-14 14:56:38,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:56:38" (3/3) ... [2024-11-14 14:56:38,743 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2024-11-14 14:56:38,756 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 14:56:38,758 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 252 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2024-11-14 14:56:38,759 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 14:56:38,863 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 14:56:38,909 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 14:56:38,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-14 14:56:38,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 14:56:38,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-14 14:56:38,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-14 14:56:38,997 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 14:56:39,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-14 14:56:39,018 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;@5114b030, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 14:56:39,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-14 14:56:39,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 14:56:39,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 14:56:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1238973868, now seen corresponding path program 1 times [2024-11-14 14:56:39,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 14:56:39,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012366687] [2024-11-14 14:56:39,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:56:39,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 14:56:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:56:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:39,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 14:56:39,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012366687] [2024-11-14 14:56:39,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012366687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 14:56:39,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 14:56:39,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 14:56:39,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837106790] [2024-11-14 14:56:39,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 14:56:39,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 14:56:39,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 14:56:39,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 14:56:39,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 14:56:39,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:39,383 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 14:56:39,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 14:56:39,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:39,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-14 14:56:39,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-14 14:56:39,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-14 14:56:39,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 14:56:39,648 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 14:56:39,649 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (1/2) [2024-11-14 14:56:39,658 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 14:56:39,659 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 14:56:39,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2024-11-14 14:56:39,660 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;@5114b030, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 14:56:39,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 14:56:40,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 14:56:40,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 14:56:40,156 INFO L85 PathProgramCache]: Analyzing trace with hash 132423784, now seen corresponding path program 1 times [2024-11-14 14:56:40,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 14:56:40,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87735454] [2024-11-14 14:56:40,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:56:40,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 14:56:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:56:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:40,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 14:56:40,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87735454] [2024-11-14 14:56:40,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87735454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 14:56:40,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 14:56:40,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 14:56:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85071914] [2024-11-14 14:56:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 14:56:40,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 14:56:40,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 14:56:40,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 14:56:40,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 14:56:40,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:40,337 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 14:56:40,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 14:56:40,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:40,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:40,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 14:56:40,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 14:56:40,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 14:56:40,377 INFO L85 PathProgramCache]: Analyzing trace with hash -709167766, now seen corresponding path program 1 times [2024-11-14 14:56:40,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 14:56:40,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795346988] [2024-11-14 14:56:40,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:56:40,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 14:56:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:56:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:40,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 14:56:40,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795346988] [2024-11-14 14:56:40,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795346988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 14:56:40,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 14:56:40,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 14:56:40,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149614041] [2024-11-14 14:56:40,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 14:56:40,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 14:56:40,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 14:56:40,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 14:56:40,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 14:56:40,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:40,822 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 14:56:40,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 14:56:40,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:40,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:40,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:40,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:40,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 14:56:40,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 14:56:40,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 14:56:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1614928907, now seen corresponding path program 1 times [2024-11-14 14:56:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 14:56:40,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237028349] [2024-11-14 14:56:40,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:56:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 14:56:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:56:41,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:41,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 14:56:41,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237028349] [2024-11-14 14:56:41,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237028349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 14:56:41,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 14:56:41,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 14:56:41,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813562876] [2024-11-14 14:56:41,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 14:56:41,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 14:56:41,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 14:56:41,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 14:56:41,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 14:56:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:41,109 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 14:56:41,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 14:56:41,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:41,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:41,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:41,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:41,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:41,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:41,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 14:56:41,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 14:56:41,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 14:56:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash 791697283, now seen corresponding path program 1 times [2024-11-14 14:56:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 14:56:41,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006148394] [2024-11-14 14:56:41,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:56:41,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 14:56:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:56:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:41,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 14:56:41,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006148394] [2024-11-14 14:56:41,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006148394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 14:56:41,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958990869] [2024-11-14 14:56:41,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:56:41,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:56:41,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 14:56:41,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 14:56:41,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 14:56:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:56:41,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 14:56:41,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 14:56:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:41,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 14:56:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:41,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958990869] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 14:56:41,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 14:56:41,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-14 14:56:41,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911426835] [2024-11-14 14:56:41,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 14:56:41,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 14:56:41,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 14:56:41,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 14:56:41,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-14 14:56:41,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:41,883 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 14:56:41,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.7) internal successors, (297), 10 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 14:56:41,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:41,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:41,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:41,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:56:42,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 14:56:42,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:56:42,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 14:56:42,263 WARN L203 CommutativityChecker]: Unsatisfiable commutativity condition generated: 2561#(not (exists ((|v_t2Thread1of1ForFork1_#t~ret54#1_Out_2| Int) (|v_#pthreadsMutex_Out_2| (Array Int (Array Int Int))) (|v_t1Thread1of1ForFork0_#t~ret53#1_Out_2| Int)) (and (= (store |#pthreadsMutex| |~#m~0.base| (store (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset| 1)) |v_#pthreadsMutex_Out_2|) (= |v_t2Thread1of1ForFork1_#t~ret54#1_Out_2| 0) (not (and (= (store |#pthreadsMutex| |~#m~0.base| (store (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset| 0)) |v_#pthreadsMutex_Out_2|) (= |v_t2Thread1of1ForFork1_#t~ret54#1_Out_2| 0) (= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 0) (= |v_t1Thread1of1ForFork0_#t~ret53#1_Out_2| 0))) (= |v_t1Thread1of1ForFork0_#t~ret53#1_Out_2| 0)))) [2024-11-14 14:56:42,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 14:56:42,264 INFO L85 PathProgramCache]: Analyzing trace with hash 971615859, now seen corresponding path program 2 times [2024-11-14 14:56:42,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 14:56:42,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648605640] [2024-11-14 14:56:42,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:56:42,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 14:56:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:56:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:42,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 14:56:42,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648605640] [2024-11-14 14:56:42,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648605640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 14:56:42,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777237663] [2024-11-14 14:56:42,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 14:56:42,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:56:42,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 14:56:42,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 14:56:42,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 14:56:42,971 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-14 14:56:42,971 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 14:56:42,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 14:56:42,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 14:56:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-14 14:56:43,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 14:56:43,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777237663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 14:56:43,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 14:56:43,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-11-14 14:56:43,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244396002] [2024-11-14 14:56:43,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 14:56:43,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 14:56:43,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 14:56:43,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 14:56:43,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-14 14:56:43,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:43,034 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 14:56:43,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 14:56:43,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:43,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:43,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:43,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:56:43,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:56:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 14:56:43,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 14:56:43,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:56:43,293 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 14:56:43,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 14:56:43,294 INFO L85 PathProgramCache]: Analyzing trace with hash -416105675, now seen corresponding path program 1 times [2024-11-14 14:56:43,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 14:56:43,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532187588] [2024-11-14 14:56:43,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:56:43,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 14:56:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:56:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:43,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 14:56:43,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532187588] [2024-11-14 14:56:43,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532187588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 14:56:43,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411948327] [2024-11-14 14:56:43,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:56:43,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:56:43,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 14:56:43,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 14:56:43,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 14:56:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:56:43,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 14:56:43,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 14:56:44,169 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:44,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 14:56:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:44,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411948327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 14:56:44,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 14:56:44,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-14 14:56:44,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679992328] [2024-11-14 14:56:44,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 14:56:44,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 14:56:44,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 14:56:44,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 14:56:44,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-14 14:56:44,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:44,412 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 14:56:44,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 23.5) internal successors, (423), 18 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 14:56:44,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:44,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:44,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:44,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:56:44,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 14:56:44,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:56:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 14:56:44,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 14:56:44,691 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-14 14:56:44,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:56:44,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 14:56:44,891 WARN L203 CommutativityChecker]: Unsatisfiable commutativity condition generated: 5132#(not (exists ((|v_t2Thread1of1ForFork1_#t~ret54#1_Out_4| Int) (|v_#pthreadsMutex_Out_4| (Array Int (Array Int Int))) (|v_t1Thread1of1ForFork0_#t~ret53#1_Out_4| Int)) (and (= |v_t1Thread1of1ForFork0_#t~ret53#1_Out_4| 0) (not (and (= |v_t1Thread1of1ForFork0_#t~ret53#1_Out_4| 0) (= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 0) (= |v_t2Thread1of1ForFork1_#t~ret54#1_Out_4| 0) (= (store |#pthreadsMutex| |~#m~0.base| (store (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset| 0)) |v_#pthreadsMutex_Out_4|))) (= |v_t2Thread1of1ForFork1_#t~ret54#1_Out_4| 0) (= (store |#pthreadsMutex| |~#m~0.base| (store (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset| 1)) |v_#pthreadsMutex_Out_4|)))) [2024-11-14 14:56:44,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 14:56:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1626808043, now seen corresponding path program 2 times [2024-11-14 14:56:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 14:56:44,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479199784] [2024-11-14 14:56:44,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:56:44,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 14:56:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:56:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:45,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 14:56:45,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479199784] [2024-11-14 14:56:45,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479199784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 14:56:45,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599189186] [2024-11-14 14:56:45,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 14:56:45,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:56:45,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 14:56:45,771 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 14:56:45,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 14:56:46,205 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 14:56:46,205 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 14:56:46,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 14:56:46,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 14:56:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:46,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 14:56:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:47,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599189186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 14:56:47,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 14:56:47,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-11-14 14:56:47,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129828113] [2024-11-14 14:56:47,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 14:56:47,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 14:56:47,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 14:56:47,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 14:56:47,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-14 14:56:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:47,096 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 14:56:47,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 19.970588235294116) internal successors, (679), 34 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 14:56:47,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:47,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:47,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:47,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:56:47,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 14:56:47,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 14:56:47,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:56:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 14:56:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 14:56:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 14:56:47,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 14:56:48,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:56:48,057 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 14:56:48,078 WARN L203 CommutativityChecker]: Unsatisfiable commutativity condition generated: 7690#(not (exists ((|v_t2Thread1of1ForFork1_#t~ret54#1_Out_6| Int) (|v_#pthreadsMutex_Out_6| (Array Int (Array Int Int))) (|v_t1Thread1of1ForFork0_#t~ret53#1_Out_6| Int)) (and (= |v_t1Thread1of1ForFork0_#t~ret53#1_Out_6| 0) (not (and (= |v_t1Thread1of1ForFork0_#t~ret53#1_Out_6| 0) (= |v_t2Thread1of1ForFork1_#t~ret54#1_Out_6| 0) (= (store |#pthreadsMutex| |~#m~0.base| (store (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset| 0)) |v_#pthreadsMutex_Out_6|) (= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 0))) (= (store |#pthreadsMutex| |~#m~0.base| (store (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset| 1)) |v_#pthreadsMutex_Out_6|) (= |v_t2Thread1of1ForFork1_#t~ret54#1_Out_6| 0)))) [2024-11-14 14:56:48,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 14:56:48,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1845177557, now seen corresponding path program 3 times [2024-11-14 14:56:48,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 14:56:48,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987972707] [2024-11-14 14:56:48,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:56:48,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 14:56:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:56:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 0 proven. 3375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:56:50,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 14:56:50,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987972707] [2024-11-14 14:56:50,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987972707] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 14:56:50,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656497660] [2024-11-14 14:56:50,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 14:56:50,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:56:50,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 14:56:50,366 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 14:56:50,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 14:56:51,002 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 14:56:51,002 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 14:56:51,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-14 14:56:51,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 14:56:53,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 14:56:53,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:56:53,233 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-14 14:56:53,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:56:53,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 14:56:53,474 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-14 14:56:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 482 proven. 319 refuted. 0 times theorem prover too weak. 2574 trivial. 0 not checked. [2024-11-14 14:56:53,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 14:56:54,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 14:56:54,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2024-11-14 14:56:54,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 14:56:54,124 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 78 treesize of output 80 [2024-11-14 14:56:54,136 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 61 treesize of output 53 [2024-11-14 14:56:54,159 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 8 treesize of output 4 [2024-11-14 14:56:54,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 14:56:54,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2024-11-14 14:56:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 482 proven. 319 refuted. 0 times theorem prover too weak. 2574 trivial. 0 not checked. [2024-11-14 14:56:54,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656497660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 14:56:54,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 14:56:54,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 14, 13] total 56 [2024-11-14 14:56:54,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208781822] [2024-11-14 14:56:54,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 14:56:54,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-14 14:56:54,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 14:56:54,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-14 14:56:54,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=2692, Unknown=5, NotChecked=0, Total=3080 [2024-11-14 14:56:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:54,935 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 14:56:54,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 18.428571428571427) internal successors, (1032), 56 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 14:56:54,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:56:54,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:54,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:56:54,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:56:54,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 14:56:54,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 14:56:54,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-14 14:56:54,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:57:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:57:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:57:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:57:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:57:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 14:57:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 14:57:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 14:57:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-11-14 14:57:02,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 14:57:02,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:57:02,499 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 14:57:02,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 14:57:02,501 INFO L85 PathProgramCache]: Analyzing trace with hash 831704466, now seen corresponding path program 1 times [2024-11-14 14:57:02,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 14:57:02,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054874927] [2024-11-14 14:57:02,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:57:02,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 14:57:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:57:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4369 backedges. 0 proven. 4369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:57:04,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 14:57:04,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054874927] [2024-11-14 14:57:04,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054874927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 14:57:04,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103554844] [2024-11-14 14:57:04,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:57:04,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:57:04,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 14:57:04,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 14:57:04,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 14:57:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:57:05,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 2119 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 14:57:05,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 14:57:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4369 backedges. 0 proven. 4369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:57:06,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 14:57:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4369 backedges. 0 proven. 4369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:57:07,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103554844] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 14:57:07,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 14:57:07,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 43 [2024-11-14 14:57:07,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434646030] [2024-11-14 14:57:07,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 14:57:07,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 14:57:07,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 14:57:07,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 14:57:07,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2024-11-14 14:57:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:57:07,072 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 14:57:07,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 20.53488372093023) internal successors, (883), 43 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 14:57:07,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:57:07,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:57:07,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:57:07,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:57:07,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 14:57:07,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 14:57:07,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-14 14:57:07,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-11-14 14:57:07,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:57:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:57:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:57:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:57:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:57:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 14:57:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 14:57:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 14:57:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-11-14 14:57:07,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-14 14:57:07,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 14:57:08,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:57:08,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 14:57:08,080 WARN L203 CommutativityChecker]: Unsatisfiable commutativity condition generated: 17098#(not (exists ((|v_t1Thread1of1ForFork0_#t~ret53#1_Out_8| Int) (|v_t2Thread1of1ForFork1_#t~ret54#1_Out_8| Int) (|v_#pthreadsMutex_Out_8| (Array Int (Array Int Int)))) (and (= |v_t2Thread1of1ForFork1_#t~ret54#1_Out_8| 0) (= (store |#pthreadsMutex| |~#m~0.base| (store (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset| 1)) |v_#pthreadsMutex_Out_8|) (= |v_t1Thread1of1ForFork0_#t~ret53#1_Out_8| 0) (not (and (= |v_t2Thread1of1ForFork1_#t~ret54#1_Out_8| 0) (= (store |#pthreadsMutex| |~#m~0.base| (store (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset| 0)) |v_#pthreadsMutex_Out_8|) (= |v_t1Thread1of1ForFork0_#t~ret53#1_Out_8| 0) (= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 0)))))) [2024-11-14 14:57:08,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 14:57:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash 283050300, now seen corresponding path program 2 times [2024-11-14 14:57:08,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 14:57:08,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004337141] [2024-11-14 14:57:08,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:57:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 14:57:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:57:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6741 backedges. 6135 proven. 606 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:57:11,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 14:57:11,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004337141] [2024-11-14 14:57:11,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004337141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 14:57:11,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042710078] [2024-11-14 14:57:11,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 14:57:11,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:57:11,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 14:57:11,020 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 14:57:11,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 14:57:11,668 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 14:57:11,668 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 14:57:11,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 2517 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 14:57:11,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 14:57:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6741 backedges. 6741 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 14:57:12,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 14:57:12,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042710078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 14:57:12,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 14:57:12,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2024-11-14 14:57:12,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350535321] [2024-11-14 14:57:12,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 14:57:12,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 14:57:12,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 14:57:12,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 14:57:12,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2024-11-14 14:57:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:57:12,293 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 14:57:12,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 20.767441860465116) internal successors, (893), 43 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 14:57:12,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:57:12,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:57:12,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:57:12,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:57:12,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 14:57:12,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 14:57:12,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-14 14:57:12,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-11-14 14:57:12,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-11-14 14:57:12,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:57:13,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:57:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:57:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:57:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:57:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 14:57:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 14:57:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 14:57:13,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-11-14 14:57:13,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-14 14:57:13,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-14 14:57:13,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 14:57:13,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:57:13,402 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 14:57:13,414 WARN L203 CommutativityChecker]: Unsatisfiable commutativity condition generated: 20151#(not (exists ((|v_#pthreadsMutex_Out_10| (Array Int (Array Int Int))) (|v_t2Thread1of1ForFork1_#t~ret54#1_Out_10| Int) (|v_t1Thread1of1ForFork0_#t~ret53#1_Out_10| Int)) (and (= |v_t1Thread1of1ForFork0_#t~ret53#1_Out_10| 0) (= |v_t2Thread1of1ForFork1_#t~ret54#1_Out_10| 0) (= |v_#pthreadsMutex_Out_10| (store |#pthreadsMutex| |~#m~0.base| (store (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset| 1))) (not (and (= |v_t1Thread1of1ForFork0_#t~ret53#1_Out_10| 0) (= |v_t2Thread1of1ForFork1_#t~ret54#1_Out_10| 0) (= |v_#pthreadsMutex_Out_10| (store |#pthreadsMutex| |~#m~0.base| (store (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset| 0))) (= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 0)))))) [2024-11-14 14:57:13,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 14:57:13,416 INFO L85 PathProgramCache]: Analyzing trace with hash -114338273, now seen corresponding path program 3 times [2024-11-14 14:57:13,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 14:57:13,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520695904] [2024-11-14 14:57:13,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:57:13,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 14:57:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:57:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 3846 proven. 448 refuted. 0 times theorem prover too weak. 1786 trivial. 0 not checked. [2024-11-14 14:57:25,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 14:57:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520695904] [2024-11-14 14:57:25,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520695904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 14:57:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175929210] [2024-11-14 14:57:25,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 14:57:25,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:57:25,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 14:57:25,133 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 14:57:25,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 14:57:26,785 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-14 14:57:26,785 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 14:57:26,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-14 14:57:26,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 14:57:28,381 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 19 treesize of output 1 [2024-11-14 14:57:28,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:57:28,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 14:57:28,579 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 14:57:28,586 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-14 14:57:28,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-11-14 14:57:28,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:57:28,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 14:57:28,728 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 46 treesize of output 15 [2024-11-14 14:57:28,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:57:28,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 14:57:28,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 14:57:28,924 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-14 14:57:28,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-11-14 14:57:28,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:57:28,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 14:57:28,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 14:57:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 1185 proven. 441 refuted. 0 times theorem prover too weak. 4454 trivial. 0 not checked. [2024-11-14 14:57:29,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 14:57:29,208 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4974 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4974) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2024-11-14 14:57:29,231 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4974 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_4974) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2024-11-14 14:57:39,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 14:57:39,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 81 [2024-11-14 14:57:39,925 INFO L349 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2024-11-14 14:57:39,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 139 treesize of output 153 [2024-11-14 14:57:39,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 14:57:39,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 14:57:39,994 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 102 treesize of output 96 [2024-11-14 14:57:40,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 14:57:40,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 14:57:40,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2024-11-14 14:57:40,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 14:57:40,146 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 14:57:40,147 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 14:57:40,157 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 14:57:40,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 83 treesize of output 69 [2024-11-14 14:57:40,183 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 14:57:40,183 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 14:57:40,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:57:40,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-14 14:57:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 1025 proven. 448 refuted. 0 times theorem prover too weak. 4454 trivial. 153 not checked. [2024-11-14 14:57:44,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175929210] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 14:57:44,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 14:57:44,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18, 21] total 62 [2024-11-14 14:57:44,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336338822] [2024-11-14 14:57:44,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 14:57:44,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-14 14:57:44,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 14:57:44,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-14 14:57:44,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=3131, Unknown=39, NotChecked=234, Total=3782 [2024-11-14 14:57:44,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:57:44,660 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 14:57:44,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 13.258064516129032) internal successors, (822), 62 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 14:57:44,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:57:44,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:57:44,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:57:44,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:57:44,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 14:57:44,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 14:57:44,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-14 14:57:44,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-11-14 14:57:44,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-11-14 14:57:44,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-11-14 14:57:44,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:57:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:57:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:57:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:57:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:57:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 14:57:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 14:57:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 14:57:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2024-11-14 14:57:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-14 14:57:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-14 14:57:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-14 14:57:58,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 14:57:58,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:57:58,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 14:57:58,348 WARN L203 CommutativityChecker]: Unsatisfiable commutativity condition generated: 25822#(not (exists ((|v_#pthreadsMutex_Out_12| (Array Int (Array Int Int))) (|v_t1Thread1of1ForFork0_#t~ret53#1_Out_12| Int) (|v_t2Thread1of1ForFork1_#t~ret54#1_Out_12| Int)) (and (= |v_t1Thread1of1ForFork0_#t~ret53#1_Out_12| 0) (not (and (= |v_t1Thread1of1ForFork0_#t~ret53#1_Out_12| 0) (= |v_#pthreadsMutex_Out_12| (store |#pthreadsMutex| |~#m~0.base| (store (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset| 0))) (= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 0) (= |v_t2Thread1of1ForFork1_#t~ret54#1_Out_12| 0))) (= |v_#pthreadsMutex_Out_12| (store |#pthreadsMutex| |~#m~0.base| (store (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset| 1))) (= |v_t2Thread1of1ForFork1_#t~ret54#1_Out_12| 0)))) [2024-11-14 14:57:58,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 14:57:58,350 INFO L85 PathProgramCache]: Analyzing trace with hash 643623256, now seen corresponding path program 4 times [2024-11-14 14:57:58,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 14:57:58,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168155933] [2024-11-14 14:57:58,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 14:57:58,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 14:57:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 14:58:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 3617 proven. 287 refuted. 0 times theorem prover too weak. 2466 trivial. 0 not checked. [2024-11-14 14:58:09,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 14:58:09,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168155933] [2024-11-14 14:58:09,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168155933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 14:58:09,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038327452] [2024-11-14 14:58:09,008 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 14:58:09,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 14:58:09,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 14:58:09,010 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 14:58:09,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 14:58:59,593 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 14:58:59,594 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 14:58:59,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 2440 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-14 14:58:59,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 14:59:09,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 14:59:09,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:59:09,289 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-14 14:59:10,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:59:10,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 14:59:10,317 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-14 14:59:10,936 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 19 treesize of output 11 [2024-11-14 14:59:11,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:59:11,277 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-14 14:59:12,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:59:12,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 14:59:12,424 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-14 14:59:13,098 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 19 treesize of output 11 [2024-11-14 14:59:13,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:59:13,474 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-14 14:59:14,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:59:14,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 14:59:14,569 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-14 14:59:15,276 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 19 treesize of output 11 [2024-11-14 14:59:15,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:59:15,653 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-14 14:59:16,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 14:59:16,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 14:59:16,666 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-14 14:59:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 3721 proven. 471 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2024-11-14 14:59:16,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 14:59:18,332 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|)))) is different from false [2024-11-14 14:59:18,808 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|)))) is different from false [2024-11-14 14:59:18,839 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 20))))) is different from false [2024-11-14 14:59:19,024 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_6029 Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6029) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 20))))) is different from false [2024-11-14 14:59:19,136 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_218| Int) (v_ArrVal_6029 Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6029) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_218|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|)))) is different from false [2024-11-14 14:59:19,191 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_218| Int) (v_ArrVal_6029 Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6029) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_218|) .cse3) 20)))))))) is different from false [2024-11-14 14:59:19,300 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_218| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_6029 Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_6029) .cse3 (+ 1 (select .cse4 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_218|) .cse1) 20)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289|) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|))))) is different from false [2024-11-14 14:59:20,008 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_6026 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_218| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_6029 Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_6026) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_6029) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289|) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_218|) .cse1))) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|))))) is different from false [2024-11-14 14:59:21,765 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_6026 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_218| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_6029 Int) (v_ArrVal_6023 Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6023) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_6026) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_6029) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_218|) .cse1) 20))))))) is different from false [2024-11-14 14:59:21,993 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_6026 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_218| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_6029 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_222| Int) (v_ArrVal_6023 Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6023) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_6026) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_222|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_6029) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_218|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289|)))))) is different from false [2024-11-14 14:59:22,082 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_6026 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_218| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_6029 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_222| Int) (v_ArrVal_6023 Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6023) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_6026) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_222|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_6029) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289|) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_218|) .cse1))) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|)))))) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|)))) is different from false [2024-11-14 14:59:22,259 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_6026 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_218| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_6029 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_222| Int) (v_ArrVal_6023 Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_6023) .cse1 (+ (select .cse7 .cse1) 1)))))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_6026) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_222|))) (store (store .cse6 (+ 88 |c_~#queue~0.offset|) v_ArrVal_6029) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_218|) .cse3) 20)) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|))))))) is different from false [2024-11-14 14:59:23,631 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_6026 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_218| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_6029 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_222| Int) (v_ArrVal_6021 (Array Int Int)) (v_ArrVal_6023 Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_6021) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse5 v_ArrVal_6023) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6026) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_222|))) (store (store .cse4 .cse5 v_ArrVal_6029) .cse1 (+ 1 (select .cse4 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_218|) .cse1) 20)) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|)))))) is different from false [2024-11-14 14:59:26,235 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_6026 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_218| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_6018 Int) (v_ArrVal_6029 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_222| Int) (v_ArrVal_6021 (Array Int Int)) (v_ArrVal_6023 Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6018) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_6021) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse6 v_ArrVal_6023) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6026) |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_222|))) (store (store .cse5 .cse6 v_ArrVal_6029) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_218|) .cse1) 20)))))))) is different from false [2024-11-14 14:59:26,529 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_218| Int) (v_ArrVal_6018 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_226| Int) (v_ArrVal_6029 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_222| Int) (v_ArrVal_6021 (Array Int Int)) (v_ArrVal_6023 Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_6026 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6018) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_6021) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_226|))) (store (store .cse7 .cse6 v_ArrVal_6023) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6026) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_222|))) (store (store .cse5 .cse6 v_ArrVal_6029) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_218|) .cse1) 20)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|))))))) is different from false [2024-11-14 14:59:26,644 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_218| Int) (v_ArrVal_6018 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_226| Int) (v_ArrVal_6029 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_222| Int) (v_ArrVal_6021 (Array Int Int)) (v_ArrVal_6023 Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_6026 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6018) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_6021) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_226|))) (store (store .cse7 .cse6 v_ArrVal_6023) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6026) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_222|))) (store (store .cse5 .cse6 v_ArrVal_6029) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_218|) .cse1))))))))) (< (select .cse10 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297|)))) is different from false [2024-11-14 14:59:26,867 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_218| Int) (v_ArrVal_6018 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_226| Int) (v_ArrVal_6029 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_222| Int) (v_ArrVal_6021 (Array Int Int)) (v_ArrVal_6023 Int) (v_ArrVal_6032 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_6026 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int)) (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse10 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_6018) .cse4 (+ (select .cse10 .cse4) 1)))))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_6021) |c_~#queue~0.base|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse9 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_226|))) (store (store .cse9 .cse8 v_ArrVal_6023) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6026) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_222|))) (store (store .cse7 .cse8 v_ArrVal_6029) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6032) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_218|) .cse1) 20)) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289|)))))))) is different from false [2024-11-14 14:59:29,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 14:59:29,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1253 treesize of output 853 [2024-11-14 14:59:29,929 INFO L349 Elim1Store]: treesize reduction 40, result has 58.3 percent of original size [2024-11-14 14:59:29,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1120 treesize of output 912 [2024-11-14 14:59:30,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 14:59:30,028 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 470 treesize of output 454 [2024-11-14 14:59:30,065 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 128 treesize of output 120 [2024-11-14 14:59:30,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 14:59:30,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 14:59:30,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 14:59:30,180 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 8 treesize of output 4 [2024-11-14 14:59:30,288 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 14:59:30,293 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 14:59:30,294 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 14:59:30,459 INFO L349 Elim1Store]: treesize reduction 70, result has 40.7 percent of original size [2024-11-14 14:59:30,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 64 treesize of output 66 [2024-11-14 14:59:30,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 14:59:30,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 212 [2024-11-14 14:59:31,073 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 14:59:31,074 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 14:59:31,079 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 14:59:31,080 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 14:59:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2993 proven. 349 refuted. 4 times theorem prover too weak. 2178 trivial. 846 not checked. [2024-11-14 14:59:34,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038327452] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 14:59:34,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 14:59:34,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 40] total 97 [2024-11-14 14:59:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610940349] [2024-11-14 14:59:34,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 14:59:34,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2024-11-14 14:59:34,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 14:59:34,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-11-14 14:59:34,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=985, Invalid=5316, Unknown=87, NotChecked=2924, Total=9312 [2024-11-14 14:59:34,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:59:34,870 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 14:59:34,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 10.29896907216495) internal successors, (999), 97 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 14:59:34,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 14:59:34,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:59:34,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 14:59:34,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 14:59:34,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 14:59:34,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 14:59:34,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-14 14:59:34,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 177 states. [2024-11-14 14:59:34,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-11-14 14:59:34,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-11-14 14:59:34,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-11-14 14:59:34,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 15:00:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 15:00:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 15:00:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 15:00:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 15:00:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 15:00:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 15:00:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 15:00:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2024-11-14 15:00:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-14 15:00:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-14 15:00:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-14 15:00:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-11-14 15:00:31,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 15:00:31,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 15:00:31,305 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 15:00:31,319 WARN L203 CommutativityChecker]: Unsatisfiable commutativity condition generated: 32012#(not (exists ((|v_#pthreadsMutex_Out_14| (Array Int (Array Int Int))) (|v_t1Thread1of1ForFork0_#t~ret53#1_Out_14| Int) (|v_t2Thread1of1ForFork1_#t~ret54#1_Out_14| Int)) (and (= |v_#pthreadsMutex_Out_14| (store |#pthreadsMutex| |~#m~0.base| (store (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset| 1))) (not (and (= |v_#pthreadsMutex_Out_14| (store |#pthreadsMutex| |~#m~0.base| (store (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset| 0))) (= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 0) (= |v_t1Thread1of1ForFork0_#t~ret53#1_Out_14| 0) (= |v_t2Thread1of1ForFork1_#t~ret54#1_Out_14| 0))) (= |v_t1Thread1of1ForFork0_#t~ret53#1_Out_14| 0) (= |v_t2Thread1of1ForFork1_#t~ret54#1_Out_14| 0)))) [2024-11-14 15:00:31,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 15:00:31,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1494637895, now seen corresponding path program 5 times [2024-11-14 15:00:31,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 15:00:31,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066816704] [2024-11-14 15:00:31,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 15:00:31,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 15:00:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 15:00:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6640 backedges. 4525 proven. 1124 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-14 15:00:52,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 15:00:52,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066816704] [2024-11-14 15:00:52,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066816704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 15:00:52,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633136156] [2024-11-14 15:00:52,463 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-14 15:00:52,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 15:00:52,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 15:00:52,465 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 15:00:52,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process Received shutdown request... [2024-11-14 15:10:34,565 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-14 15:10:34,565 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-14 15:10:34,566 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-14 15:10:35,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-14 15:10:35,768 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forcibly destroying the process [2024-11-14 15:10:35,769 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-14 15:10:35,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2024-11-14 15:10:35,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 137 [2024-11-14 15:10:35,826 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-14 15:10:35,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 15:10:35,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2024-11-14 15:10:35,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516636152] [2024-11-14 15:10:35,827 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 15:10:35,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-14 15:10:35,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 15:10:35,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-14 15:10:35,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=2547, Unknown=0, NotChecked=0, Total=3080 [2024-11-14 15:10:35,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 15:10:35,829 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 15:10:35,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 9.821428571428571) internal successors, (550), 56 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 15:10:35,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 15:10:35,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 15:10:35,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 15:10:35,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 15:10:35,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 15:10:35,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 15:10:35,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-14 15:10:35,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 194 states. [2024-11-14 15:10:35,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-11-14 15:10:35,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-11-14 15:10:35,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-11-14 15:10:35,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-11-14 15:10:35,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 15:10:35,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 15:10:35,832 WARN L596 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2024-11-14 15:10:35,832 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 15:10:35,833 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1] [2024-11-14 15:10:35,833 INFO L320 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (2/2) [2024-11-14 15:10:35,835 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 15:10:35,835 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 15:10:35,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:10:35 BasicIcfg [2024-11-14 15:10:35,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 15:10:35,838 INFO L158 Benchmark]: Toolchain (without parser) took 838334.26ms. Allocated memory was 100.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 70.9MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 810.5MB. Max. memory is 8.0GB. [2024-11-14 15:10:35,838 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 100.7MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 15:10:35,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.18ms. Allocated memory is still 100.7MB. Free memory was 70.9MB in the beginning and 40.4MB in the end (delta: 30.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-11-14 15:10:35,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.72ms. Allocated memory is still 100.7MB. Free memory was 40.1MB in the beginning and 37.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-14 15:10:35,839 INFO L158 Benchmark]: Boogie Preprocessor took 44.96ms. Allocated memory is still 100.7MB. Free memory was 37.4MB in the beginning and 35.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 15:10:35,839 INFO L158 Benchmark]: RCFGBuilder took 601.40ms. Allocated memory is still 100.7MB. Free memory was 35.5MB in the beginning and 59.2MB in the end (delta: -23.7MB). Peak memory consumption was 22.6MB. Max. memory is 8.0GB. [2024-11-14 15:10:35,839 INFO L158 Benchmark]: TraceAbstraction took 837102.46ms. Allocated memory was 100.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 58.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 800.5MB. Max. memory is 8.0GB. [2024-11-14 15:10:35,841 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.23ms. Allocated memory is still 100.7MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 521.18ms. Allocated memory is still 100.7MB. Free memory was 70.9MB in the beginning and 40.4MB in the end (delta: 30.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.72ms. Allocated memory is still 100.7MB. Free memory was 40.1MB in the beginning and 37.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.96ms. Allocated memory is still 100.7MB. Free memory was 37.4MB in the beginning and 35.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 601.40ms. Allocated memory is still 100.7MB. Free memory was 35.5MB in the beginning and 59.2MB in the end (delta: -23.7MB). Peak memory consumption was 22.6MB. Max. memory is 8.0GB. * TraceAbstraction took 837102.46ms. Allocated memory was 100.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 58.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 800.5MB. 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: 2067, independent: 2050, independent conditional: 72, independent unconditional: 1978, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2055, independent: 2050, independent conditional: 72, independent unconditional: 1978, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2055, independent: 2050, independent conditional: 72, independent unconditional: 1978, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2055, independent: 2050, independent conditional: 72, independent unconditional: 1978, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2055, independent: 2050, independent conditional: 0, independent unconditional: 2050, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2055, independent: 2050, independent conditional: 0, independent unconditional: 2050, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1983, independent: 1978, independent conditional: 0, independent unconditional: 1978, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1983, independent: 1976, independent conditional: 0, independent unconditional: 1976, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 2055, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1983, unknown conditional: 0, unknown unconditional: 1983] , Statistics on independence cache: Total cache size (in pairs): 1983, Positive cache size: 1978, Positive conditional cache size: 0, Positive unconditional cache size: 1978, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 72, Maximal queried relation: 0, Independence queries for same thread: 12, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 185, Number of trivial persistent sets: 179, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1983, independent: 1978, independent conditional: 0, independent unconditional: 1978, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2067, independent: 2050, independent conditional: 72, independent unconditional: 1978, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2055, independent: 2050, independent conditional: 72, independent unconditional: 1978, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2055, independent: 2050, independent conditional: 72, independent unconditional: 1978, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2055, independent: 2050, independent conditional: 72, independent unconditional: 1978, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2055, independent: 2050, independent conditional: 0, independent unconditional: 2050, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2055, independent: 2050, independent conditional: 0, independent unconditional: 2050, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1983, independent: 1978, independent conditional: 0, independent unconditional: 1978, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1983, independent: 1976, independent conditional: 0, independent unconditional: 1976, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 2055, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1983, unknown conditional: 0, unknown unconditional: 1983] , Statistics on independence cache: Total cache size (in pairs): 1983, Positive cache size: 1978, Positive conditional cache size: 0, Positive unconditional cache size: 1978, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 72, Maximal queried relation: 0, Independence queries for same thread: 12 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14651, independent: 13595, independent conditional: 5419, independent unconditional: 8176, dependent: 1056, dependent conditional: 1029, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13640, independent: 13595, independent conditional: 5419, independent unconditional: 8176, dependent: 45, dependent conditional: 18, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13640, independent: 13595, independent conditional: 5419, independent unconditional: 8176, dependent: 45, dependent conditional: 18, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13679, independent: 13595, independent conditional: 5419, independent unconditional: 8176, dependent: 84, dependent conditional: 57, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13679, independent: 13595, independent conditional: 0, independent unconditional: 13595, dependent: 84, dependent conditional: 18, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13679, independent: 13595, independent conditional: 0, independent unconditional: 13595, dependent: 84, dependent conditional: 18, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5920, independent: 5897, independent conditional: 0, independent unconditional: 5897, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5920, independent: 5895, independent conditional: 0, independent unconditional: 5895, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 25, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 404, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 386, dependent conditional: 11, dependent unconditional: 375, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 7, Protected Queries: 0 ], Cache Queries: [ total: 13679, independent: 7698, independent conditional: 0, independent unconditional: 7698, dependent: 61, dependent conditional: 17, dependent unconditional: 44, unknown: 5920, unknown conditional: 1, unknown unconditional: 5919] , Statistics on independence cache: Total cache size (in pairs): 7903, Positive cache size: 7875, Positive conditional cache size: 0, Positive unconditional cache size: 7875, Negative cache size: 28, Negative conditional cache size: 1, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5458, Maximal queried relation: 5, Independence queries for same thread: 1011, Persistent sets #1 benchmarks: Persistent set computation time: 0.5s, Number of persistent set computation: 311, Number of trivial persistent sets: 258, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8203, independent: 8176, independent conditional: 0, independent unconditional: 8176, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14651, independent: 13595, independent conditional: 5419, independent unconditional: 8176, dependent: 1056, dependent conditional: 1029, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13640, independent: 13595, independent conditional: 5419, independent unconditional: 8176, dependent: 45, dependent conditional: 18, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13640, independent: 13595, independent conditional: 5419, independent unconditional: 8176, dependent: 45, dependent conditional: 18, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13679, independent: 13595, independent conditional: 5419, independent unconditional: 8176, dependent: 84, dependent conditional: 57, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13679, independent: 13595, independent conditional: 0, independent unconditional: 13595, dependent: 84, dependent conditional: 18, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13679, independent: 13595, independent conditional: 0, independent unconditional: 13595, dependent: 84, dependent conditional: 18, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5920, independent: 5897, independent conditional: 0, independent unconditional: 5897, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5920, independent: 5895, independent conditional: 0, independent unconditional: 5895, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 25, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 404, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 386, dependent conditional: 11, dependent unconditional: 375, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 7, Protected Queries: 0 ], Cache Queries: [ total: 13679, independent: 7698, independent conditional: 0, independent unconditional: 7698, dependent: 61, dependent conditional: 17, dependent unconditional: 44, unknown: 5920, unknown conditional: 1, unknown unconditional: 5919] , Statistics on independence cache: Total cache size (in pairs): 7903, Positive cache size: 7875, Positive conditional cache size: 0, Positive unconditional cache size: 7875, Negative cache size: 28, Negative conditional cache size: 1, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5458, Maximal queried relation: 5, Independence queries for same thread: 1011 - PositiveResult [Line: 1049]: 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: 1033]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 382 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, 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.2s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 97 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 382 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 836.2s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 80.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 537, 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.9s SsaConstructionTime, 55.1s SatisfiabilityAnalysisTime, 111.9s InterpolantComputationTime, 11878 NumberOfCodeBlocks, 10786 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 15882 ConstructedInterpolants, 196 QuantifiedInterpolants, 111412 SizeOfPredicates, 181 NumberOfNonLiveVariables, 11189 ConjunctsInSsa, 315 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 58506/83239 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: CheckTime: 0.1s, ConditionCalculationTime: 0.1s, CommutingCounterexamples: 0, ConditionCalculations: 511, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 7 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown