/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-158c277 [2024-11-14 11:29:20,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 11:29:20,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-14 11:29:20,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 11:29:20,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 11:29:20,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 11:29:20,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 11:29:20,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 11:29:20,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 11:29:20,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 11:29:20,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 11:29:20,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 11:29:20,860 INFO L153 SettingsManager]: * Use SBE=true [2024-11-14 11:29:20,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 11:29:20,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 11:29:20,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 11:29:20,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 11:29:20,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 11:29:20,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 11:29:20,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 11:29:20,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 11:29:20,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 11:29:20,861 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 11:29:20,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 11:29:20,861 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 11:29:20,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 11:29:20,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 11:29:20,862 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-14 11:29:20,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 11:29:20,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 11:29:20,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 11:29:20,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 11:29:20,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 11:29:20,862 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-14 11:29:20,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 11:29:20,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 11:29:20,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-14 11:29:20,863 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-14 11:29:20,863 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-14 11:29:20,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2024-11-14 11:29:21,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 11:29:21,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 11:29:21,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 11:29:21,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 11:29:21,225 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 11:29:21,226 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 11:29:22,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 11:29:22,827 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 11:29:22,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_ok.i [2024-11-14 11:29:22,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/4a2df2299/a386dd5b96474fd795d0c60d58ae1163/FLAGda80e5f3a [2024-11-14 11:29:23,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/4a2df2299/a386dd5b96474fd795d0c60d58ae1163 [2024-11-14 11:29:23,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 11:29:23,103 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-14 11:29:23,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 11:29:23,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 11:29:23,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 11:29:23,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 11:29:23" (1/1) ... [2024-11-14 11:29:23,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a172617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 11:29:23, skipping insertion in model container [2024-11-14 11:29:23,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 11:29:23" (1/1) ... [2024-11-14 11:29:23,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 11:29:23,594 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 11:29:23,602 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 11:29:23,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 11:29:23,621 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 11:29:23,672 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 11:29:23,674 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 11:29:23,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 11:29:23,735 INFO L204 MainTranslator]: Completed translation [2024-11-14 11:29:23,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 11:29:23 WrapperNode [2024-11-14 11:29:23,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 11:29:23,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 11:29:23,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 11:29:23,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 11:29:23,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 11:29:23" (1/1) ... [2024-11-14 11:29:23,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 11:29:23" (1/1) ... [2024-11-14 11:29:23,779 INFO L138 Inliner]: procedures = 277, calls = 95, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 238 [2024-11-14 11:29:23,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 11:29:23,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 11:29:23,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 11:29:23,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 11:29:23,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 11:29:23" (1/1) ... [2024-11-14 11:29:23,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 11:29:23" (1/1) ... [2024-11-14 11:29:23,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 11:29:23" (1/1) ... [2024-11-14 11:29:23,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 11:29:23" (1/1) ... [2024-11-14 11:29:23,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 11:29:23" (1/1) ... [2024-11-14 11:29:23,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 11:29:23" (1/1) ... [2024-11-14 11:29:23,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 11:29:23" (1/1) ... [2024-11-14 11:29:23,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 11:29:23" (1/1) ... [2024-11-14 11:29:23,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 11:29:23,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 11:29:23,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 11:29:23,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 11:29:23,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 11:29:23" (1/1) ... [2024-11-14 11:29:23,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 11:29:23,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 11:29:23,847 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 11:29:23,850 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 11:29:23,867 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-14 11:29:23,867 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-14 11:29:23,867 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-14 11:29:23,867 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-14 11:29:23,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 11:29:23,867 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-14 11:29:23,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 11:29:23,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 11:29:23,868 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-14 11:29:23,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 11:29:23,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 11:29:23,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 11:29:23,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 11:29:23,869 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 11:29:23,995 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 11:29:23,997 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 11:29:24,377 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 11:29:24,377 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 11:29:24,395 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 11:29:24,395 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 11:29:24,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 11:29:24 BoogieIcfgContainer [2024-11-14 11:29:24,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 11:29:24,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 11:29:24,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 11:29:24,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 11:29:24,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 11:29:23" (1/3) ... [2024-11-14 11:29:24,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b1e623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 11:29:24, skipping insertion in model container [2024-11-14 11:29:24,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 11:29:23" (2/3) ... [2024-11-14 11:29:24,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b1e623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 11:29:24, skipping insertion in model container [2024-11-14 11:29:24,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 11:29:24" (3/3) ... [2024-11-14 11:29:24,404 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2024-11-14 11:29:24,420 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 11:29:24,423 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 11:29:24,423 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 11:29:24,528 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 11:29:24,588 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 11:29:24,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-14 11:29:24,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 11:29:24,591 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 11:29:24,593 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 11:29:24,685 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 11:29:24,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-14 11:29:24,702 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;@4cc97974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 11:29:24,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-14 11:29:24,745 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 11:29:24,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 11:29:24,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1238973868, now seen corresponding path program 1 times [2024-11-14 11:29:24,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 11:29:24,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553740714] [2024-11-14 11:29:24,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:24,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 11:29:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:29:25,053 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 11:29:25,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 11:29:25,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553740714] [2024-11-14 11:29:25,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553740714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 11:29:25,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 11:29:25,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 11:29:25,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232470996] [2024-11-14 11:29:25,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 11:29:25,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 11:29:25,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 11:29:25,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 11:29:25,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 11:29:25,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:25,085 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 11:29:25,086 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 11:29:25,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:25,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-14 11:29:25,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-14 11:29:25,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-14 11:29:25,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 11:29:25,355 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 11:29:25,358 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (1/2) [2024-11-14 11:29:25,365 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 11:29:25,366 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 11:29:25,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2024-11-14 11:29:25,366 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;@4cc97974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 11:29:25,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 11:29:25,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 11:29:25,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 11:29:25,846 INFO L85 PathProgramCache]: Analyzing trace with hash 132423784, now seen corresponding path program 1 times [2024-11-14 11:29:25,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 11:29:25,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819726811] [2024-11-14 11:29:25,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:25,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 11:29:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:29:26,048 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 11:29:26,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 11:29:26,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819726811] [2024-11-14 11:29:26,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819726811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 11:29:26,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 11:29:26,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 11:29:26,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459858013] [2024-11-14 11:29:26,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 11:29:26,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 11:29:26,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 11:29:26,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 11:29:26,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 11:29:26,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:26,051 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 11:29:26,051 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 11:29:26,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:26,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 11:29:26,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 11:29:26,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 11:29:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash -709167766, now seen corresponding path program 1 times [2024-11-14 11:29:26,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 11:29:26,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596129400] [2024-11-14 11:29:26,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 11:29:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:29:26,476 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 11:29:26,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 11:29:26,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596129400] [2024-11-14 11:29:26,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596129400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 11:29:26,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 11:29:26,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 11:29:26,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746344850] [2024-11-14 11:29:26,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 11:29:26,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 11:29:26,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 11:29:26,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 11:29:26,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 11:29:26,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:26,484 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 11:29:26,484 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 11:29:26,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:26,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:26,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 11:29:26,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 11:29:26,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 11:29:26,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1614928907, now seen corresponding path program 1 times [2024-11-14 11:29:26,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 11:29:26,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771637267] [2024-11-14 11:29:26,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 11:29:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:29:26,776 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 11:29:26,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 11:29:26,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771637267] [2024-11-14 11:29:26,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771637267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 11:29:26,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 11:29:26,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 11:29:26,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107725] [2024-11-14 11:29:26,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 11:29:26,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 11:29:26,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 11:29:26,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 11:29:26,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 11:29:26,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:26,780 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 11:29:26,782 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 11:29:26,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:26,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:26,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:26,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:26,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:26,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:26,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 11:29:26,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 11:29:26,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 11:29:26,832 INFO L85 PathProgramCache]: Analyzing trace with hash 791697283, now seen corresponding path program 1 times [2024-11-14 11:29:26,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 11:29:26,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628601523] [2024-11-14 11:29:26,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:26,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 11:29:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:29:27,063 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 11:29:27,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 11:29:27,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628601523] [2024-11-14 11:29:27,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628601523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 11:29:27,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463051938] [2024-11-14 11:29:27,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:27,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 11:29:27,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 11:29:27,067 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 11:29:27,068 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 11:29:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:29:27,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 11:29:27,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 11:29:27,395 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 11:29:27,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 11:29:27,505 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 11:29:27,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463051938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 11:29:27,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 11:29:27,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-14 11:29:27,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590438861] [2024-11-14 11:29:27,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 11:29:27,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 11:29:27,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 11:29:27,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 11:29:27,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-14 11:29:27,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:27,510 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 11:29:27,510 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 11:29:27,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:27,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:27,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:27,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:27,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:29:27,653 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 11:29:27,835 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 11:29:27,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 11:29:27,879 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 11:29:27,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 11:29:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash 971615859, now seen corresponding path program 2 times [2024-11-14 11:29:27,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 11:29:27,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581060679] [2024-11-14 11:29:27,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:27,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 11:29:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:29:28,306 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 11:29:28,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 11:29:28,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581060679] [2024-11-14 11:29:28,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581060679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 11:29:28,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369669142] [2024-11-14 11:29:28,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 11:29:28,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 11:29:28,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 11:29:28,311 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 11:29:28,313 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 11:29:28,523 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-14 11:29:28,523 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 11:29:28,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 11:29:28,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 11:29:28,586 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 11:29:28,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 11:29:28,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369669142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 11:29:28,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 11:29:28,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-11-14 11:29:28,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463582062] [2024-11-14 11:29:28,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 11:29:28,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 11:29:28,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 11:29:28,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 11:29:28,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-14 11:29:28,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:28,590 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 11:29:28,590 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 11:29:28,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:28,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:28,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:28,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:29:28,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:28,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:29:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:29:28,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 11:29:28,848 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 11:29:28,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 11:29:28,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 11:29:28,850 INFO L85 PathProgramCache]: Analyzing trace with hash -416105675, now seen corresponding path program 1 times [2024-11-14 11:29:28,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 11:29:28,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345396836] [2024-11-14 11:29:28,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 11:29:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:29:29,233 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 11:29:29,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 11:29:29,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345396836] [2024-11-14 11:29:29,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345396836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 11:29:29,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693237400] [2024-11-14 11:29:29,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:29,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 11:29:29,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 11:29:29,236 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 11:29:29,238 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 11:29:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:29:29,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 11:29:29,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 11:29:29,688 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 11:29:29,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 11:29:29,923 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 11:29:29,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693237400] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 11:29:29,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 11:29:29,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-14 11:29:29,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372346767] [2024-11-14 11:29:29,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 11:29:29,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 11:29:29,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 11:29:29,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 11:29:29,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-14 11:29:29,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:29,929 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 11:29:29,929 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 11:29:29,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:29,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:29,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:29,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:29:29,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:29:29,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:30,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:29:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:29:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 11:29:30,212 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 11:29:30,395 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 11:29:30,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 11:29:30,411 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 11:29:30,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 11:29:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1626808043, now seen corresponding path program 2 times [2024-11-14 11:29:30,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 11:29:30,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226561410] [2024-11-14 11:29:30,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:30,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 11:29:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:29:31,245 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 11:29:31,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 11:29:31,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226561410] [2024-11-14 11:29:31,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226561410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 11:29:31,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263577074] [2024-11-14 11:29:31,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 11:29:31,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 11:29:31,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 11:29:31,248 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 11:29:31,250 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 11:29:31,676 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 11:29:31,676 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 11:29:31,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 11:29:31,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 11:29:32,023 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 11:29:32,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 11:29:32,563 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 11:29:32,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263577074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 11:29:32,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 11:29:32,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-11-14 11:29:32,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985053706] [2024-11-14 11:29:32,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 11:29:32,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 11:29:32,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 11:29:32,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 11:29:32,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-14 11:29:32,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:32,569 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 11:29:32,569 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 11:29:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:29:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:29:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 11:29:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:29:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:29:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 11:29:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 11:29:33,283 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 11:29:33,465 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 11:29:33,465 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 11:29:33,480 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 11:29:33,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 11:29:33,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1845177557, now seen corresponding path program 3 times [2024-11-14 11:29:33,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 11:29:33,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286206819] [2024-11-14 11:29:33,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:33,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 11:29:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:29:35,672 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 11:29:35,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 11:29:35,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286206819] [2024-11-14 11:29:35,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286206819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 11:29:35,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051703408] [2024-11-14 11:29:35,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 11:29:35,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 11:29:35,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 11:29:35,676 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 11:29:35,678 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 11:29:36,278 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 11:29:36,279 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 11:29:36,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-14 11:29:36,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 11:29:38,379 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 11:29:38,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:29:38,447 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 11:29:38,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:29:38,643 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 11:29:38,685 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 11:29:38,745 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 11:29:38,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 11:29:39,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 11:29:39,293 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 11:29:39,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 11:29:39,302 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 11:29:39,308 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 11:29:39,324 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 11:29:39,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 11:29:39,376 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 11:29:40,114 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 11:29:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051703408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 11:29:40,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 11:29:40,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 14, 13] total 56 [2024-11-14 11:29:40,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088680163] [2024-11-14 11:29:40,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 11:29:40,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-14 11:29:40,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 11:29:40,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-14 11:29:40,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=2692, Unknown=5, NotChecked=0, Total=3080 [2024-11-14 11:29:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:40,120 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 11:29:40,120 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 11:29:40,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:40,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:40,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:40,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:29:40,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:29:40,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 11:29:40,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-14 11:29:40,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:29:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:29:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 11:29:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 11:29:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-11-14 11:29:47,354 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 11:29:47,540 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 11:29:47,540 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 11:29:47,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 11:29:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash 831704466, now seen corresponding path program 1 times [2024-11-14 11:29:47,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 11:29:47,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314291094] [2024-11-14 11:29:47,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:47,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 11:29:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:29:49,748 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 11:29:49,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 11:29:49,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314291094] [2024-11-14 11:29:49,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314291094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 11:29:49,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037034995] [2024-11-14 11:29:49,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:49,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 11:29:49,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 11:29:49,750 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 11:29:49,751 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 11:29:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:29:50,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 2119 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 11:29:50,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 11:29:50,781 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 11:29:50,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 11:29:51,738 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 11:29:51,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037034995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 11:29:51,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 11:29:51,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 43 [2024-11-14 11:29:51,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895329909] [2024-11-14 11:29:51,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 11:29:51,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 11:29:51,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 11:29:51,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 11:29:51,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2024-11-14 11:29:51,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:51,743 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 11:29:51,743 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 11:29:51,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:51,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:51,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:51,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:29:51,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:29:51,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 11:29:51,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-14 11:29:51,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-11-14 11:29:51,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:29:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:29:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 11:29:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 11:29:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-11-14 11:29:52,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-14 11:29:52,592 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 11:29:52,778 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 11:29:52,778 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 11:29:52,791 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 11:29:52,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 11:29:52,793 INFO L85 PathProgramCache]: Analyzing trace with hash 283050300, now seen corresponding path program 2 times [2024-11-14 11:29:52,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 11:29:52,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306616753] [2024-11-14 11:29:52,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:52,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 11:29:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:29:55,492 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 11:29:55,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 11:29:55,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306616753] [2024-11-14 11:29:55,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306616753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 11:29:55,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598342248] [2024-11-14 11:29:55,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 11:29:55,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 11:29:55,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 11:29:55,495 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 11:29:55,495 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 11:29:56,253 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 11:29:56,253 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 11:29:56,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 2517 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 11:29:56,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 11:29:56,866 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 11:29:56,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 11:29:56,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598342248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 11:29:56,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 11:29:56,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2024-11-14 11:29:56,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780969553] [2024-11-14 11:29:56,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 11:29:56,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 11:29:56,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 11:29:56,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 11:29:56,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2024-11-14 11:29:56,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:56,869 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 11:29:56,869 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 11:29:56,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:56,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:56,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:56,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:29:56,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:29:56,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 11:29:56,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-14 11:29:56,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-11-14 11:29:56,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-11-14 11:29:56,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:57,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:29:57,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:57,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:29:57,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:29:57,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:29:57,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 11:29:57,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 11:29:57,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-11-14 11:29:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-14 11:29:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-14 11:29:57,975 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 11:29:58,153 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 11:29:58,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 11:29:58,163 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 11:29:58,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 11:29:58,164 INFO L85 PathProgramCache]: Analyzing trace with hash -114338273, now seen corresponding path program 3 times [2024-11-14 11:29:58,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 11:29:58,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45183244] [2024-11-14 11:29:58,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:29:58,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 11:29:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:30:10,910 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 11:30:10,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 11:30:10,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45183244] [2024-11-14 11:30:10,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45183244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 11:30:10,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153694262] [2024-11-14 11:30:10,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 11:30:10,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 11:30:10,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 11:30:10,913 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 11:30:10,915 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 11:30:12,578 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-14 11:30:12,578 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 11:30:12,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-14 11:30:12,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 11:30:14,105 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 11:30:14,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:30:14,168 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 11:30:14,310 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 11:30:14,317 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-14 11:30:14,317 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 11:30:14,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:30:14,358 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 11:30:14,481 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 11:30:14,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:30:14,532 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 11:30:14,663 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 11:30:14,669 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-14 11:30:14,669 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 11:30:14,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:30:14,699 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 11:30:14,720 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 11:30:14,754 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 11:30:14,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 11:30:14,937 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 11:30:14,952 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 11:30:27,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 11:30:27,333 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 11:30:27,364 INFO L349 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2024-11-14 11:30:27,364 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 11:30:27,380 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 11:30:27,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 11:30:27,395 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 11:30:27,414 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 11:30:27,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 11:30:27,433 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 11:30:27,452 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 11:30:27,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 11:30:27,459 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 11:30:27,466 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 11:30:27,469 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 11:30:27,476 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 11:30:27,477 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 11:30:27,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:30:27,480 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 11:30:28,386 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 11:30:28,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153694262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 11:30:28,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 11:30:28,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18, 21] total 62 [2024-11-14 11:30:28,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138427342] [2024-11-14 11:30:28,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 11:30:28,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-14 11:30:28,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 11:30:28,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-14 11:30:28,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=3130, Unknown=41, NotChecked=234, Total=3782 [2024-11-14 11:30:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:30:28,390 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 11:30:28,390 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 11:30:28,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:30:28,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:30:28,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:30:28,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:30:28,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:30:28,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 11:30:28,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-14 11:30:28,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-11-14 11:30:28,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-11-14 11:30:28,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-11-14 11:30:28,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:30:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:30:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:30:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:30:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:30:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:30:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 11:30:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 11:30:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2024-11-14 11:30:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-14 11:30:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-14 11:30:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-14 11:30:32,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-14 11:30:32,748 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 11:30:32,749 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 11:30:32,761 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 11:30:32,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 11:30:32,762 INFO L85 PathProgramCache]: Analyzing trace with hash 643623256, now seen corresponding path program 4 times [2024-11-14 11:30:32,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 11:30:32,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164923726] [2024-11-14 11:30:32,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:30:32,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 11:30:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:30:42,314 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 11:30:42,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 11:30:42,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164923726] [2024-11-14 11:30:42,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164923726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 11:30:42,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785456316] [2024-11-14 11:30:42,314 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 11:30:42,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 11:30:42,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 11:30:42,316 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 11:30:42,317 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 11:31:32,585 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 11:31:32,586 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 11:31:32,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 2440 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-14 11:31:32,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 11:31:34,438 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 11:31:34,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:31:34,492 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 11:31:34,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:31:34,670 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 11:31:34,706 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 11:31:34,833 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 11:31:34,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:31:34,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 11:31:35,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:31:35,094 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 11:31:35,125 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 11:31:35,263 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 11:31:35,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:31:35,334 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 11:31:35,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:31:35,530 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 11:31:35,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 11:31:35,715 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 11:31:35,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:31:35,788 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 11:31:35,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 11:31:35,947 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 11:31:35,962 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 11:31:36,000 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 11:31:36,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 11:31:36,772 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 11:31:36,806 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 11:31:36,826 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 11:31:36,863 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 11:31:37,853 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 11:31:37,945 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 11:31:37,978 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 11:31:38,037 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 11:31:42,092 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 11:31:42,201 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 11:31:42,254 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 11:31:42,331 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 11:31:43,113 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_6016 (Array Int Int)) (v_ArrVal_6026 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int)) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_6016) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse8 .cse6 v_ArrVal_6018) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6021) |c_~#queue~0.base|))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse0 (+ (* |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 ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ (* |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_297|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289|) (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 11:31:43,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 11:31:43,315 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 11:31:43,352 INFO L349 Elim1Store]: treesize reduction 40, result has 58.3 percent of original size [2024-11-14 11:31:43,352 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 11:31:43,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 11:31:43,401 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 11:31:43,422 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 11:31:43,437 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 11:31:43,451 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 11:31:43,469 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 11:31:43,508 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 11:31:43,551 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 11:31:43,553 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 11:31:43,554 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 11:31:43,592 INFO L349 Elim1Store]: treesize reduction 70, result has 40.7 percent of original size [2024-11-14 11:31:43,593 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 11:31:43,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 11:31:43,651 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 11:31:43,802 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 11:31:43,804 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 11:31:43,811 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 11:31:43,812 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 11:31:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 3272 proven. 387 refuted. 15 times theorem prover too weak. 2178 trivial. 518 not checked. [2024-11-14 11:31:44,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785456316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 11:31:44,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 11:31:44,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 40] total 97 [2024-11-14 11:31:44,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632048149] [2024-11-14 11:31:44,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 11:31:44,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2024-11-14 11:31:44,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 11:31:44,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-11-14 11:31:44,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1095, Invalid=5793, Unknown=136, NotChecked=2288, Total=9312 [2024-11-14 11:31:44,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:31:44,516 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 11:31:44,516 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 11:31:44,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:31:44,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:31:44,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:31:44,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:31:44,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:31:44,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 11:31:44,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-14 11:31:44,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 177 states. [2024-11-14 11:31:44,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-11-14 11:31:44,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-11-14 11:31:44,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-11-14 11:31:44,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:32:03,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:32:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:32:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:32:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:32:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:32:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 11:32:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 11:32:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2024-11-14 11:32:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-14 11:32:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-14 11:32:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-14 11:32:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-11-14 11:32:03,154 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 11:32:03,312 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 11:32:03,312 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 11:32:03,325 WARN L203 CommutativityChecker]: Unsatisfiable commutativity condition generated: 32000#(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 11:32:03,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 11:32:03,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1494637895, now seen corresponding path program 5 times [2024-11-14 11:32:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 11:32:03,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456679691] [2024-11-14 11:32:03,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 11:32:03,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 11:32:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 11:32:20,873 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 11:32:20,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 11:32:20,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456679691] [2024-11-14 11:32:20,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456679691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 11:32:20,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104175970] [2024-11-14 11:32:20,874 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-14 11:32:20,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 11:32:20,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 11:32:20,875 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 11:32:20,876 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 11:43:21,575 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 11:43:21,575 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 11:43:21,575 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 11:43:22,616 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 11:43:22,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2024-11-14 11:43:22,779 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 11:43:22,832 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 11:43:22,832 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-14 11:43:22,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 11:43:22,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2024-11-14 11:43:22,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360696013] [2024-11-14 11:43:22,833 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 11:43:22,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-14 11:43:22,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 11:43:22,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-14 11:43:22,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=2547, Unknown=0, NotChecked=0, Total=3080 [2024-11-14 11:43:22,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:43:22,836 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 11:43:22,836 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 11:43:22,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:43:22,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:43:22,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 11:43:22,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 11:43:22,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-14 11:43:22,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 11:43:22,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-14 11:43:22,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 194 states. [2024-11-14 11:43:22,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-11-14 11:43:22,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-11-14 11:43:22,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-11-14 11:43:22,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2024-11-14 11:43:22,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 11:43:22,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 11:43:22,837 WARN L596 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2024-11-14 11:43:22,838 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 11:43:22,839 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1] [2024-11-14 11:43:22,839 INFO L320 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (2/2) [2024-11-14 11:43:22,841 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 11:43:22,841 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 11:43:22,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 11:43:22 BasicIcfg [2024-11-14 11:43:22,844 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 11:43:22,845 INFO L158 Benchmark]: Toolchain (without parser) took 839742.21ms. Allocated memory was 100.7MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 69.4MB in the beginning and 1.0GB in the end (delta: -954.0MB). Peak memory consumption was 794.6MB. Max. memory is 8.0GB. [2024-11-14 11:43:22,845 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 100.7MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 11:43:22,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 633.09ms. Allocated memory is still 100.7MB. Free memory was 69.4MB in the beginning and 38.8MB in the end (delta: 30.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-11-14 11:43:22,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.62ms. Allocated memory is still 100.7MB. Free memory was 38.8MB in the beginning and 36.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-14 11:43:22,846 INFO L158 Benchmark]: Boogie Preprocessor took 28.95ms. Allocated memory is still 100.7MB. Free memory was 36.0MB in the beginning and 34.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 11:43:22,846 INFO L158 Benchmark]: RCFGBuilder took 585.93ms. Allocated memory is still 100.7MB. Free memory was 34.0MB in the beginning and 58.0MB in the end (delta: -24.0MB). Peak memory consumption was 22.4MB. Max. memory is 8.0GB. [2024-11-14 11:43:22,847 INFO L158 Benchmark]: TraceAbstraction took 838446.60ms. Allocated memory was 100.7MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 57.5MB in the beginning and 1.0GB in the end (delta: -965.9MB). Peak memory consumption was 784.8MB. Max. memory is 8.0GB. [2024-11-14 11:43:22,848 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.25ms. Allocated memory is still 100.7MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 633.09ms. Allocated memory is still 100.7MB. Free memory was 69.4MB in the beginning and 38.8MB in the end (delta: 30.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.62ms. Allocated memory is still 100.7MB. Free memory was 38.8MB in the beginning and 36.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.95ms. Allocated memory is still 100.7MB. Free memory was 36.0MB in the beginning and 34.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 585.93ms. Allocated memory is still 100.7MB. Free memory was 34.0MB in the beginning and 58.0MB in the end (delta: -24.0MB). Peak memory consumption was 22.4MB. Max. memory is 8.0GB. * TraceAbstraction took 838446.60ms. Allocated memory was 100.7MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 57.5MB in the beginning and 1.0GB in the end (delta: -965.9MB). Peak memory consumption was 784.8MB. 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: 134, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 83, dependent conditional: 0, dependent unconditional: 83, 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: 134, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 83, dependent conditional: 0, dependent unconditional: 83, 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: 14650, independent: 13594, independent conditional: 5418, 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: 13639, independent: 13594, independent conditional: 5418, 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: 13639, independent: 13594, independent conditional: 5418, 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: 13678, independent: 13594, independent conditional: 5418, 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: 13678, independent: 13594, independent conditional: 0, independent unconditional: 13594, 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: 13678, independent: 13594, independent conditional: 0, independent unconditional: 13594, 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: 409, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 377, dependent conditional: 12, dependent unconditional: 365, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 7, Protected Queries: 0 ], Cache Queries: [ total: 13678, independent: 7697, independent conditional: 0, independent unconditional: 7697, 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: 5457, 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: 14650, independent: 13594, independent conditional: 5418, 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: 13639, independent: 13594, independent conditional: 5418, 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: 13639, independent: 13594, independent conditional: 5418, 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: 13678, independent: 13594, independent conditional: 5418, 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: 13678, independent: 13594, independent conditional: 0, independent unconditional: 13594, 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: 13678, independent: 13594, independent conditional: 0, independent unconditional: 13594, 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: 409, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 377, dependent conditional: 12, dependent unconditional: 365, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 7, Protected Queries: 0 ], Cache Queries: [ total: 13678, independent: 7697, independent conditional: 0, independent unconditional: 7697, 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: 5457, 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: 837.5s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 33.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: 538, 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, 54.9s SatisfiabilityAnalysisTime, 81.8s InterpolantComputationTime, 11878 NumberOfCodeBlocks, 10786 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 15882 ConstructedInterpolants, 196 QuantifiedInterpolants, 111412 SizeOfPredicates, 181 NumberOfNonLiveVariables, 11189 ConjunctsInSsa, 315 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 58785/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