/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 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 16:01:25,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 16:01:25,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 16:01:25,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 16:01:25,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 16:01:25,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 16:01:25,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 16:01:25,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 16:01:25,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 16:01:25,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 16:01:25,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 16:01:25,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 16:01:25,548 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 16:01:25,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 16:01:25,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 16:01:25,548 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 16:01:25,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 16:01:25,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 16:01:25,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 16:01:25,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 16:01:25,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 16:01:25,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 16:01:25,551 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 16:01:25,551 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 16:01:25,551 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 16:01:25,551 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 16:01:25,551 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 16:01:25,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 16:01:25,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 16:01:25,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 16:01:25,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:01:25,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 16:01:25,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 16:01:25,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 16:01:25,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 16:01:25,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:01:25,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 16:01:25,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 16:01:25,552 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 16:01:25,552 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 16:01:25,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 16:01:25,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 16:01:25,552 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 16:01:25,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 16:01:25,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 16:01:25,553 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 16:01:25,553 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 16:01:25,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 16:01:25,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 16:01:25,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 16:01:25,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 16:01:25,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 16:01:25,808 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 16:01:25,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2025-04-14 16:01:27,079 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312dcb715/58da9a817db24088bb22f2525f0d3f0c/FLAGe6c1057ef [2025-04-14 16:01:27,267 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 16:01:27,268 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2025-04-14 16:01:27,273 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312dcb715/58da9a817db24088bb22f2525f0d3f0c/FLAGe6c1057ef [2025-04-14 16:01:28,230 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312dcb715/58da9a817db24088bb22f2525f0d3f0c [2025-04-14 16:01:28,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 16:01:28,233 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 16:01:28,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 16:01:28,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 16:01:28,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 16:01:28,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:01:28" (1/1) ... [2025-04-14 16:01:28,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1baa0240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:28, skipping insertion in model container [2025-04-14 16:01:28,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:01:28" (1/1) ... [2025-04-14 16:01:28,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 16:01:28,418 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c[3694,3707] [2025-04-14 16:01:28,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 16:01:28,434 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 16:01:28,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c[3694,3707] [2025-04-14 16:01:28,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 16:01:28,491 INFO L204 MainTranslator]: Completed translation [2025-04-14 16:01:28,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:28 WrapperNode [2025-04-14 16:01:28,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 16:01:28,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 16:01:28,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 16:01:28,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 16:01:28,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:28" (1/1) ... [2025-04-14 16:01:28,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:28" (1/1) ... [2025-04-14 16:01:28,531 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 288 [2025-04-14 16:01:28,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 16:01:28,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 16:01:28,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 16:01:28,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 16:01:28,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:28" (1/1) ... [2025-04-14 16:01:28,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:28" (1/1) ... [2025-04-14 16:01:28,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:28" (1/1) ... [2025-04-14 16:01:28,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:28" (1/1) ... [2025-04-14 16:01:28,545 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:28" (1/1) ... [2025-04-14 16:01:28,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:28" (1/1) ... [2025-04-14 16:01:28,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:28" (1/1) ... [2025-04-14 16:01:28,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:28" (1/1) ... [2025-04-14 16:01:28,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 16:01:28,559 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 16:01:28,559 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 16:01:28,559 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 16:01:28,559 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:28" (1/1) ... [2025-04-14 16:01:28,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:01:28,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:01:28,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 16:01:28,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 16:01:28,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 16:01:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 16:01:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 16:01:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 16:01:28,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 16:01:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 16:01:28,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 16:01:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 16:01:28,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 16:01:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 16:01:28,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 16:01:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 16:01:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 16:01:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 16:01:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 16:01:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 16:01:28,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 16:01:28,609 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 16:01:28,705 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 16:01:28,706 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 16:01:29,057 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 16:01:29,057 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 16:01:29,310 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 16:01:29,310 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 16:01:29,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 04:01:29 BoogieIcfgContainer [2025-04-14 16:01:29,310 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 16:01:29,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 16:01:29,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 16:01:29,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 16:01:29,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 04:01:28" (1/3) ... [2025-04-14 16:01:29,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13282b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:01:29, skipping insertion in model container [2025-04-14 16:01:29,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:28" (2/3) ... [2025-04-14 16:01:29,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13282b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:01:29, skipping insertion in model container [2025-04-14 16:01:29,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 04:01:29" (3/3) ... [2025-04-14 16:01:29,317 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2025-04-14 16:01:29,328 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 16:01:29,330 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1.wvr.c that has 5 procedures, 46 locations, 50 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-14 16:01:29,330 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 16:01:29,375 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 16:01:29,405 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:01:29,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 16:01:29,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:01:29,409 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 16:01:29,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 16:01:29,472 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 16:01:29,483 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 16:01:29,489 INFO L340 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;@48de990b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:01:29,489 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 16:01:29,784 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 16:01:29,784 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:01:29,784 INFO L139 ounterexampleChecker]: Examining path program with hash -779302609, occurence #1 [2025-04-14 16:01:29,784 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:01:29,784 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:01:29,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash -695686680, now seen corresponding path program 1 times [2025-04-14 16:01:29,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:01:29,794 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811351214] [2025-04-14 16:01:29,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:29,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:29,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 16:01:29,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 16:01:29,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:29,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:29,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:01:29,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811351214] [2025-04-14 16:01:29,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811351214] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:01:29,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:01:29,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 16:01:29,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531156221] [2025-04-14 16:01:29,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:01:29,979 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 16:01:29,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:01:29,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 16:01:29,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 16:01:29,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:29,996 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:01:29,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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) [2025-04-14 16:01:29,999 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:30,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:30,389 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 16:01:30,389 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 16:01:30,389 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:01:30,389 INFO L139 ounterexampleChecker]: Examining path program with hash 1727041976, occurence #1 [2025-04-14 16:01:30,389 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:01:30,389 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:01:30,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:30,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1260367145, now seen corresponding path program 1 times [2025-04-14 16:01:30,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:01:30,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495914203] [2025-04-14 16:01:30,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:30,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:30,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-04-14 16:01:30,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-04-14 16:01:30,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:30,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:31,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:01:31,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495914203] [2025-04-14 16:01:31,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495914203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:01:31,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:01:31,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:01:31,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047750527] [2025-04-14 16:01:31,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:01:31,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 16:01:31,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:01:31,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 16:01:31,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 16:01:31,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:31,015 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:01:31,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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) [2025-04-14 16:01:31,015 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:31,015 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:31,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:31,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:01:31,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 16:01:31,156 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 16:01:31,156 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:01:31,156 INFO L139 ounterexampleChecker]: Examining path program with hash 1727041976, occurence #2 [2025-04-14 16:01:31,156 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:01:31,156 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-14 16:01:31,165 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:31,165 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 16:01:31,165 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:31,165 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 16:01:31,165 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:31,165 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 16:01:31,165 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:31,165 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 39 [2025-04-14 16:01:31,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:31,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1028925936, now seen corresponding path program 1 times [2025-04-14 16:01:31,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 16:01:31,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119599404] [2025-04-14 16:01:31,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:31,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:31,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 16:01:31,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 16:01:31,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:31,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:31,357 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 16:01:31,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119599404] [2025-04-14 16:01:31,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119599404] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:31,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [646233645] [2025-04-14 16:01:31,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:31,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:31,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 16:01:31,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 16:01:31,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:31,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:31,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 16:01:31,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:01:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:31,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [646233645] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:31,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 16:01:31,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-04-14 16:01:31,506 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 16:01:31,506 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 43 [2025-04-14 16:01:31,532 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:31,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1004436777, now seen corresponding path program 1 times [2025-04-14 16:01:31,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 16:01:31,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617493859] [2025-04-14 16:01:31,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:31,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:31,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-14 16:01:31,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 16:01:31,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:31,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:31,694 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 16:01:31,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617493859] [2025-04-14 16:01:31,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617493859] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:31,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1367227521] [2025-04-14 16:01:31,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:31,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:31,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-14 16:01:31,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 16:01:31,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:31,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:31,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 16:01:31,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:01:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:31,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1367227521] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:31,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 16:01:31,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-04-14 16:01:31,834 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 16:01:31,834 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 59 [2025-04-14 16:01:31,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:31,853 INFO L85 PathProgramCache]: Analyzing trace with hash -410094100, now seen corresponding path program 1 times [2025-04-14 16:01:31,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 16:01:31,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709368350] [2025-04-14 16:01:31,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:31,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:31,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-14 16:01:31,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-14 16:01:31,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:31,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:32,042 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 16:01:32,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709368350] [2025-04-14 16:01:32,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709368350] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:32,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1684802380] [2025-04-14 16:01:32,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:32,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:32,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-14 16:01:32,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-14 16:01:32,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:32,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:32,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 16:01:32,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:01:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:32,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1684802380] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:32,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 16:01:32,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-04-14 16:01:32,159 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 16:01:32,159 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 71 [2025-04-14 16:01:32,159 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:32,159 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 76 [2025-04-14 16:01:32,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash 555900254, now seen corresponding path program 1 times [2025-04-14 16:01:32,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 16:01:32,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800711617] [2025-04-14 16:01:32,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:32,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:32,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-14 16:01:32,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-14 16:01:32,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:32,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:32,409 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 16:01:32,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800711617] [2025-04-14 16:01:32,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800711617] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:32,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [52248116] [2025-04-14 16:01:32,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:32,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:32,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-14 16:01:32,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-14 16:01:32,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:32,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:32,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 16:01:32,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:01:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:32,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [52248116] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:32,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 16:01:32,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-04-14 16:01:32,522 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 16:01:32,522 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 94 is hopeless, skipping. [2025-04-14 16:01:32,523 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 98 [2025-04-14 16:01:32,523 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:32,523 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 106 [2025-04-14 16:01:32,523 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:32,523 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 110 [2025-04-14 16:01:32,523 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:32,523 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 112 [2025-04-14 16:01:32,523 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:32,523 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 115 [2025-04-14 16:01:32,523 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:32,523 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:01:32,523 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:01:32,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:32,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2047006087, now seen corresponding path program 1 times [2025-04-14 16:01:32,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:01:32,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632981054] [2025-04-14 16:01:32,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:32,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:32,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-14 16:01:32,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-14 16:01:32,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:32,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:32,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:01:32,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632981054] [2025-04-14 16:01:32,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632981054] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:32,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731289280] [2025-04-14 16:01:32,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:32,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:01:32,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:01:32,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:01:32,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 16:01:32,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-14 16:01:32,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-14 16:01:32,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:32,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:32,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 16:01:32,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:01:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:33,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:01:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:33,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731289280] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:01:33,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:01:33,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 16, 16] total 33 [2025-04-14 16:01:33,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498589894] [2025-04-14 16:01:33,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:01:33,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 16:01:33,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:01:33,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 16:01:33,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=703, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 16:01:33,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:33,643 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:01:33,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.529411764705882) internal successors, (256), 33 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:01:33,643 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:33,643 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:01:33,643 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:33,873 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:33,873 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:01:33,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:01:33,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 16:01:34,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2025-04-14 16:01:34,075 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 16:01:34,075 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:01:34,076 INFO L139 ounterexampleChecker]: Examining path program with hash 1727041976, occurence #3 [2025-04-14 16:01:34,076 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:01:34,076 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 16:01:34,076 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:34,076 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 16:01:34,076 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:34,076 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 16:01:34,076 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:34,076 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-14 16:01:34,076 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:34,076 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 42 [2025-04-14 16:01:34,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:34,109 INFO L85 PathProgramCache]: Analyzing trace with hash -880817460, now seen corresponding path program 1 times [2025-04-14 16:01:34,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 16:01:34,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340603644] [2025-04-14 16:01:34,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:34,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:34,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 16:01:34,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 16:01:34,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:34,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 16:01:34,160 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 16:01:34,160 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 16:01:34,160 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 46 [2025-04-14 16:01:34,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash 457742821, now seen corresponding path program 1 times [2025-04-14 16:01:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 16:01:34,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382069283] [2025-04-14 16:01:34,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:34,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-14 16:01:34,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 16:01:34,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:34,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:34,378 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 16:01:34,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382069283] [2025-04-14 16:01:34,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382069283] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:34,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [2059256796] [2025-04-14 16:01:34,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:34,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:34,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-14 16:01:34,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 16:01:34,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:34,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:34,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 16:01:34,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:01:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:34,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [2059256796] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:34,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 16:01:34,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2025-04-14 16:01:34,601 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 16:01:34,601 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 62 [2025-04-14 16:01:34,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1140247896, now seen corresponding path program 1 times [2025-04-14 16:01:34,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 16:01:34,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862723187] [2025-04-14 16:01:34,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:34,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:34,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-14 16:01:34,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-14 16:01:34,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:34,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:34,981 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 16:01:34,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862723187] [2025-04-14 16:01:34,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862723187] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:34,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [2060815183] [2025-04-14 16:01:34,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:34,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:34,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-14 16:01:35,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-14 16:01:35,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:35,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:35,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-14 16:01:35,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:01:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:35,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [2060815183] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:35,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 16:01:35,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2025-04-14 16:01:35,498 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 16:01:35,498 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 74 [2025-04-14 16:01:35,498 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:35,498 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 79 [2025-04-14 16:01:35,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash -700279110, now seen corresponding path program 1 times [2025-04-14 16:01:35,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 16:01:35,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396296869] [2025-04-14 16:01:35,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:35,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:35,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-14 16:01:35,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-14 16:01:35,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:35,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:36,042 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 16:01:36,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396296869] [2025-04-14 16:01:36,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396296869] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:36,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [62754685] [2025-04-14 16:01:36,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:36,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-14 16:01:36,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-14 16:01:36,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:36,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:36,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-14 16:01:36,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:01:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:36,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [62754685] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:36,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 16:01:36,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2025-04-14 16:01:36,586 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 16:01:36,586 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 97 is hopeless, skipping. [2025-04-14 16:01:36,586 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 101 [2025-04-14 16:01:36,586 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:36,586 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 109 [2025-04-14 16:01:36,586 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:36,586 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 113 [2025-04-14 16:01:36,586 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:36,586 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 115 [2025-04-14 16:01:36,586 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:36,586 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 118 [2025-04-14 16:01:36,586 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:36,586 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:01:36,586 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:01:36,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash 717455063, now seen corresponding path program 2 times [2025-04-14 16:01:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:01:36,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134114672] [2025-04-14 16:01:36,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 16:01:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:36,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-04-14 16:01:36,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 116 of 120 statements. [2025-04-14 16:01:36,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 16:01:36,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 16:01:36,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:01:36,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134114672] [2025-04-14 16:01:36,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134114672] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:01:36,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:01:36,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 16:01:36,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093999023] [2025-04-14 16:01:36,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:01:36,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 16:01:36,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:01:36,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 16:01:36,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-14 16:01:36,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:36,958 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:01:36,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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) [2025-04-14 16:01:36,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:36,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:01:36,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:01:36,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:37,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:37,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:01:37,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:01:37,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:01:37,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2025-04-14 16:01:37,235 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 16:01:37,235 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:01:37,236 INFO L139 ounterexampleChecker]: Examining path program with hash 268421376, occurence #1 [2025-04-14 16:01:37,236 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:01:37,236 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:01:37,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:37,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1203541485, now seen corresponding path program 3 times [2025-04-14 16:01:37,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:01:37,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724801753] [2025-04-14 16:01:37,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 16:01:37,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:37,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 144 statements into 6 equivalence classes. [2025-04-14 16:01:37,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 136 of 144 statements. [2025-04-14 16:01:37,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-14 16:01:37,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 54 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-04-14 16:01:37,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:01:37,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724801753] [2025-04-14 16:01:37,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724801753] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:37,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82290636] [2025-04-14 16:01:37,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 16:01:37,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:01:37,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:01:37,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:01:37,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 16:01:37,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 144 statements into 6 equivalence classes. [2025-04-14 16:01:38,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 136 of 144 statements. [2025-04-14 16:01:38,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-14 16:01:38,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:38,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-14 16:01:38,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:01:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 48 proven. 16 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-04-14 16:01:38,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:01:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 51 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-04-14 16:01:39,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82290636] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:01:39,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:01:39,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 54 [2025-04-14 16:01:39,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759454319] [2025-04-14 16:01:39,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:01:39,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-14 16:01:39,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:01:39,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-14 16:01:39,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=858, Invalid=2112, Unknown=0, NotChecked=0, Total=2970 [2025-04-14 16:01:39,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:39,039 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:01:39,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 6.672727272727273) internal successors, (367), 54 states have internal predecessors, (367), 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) [2025-04-14 16:01:39,039 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:39,039 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:01:39,039 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:01:39,039 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:01:39,039 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:39,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:39,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:01:39,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:01:39,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:01:39,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 16:01:39,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 16:01:39,532 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:01:39,532 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 16:01:39,532 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:01:39,533 INFO L139 ounterexampleChecker]: Examining path program with hash 268421376, occurence #2 [2025-04-14 16:01:39,533 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:01:39,533 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 16:01:39,533 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:39,533 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-14 16:01:39,533 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:39,533 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-04-14 16:01:39,533 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:39,533 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 21 [2025-04-14 16:01:39,533 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:39,533 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 50 [2025-04-14 16:01:39,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:39,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1608407391, now seen corresponding path program 1 times [2025-04-14 16:01:39,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 16:01:39,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758903421] [2025-04-14 16:01:39,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:39,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-14 16:01:39,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-14 16:01:39,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:39,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 16:01:39,603 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 16:01:39,603 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 16:01:39,603 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 93 [2025-04-14 16:01:39,603 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:39,603 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 112 [2025-04-14 16:01:39,603 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:39,603 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 119 [2025-04-14 16:01:39,603 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:39,603 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 126 [2025-04-14 16:01:39,603 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:39,603 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 130 [2025-04-14 16:01:39,605 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:39,605 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 134 [2025-04-14 16:01:39,605 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:39,605 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 138 [2025-04-14 16:01:39,605 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:39,605 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 142 [2025-04-14 16:01:39,605 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:39,605 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 144 [2025-04-14 16:01:39,605 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:39,605 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 146 [2025-04-14 16:01:39,605 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:39,605 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 148 [2025-04-14 16:01:39,605 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:39,605 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:01:39,605 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:01:39,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:39,606 INFO L85 PathProgramCache]: Analyzing trace with hash -463148013, now seen corresponding path program 4 times [2025-04-14 16:01:39,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:01:39,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329125139] [2025-04-14 16:01:39,606 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 16:01:39,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:39,621 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 150 statements into 2 equivalence classes. [2025-04-14 16:01:39,639 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 81 of 150 statements. [2025-04-14 16:01:39,640 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 16:01:39,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 36 proven. 68 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-14 16:01:39,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:01:39,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329125139] [2025-04-14 16:01:39,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329125139] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:39,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234717855] [2025-04-14 16:01:39,928 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 16:01:39,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:01:39,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:01:39,930 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:01:39,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 16:01:40,010 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 150 statements into 2 equivalence classes. [2025-04-14 16:01:40,035 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 81 of 150 statements. [2025-04-14 16:01:40,036 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 16:01:40,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:40,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 16:01:40,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:01:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 36 proven. 68 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-14 16:01:40,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:01:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 36 proven. 68 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-14 16:01:40,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234717855] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:01:40,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:01:40,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 30, 9] total 38 [2025-04-14 16:01:40,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042702746] [2025-04-14 16:01:40,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:01:40,724 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-14 16:01:40,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:01:40,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-14 16:01:40,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2025-04-14 16:01:40,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:40,726 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:01:40,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.5) internal successors, (247), 38 states have internal predecessors, (247), 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) [2025-04-14 16:01:40,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:40,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:01:40,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:01:40,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:01:40,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 16:01:40,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:42,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:42,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:01:42,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:01:42,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:01:42,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 16:01:42,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-14 16:01:42,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 16:01:42,353 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:01:42,353 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 16:01:42,353 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:01:42,353 INFO L139 ounterexampleChecker]: Examining path program with hash 285712072, occurence #1 [2025-04-14 16:01:42,353 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:01:42,353 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:01:42,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:42,354 INFO L85 PathProgramCache]: Analyzing trace with hash 164557654, now seen corresponding path program 5 times [2025-04-14 16:01:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:01:42,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570190693] [2025-04-14 16:01:42,354 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 16:01:42,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:42,379 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 202 statements into 9 equivalence classes. [2025-04-14 16:01:42,472 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 202 of 202 statements. [2025-04-14 16:01:42,472 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-04-14 16:01:42,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 505 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:43,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:01:43,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570190693] [2025-04-14 16:01:43,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570190693] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:43,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980170968] [2025-04-14 16:01:43,376 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 16:01:43,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:01:43,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:01:43,377 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:01:43,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 16:01:43,467 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 202 statements into 9 equivalence classes. [2025-04-14 16:01:43,889 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 202 of 202 statements. [2025-04-14 16:01:43,889 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-04-14 16:01:43,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:43,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 16:01:43,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:01:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 421 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:44,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:01:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 504 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980170968] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:01:45,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:01:45,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 34] total 97 [2025-04-14 16:01:45,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898115163] [2025-04-14 16:01:45,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:01:45,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2025-04-14 16:01:45,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:01:45,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2025-04-14 16:01:45,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1928, Invalid=7578, Unknown=0, NotChecked=0, Total=9506 [2025-04-14 16:01:45,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:45,794 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:01:45,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 6.153061224489796) internal successors, (603), 97 states have internal predecessors, (603), 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) [2025-04-14 16:01:45,794 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:45,794 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:01:45,794 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:01:45,794 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:01:45,794 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 16:01:45,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-14 16:01:45,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:46,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:46,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:01:46,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:01:46,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:01:46,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 16:01:46,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-14 16:01:46,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 16:01:46,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 16:01:46,433 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-14 16:01:46,434 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 16:01:46,434 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:01:46,434 INFO L139 ounterexampleChecker]: Examining path program with hash 285712072, occurence #2 [2025-04-14 16:01:46,434 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:01:46,434 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-14 16:01:46,434 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:46,434 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-14 16:01:46,434 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:46,434 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-04-14 16:01:46,434 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:46,434 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 33 [2025-04-14 16:01:46,434 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:46,435 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 181 [2025-04-14 16:01:46,435 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:46,435 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 197 [2025-04-14 16:01:46,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash -572081529, now seen corresponding path program 1 times [2025-04-14 16:01:46,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 16:01:46,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107206475] [2025-04-14 16:01:46,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:01:46,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:46,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-04-14 16:01:46,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-04-14 16:01:46,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:46,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 16:01:46,849 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 16:01:46,849 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 16:01:46,850 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 200 [2025-04-14 16:01:46,850 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:46,850 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 205 [2025-04-14 16:01:46,850 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:46,850 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 209 [2025-04-14 16:01:46,850 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:46,850 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 211 [2025-04-14 16:01:46,850 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:01:46,850 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 212 [2025-04-14 16:01:46,850 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:01:46,850 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:01:46,850 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:01:46,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:46,851 INFO L85 PathProgramCache]: Analyzing trace with hash -876906666, now seen corresponding path program 6 times [2025-04-14 16:01:46,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:01:46,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995040914] [2025-04-14 16:01:46,851 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 16:01:46,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:46,868 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 214 statements into 12 equivalence classes. [2025-04-14 16:01:47,206 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 214 of 214 statements. [2025-04-14 16:01:47,207 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-04-14 16:01:47,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 210 proven. 548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:48,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:01:48,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995040914] [2025-04-14 16:01:48,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995040914] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:48,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203498158] [2025-04-14 16:01:48,721 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 16:01:48,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:01:48,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:01:48,723 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:01:48,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 16:01:48,823 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 214 statements into 12 equivalence classes. [2025-04-14 16:01:49,424 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 214 of 214 statements. [2025-04-14 16:01:49,424 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-04-14 16:01:49,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:49,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-14 16:01:49,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:01:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 505 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-04-14 16:01:50,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:01:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 119 proven. 1 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2025-04-14 16:01:50,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203498158] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:01:50,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:01:50,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 8] total 92 [2025-04-14 16:01:50,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127826899] [2025-04-14 16:01:50,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:01:50,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2025-04-14 16:01:50,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:01:50,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2025-04-14 16:01:50,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=794, Invalid=7578, Unknown=0, NotChecked=0, Total=8372 [2025-04-14 16:01:50,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:50,934 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:01:50,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 5.228260869565218) internal successors, (481), 92 states have internal predecessors, (481), 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) [2025-04-14 16:01:50,935 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:50,935 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:01:50,935 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:01:50,935 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:01:50,935 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 16:01:50,935 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-14 16:01:50,935 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 16:01:50,935 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:54,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:01:54,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:01:54,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:01:54,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:01:54,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 16:01:54,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 16:01:54,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 16:01:54,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-04-14 16:01:54,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 16:01:54,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:01:54,544 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 16:01:54,544 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:01:54,544 INFO L139 ounterexampleChecker]: Examining path program with hash 169514310, occurence #1 [2025-04-14 16:01:54,544 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:01:54,544 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:01:54,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:01:54,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1563337608, now seen corresponding path program 7 times [2025-04-14 16:01:54,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:01:54,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525478547] [2025-04-14 16:01:54,545 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 16:01:54,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:01:54,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-04-14 16:01:54,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-04-14 16:01:54,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:54,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 989 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:01:58,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:01:58,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525478547] [2025-04-14 16:01:58,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525478547] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:01:58,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883776904] [2025-04-14 16:01:58,486 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 16:01:58,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:01:58,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:01:58,487 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:01:58,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 16:01:58,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-04-14 16:01:58,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-04-14 16:01:58,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:01:58,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:01:58,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-14 16:01:58,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:02:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 959 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:02:00,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:02:03,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 992 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:02:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883776904] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:02:03,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:02:03,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 55, 55] total 191 [2025-04-14 16:02:03,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509503412] [2025-04-14 16:02:03,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:02:03,215 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-04-14 16:02:03,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:02:03,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-04-14 16:02:03,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6221, Invalid=30451, Unknown=0, NotChecked=0, Total=36672 [2025-04-14 16:02:03,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:02:03,224 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:02:03,224 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 192 states have (on average 4.411458333333333) internal successors, (847), 191 states have internal predecessors, (847), 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) [2025-04-14 16:02:03,224 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:02:03,224 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:02:03,224 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:02:03,224 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:02:03,224 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 16:02:03,224 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 16:02:03,224 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 16:02:03,224 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2025-04-14 16:02:03,224 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:02:04,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:02:04,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:02:04,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:02:04,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:02:04,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 16:02:04,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 16:02:04,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 16:02:04,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-04-14 16:02:04,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-14 16:02:04,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 16:02:04,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:02:04,264 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 16:02:04,264 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:02:04,264 INFO L139 ounterexampleChecker]: Examining path program with hash 169514310, occurence #2 [2025-04-14 16:02:04,264 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:02:04,264 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 34 [2025-04-14 16:02:04,264 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:02:04,264 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 37 [2025-04-14 16:02:04,264 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:02:04,264 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 40 [2025-04-14 16:02:04,264 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:02:04,264 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 43 [2025-04-14 16:02:04,264 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:02:04,264 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 239 [2025-04-14 16:02:04,265 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:04,265 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 253 [2025-04-14 16:02:04,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:02:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash 346656528, now seen corresponding path program 1 times [2025-04-14 16:02:04,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 16:02:04,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172856464] [2025-04-14 16:02:04,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:02:04,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:02:04,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-04-14 16:02:04,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-04-14 16:02:04,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:02:04,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 16:02:04,614 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 16:02:04,614 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 16:02:04,615 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 262 [2025-04-14 16:02:04,615 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:04,615 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 269 [2025-04-14 16:02:04,615 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:04,615 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 274 [2025-04-14 16:02:04,615 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:04,615 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 278 [2025-04-14 16:02:04,615 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:04,615 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 282 [2025-04-14 16:02:04,615 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:04,615 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 286 [2025-04-14 16:02:04,615 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:04,615 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 288 [2025-04-14 16:02:04,615 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:04,615 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 290 [2025-04-14 16:02:04,615 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:02:04,615 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 294 [2025-04-14 16:02:04,615 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:04,615 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:02:04,615 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:02:04,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:02:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1862282872, now seen corresponding path program 8 times [2025-04-14 16:02:04,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:02:04,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136406124] [2025-04-14 16:02:04,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 16:02:04,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:02:04,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 296 statements into 2 equivalence classes. [2025-04-14 16:02:04,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 296 of 296 statements. [2025-04-14 16:02:04,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 16:02:04,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:02:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 465 proven. 1023 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-14 16:02:07,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:02:07,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136406124] [2025-04-14 16:02:07,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136406124] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:02:07,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738522596] [2025-04-14 16:02:07,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 16:02:07,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:02:07,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:02:07,197 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:02:07,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 16:02:07,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 296 statements into 2 equivalence classes. [2025-04-14 16:02:07,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 296 of 296 statements. [2025-04-14 16:02:07,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 16:02:07,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:02:07,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-14 16:02:07,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:02:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 32 proven. 960 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-04-14 16:02:09,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:02:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 21 proven. 178 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2025-04-14 16:02:10,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738522596] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:02:10,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:02:10,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 9] total 129 [2025-04-14 16:02:10,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319811345] [2025-04-14 16:02:10,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:02:10,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 129 states [2025-04-14 16:02:10,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:02:10,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2025-04-14 16:02:10,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1591, Invalid=14921, Unknown=0, NotChecked=0, Total=16512 [2025-04-14 16:02:10,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:02:10,015 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:02:10,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 129 states, 129 states have (on average 4.813953488372093) internal successors, (621), 129 states have internal predecessors, (621), 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) [2025-04-14 16:02:10,015 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:02:10,015 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:02:10,015 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:02:10,015 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:02:10,015 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 16:02:10,015 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 16:02:10,015 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 16:02:10,016 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2025-04-14 16:02:10,016 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2025-04-14 16:02:10,016 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:02:15,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:02:15,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:02:15,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:02:15,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:02:15,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 16:02:15,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 16:02:15,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 16:02:15,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-04-14 16:02:15,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-14 16:02:15,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-04-14 16:02:15,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 16:02:15,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27 [2025-04-14 16:02:15,978 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 16:02:15,978 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:02:15,978 INFO L139 ounterexampleChecker]: Examining path program with hash -1906594847, occurence #1 [2025-04-14 16:02:15,978 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:02:15,978 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:02:15,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:02:15,979 INFO L85 PathProgramCache]: Analyzing trace with hash 449526816, now seen corresponding path program 9 times [2025-04-14 16:02:15,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:02:15,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726572221] [2025-04-14 16:02:15,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 16:02:15,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:02:16,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 424 statements into 17 equivalence classes. [2025-04-14 16:02:17,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) and asserted 424 of 424 statements. [2025-04-14 16:02:17,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2025-04-14 16:02:17,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:02:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2707 backedges. 2179 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:02:22,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:02:22,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726572221] [2025-04-14 16:02:22,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726572221] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:02:22,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407647943] [2025-04-14 16:02:22,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 16:02:22,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:02:22,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:02:22,279 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:02:22,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 16:02:22,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 424 statements into 17 equivalence classes. [2025-04-14 16:02:24,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) and asserted 424 of 424 statements. [2025-04-14 16:02:24,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2025-04-14 16:02:24,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:02:24,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 1851 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-04-14 16:02:24,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:02:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2707 backedges. 2131 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:02:28,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:02:30,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2707 backedges. 2168 proven. 539 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:02:30,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407647943] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:02:30,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:02:30,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 206 [2025-04-14 16:02:30,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118493469] [2025-04-14 16:02:30,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:02:30,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 207 states [2025-04-14 16:02:30,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:02:30,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2025-04-14 16:02:31,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10312, Invalid=32330, Unknown=0, NotChecked=0, Total=42642 [2025-04-14 16:02:31,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:02:31,000 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:02:31,000 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 207 states, 207 states have (on average 5.792270531400966) internal successors, (1199), 206 states have internal predecessors, (1199), 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) [2025-04-14 16:02:31,000 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:02:31,000 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:02:31,000 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:02:31,000 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:02:31,000 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 16:02:31,000 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 16:02:31,000 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 16:02:31,000 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2025-04-14 16:02:31,000 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2025-04-14 16:02:31,000 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2025-04-14 16:02:31,000 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:02:31,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:02:31,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:02:31,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:02:31,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:02:31,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 16:02:31,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 16:02:31,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 16:02:31,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-04-14 16:02:31,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-14 16:02:31,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-04-14 16:02:31,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-04-14 16:02:31,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 16:02:32,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-14 16:02:32,121 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 16:02:32,121 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:02:32,122 INFO L139 ounterexampleChecker]: Examining path program with hash -1906594847, occurence #2 [2025-04-14 16:02:32,122 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:02:32,122 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 48 [2025-04-14 16:02:32,122 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:02:32,122 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 51 [2025-04-14 16:02:32,122 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:02:32,122 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 54 [2025-04-14 16:02:32,122 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:02:32,122 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 57 [2025-04-14 16:02:32,122 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:02:32,122 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 333 [2025-04-14 16:02:32,122 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:32,122 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 395 [2025-04-14 16:02:32,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:02:32,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1223397809, now seen corresponding path program 1 times [2025-04-14 16:02:32,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 16:02:32,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913628622] [2025-04-14 16:02:32,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:02:32,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:02:32,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-04-14 16:02:33,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-04-14 16:02:33,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:02:33,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 16:02:33,277 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 16:02:33,277 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 16:02:33,278 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 404 [2025-04-14 16:02:33,278 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:33,278 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 411 [2025-04-14 16:02:33,278 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:33,278 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 416 [2025-04-14 16:02:33,278 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:33,278 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 420 [2025-04-14 16:02:33,278 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:33,278 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 424 [2025-04-14 16:02:33,278 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:33,278 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 428 [2025-04-14 16:02:33,278 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:33,278 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 430 [2025-04-14 16:02:33,278 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:33,278 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 432 [2025-04-14 16:02:33,278 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:02:33,278 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 436 [2025-04-14 16:02:33,278 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:02:33,278 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:02:33,278 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:02:33,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:02:33,279 INFO L85 PathProgramCache]: Analyzing trace with hash -193391072, now seen corresponding path program 10 times [2025-04-14 16:02:33,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:02:33,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685409892] [2025-04-14 16:02:33,279 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 16:02:33,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:02:33,308 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 438 statements into 2 equivalence classes. [2025-04-14 16:02:33,993 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 438 of 438 statements. [2025-04-14 16:02:33,993 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 16:02:33,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:03:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3260 backedges. 336 proven. 246 refuted. 0 times theorem prover too weak. 2678 trivial. 0 not checked. [2025-04-14 16:03:04,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:03:04,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685409892] [2025-04-14 16:03:04,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685409892] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:03:04,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285043665] [2025-04-14 16:03:04,553 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 16:03:04,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:03:04,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:03:04,555 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:03:04,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 16:03:04,720 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 438 statements into 2 equivalence classes. [2025-04-14 16:03:10,044 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 438 of 438 statements. [2025-04-14 16:03:10,044 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 16:03:10,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:03:10,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1977 conjuncts, 825 conjuncts are in the unsatisfiable core [2025-04-14 16:03:10,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:03:11,825 INFO L354 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 23 treesize of output 1 Received shutdown request... [2025-04-14 16:15:37,454 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 16:15:37,454 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 16:15:37,456 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 16:15:37,525 WARN L228 SmtUtils]: Removed 36 from assertion stack [2025-04-14 16:15:37,527 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-14 16:15:37,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-14 16:15:37,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-04-14 16:15:37,728 WARN L610 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 439 with TraceHistMax 46,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4409 for 511529ms.. [2025-04-14 16:15:37,730 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-14 16:15:37,730 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-14 16:15:37,730 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-14 16:15:37,730 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-14 16:15:37,733 INFO L422 BasicCegarLoop]: Path program histogram: [10, 1, 1] [2025-04-14 16:15:37,735 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 16:15:37,735 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 16:15:37,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 16:15:37,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 04:15:37 BasicIcfg [2025-04-14 16:15:37,744 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 16:15:37,745 INFO L158 Benchmark]: Toolchain (without parser) took 849511.33ms. Allocated memory was 155.2MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 107.2MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-14 16:15:37,745 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 16:15:37,745 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.20ms. Allocated memory is still 155.2MB. Free memory was 107.2MB in the beginning and 91.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 16:15:37,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.47ms. Allocated memory is still 155.2MB. Free memory was 91.3MB in the beginning and 88.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 16:15:37,745 INFO L158 Benchmark]: Boogie Preprocessor took 26.54ms. Allocated memory is still 155.2MB. Free memory was 88.6MB in the beginning and 87.2MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 16:15:37,745 INFO L158 Benchmark]: IcfgBuilder took 751.72ms. Allocated memory is still 155.2MB. Free memory was 87.2MB in the beginning and 89.7MB in the end (delta: -2.5MB). Peak memory consumption was 70.6MB. Max. memory is 8.0GB. [2025-04-14 16:15:37,746 INFO L158 Benchmark]: TraceAbstraction took 848432.30ms. Allocated memory was 155.2MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 88.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-14 16:15:37,747 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.20ms. Allocated memory is still 155.2MB. Free memory was 107.2MB in the beginning and 91.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.47ms. Allocated memory is still 155.2MB. Free memory was 91.3MB in the beginning and 88.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.54ms. Allocated memory is still 155.2MB. Free memory was 88.6MB in the beginning and 87.2MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 751.72ms. Allocated memory is still 155.2MB. Free memory was 87.2MB in the beginning and 89.7MB in the end (delta: -2.5MB). Peak memory consumption was 70.6MB. Max. memory is 8.0GB. * TraceAbstraction took 848432.30ms. Allocated memory was 155.2MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 88.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. 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: 35699, independent: 27009, independent conditional: 25079, independent unconditional: 1930, dependent: 8690, dependent conditional: 8676, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27464, independent: 27009, independent conditional: 25079, independent unconditional: 1930, dependent: 455, dependent conditional: 441, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27464, independent: 27009, independent conditional: 25079, independent unconditional: 1930, dependent: 455, dependent conditional: 441, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28226, independent: 27009, independent conditional: 25079, independent unconditional: 1930, dependent: 1217, dependent conditional: 1203, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28226, independent: 27009, independent conditional: 0, independent unconditional: 27009, dependent: 1217, dependent conditional: 333, dependent unconditional: 884, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28226, independent: 27009, independent conditional: 0, independent unconditional: 27009, dependent: 1217, dependent conditional: 333, dependent unconditional: 884, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1622, independent: 1587, independent conditional: 0, independent unconditional: 1587, dependent: 35, dependent conditional: 21, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1622, independent: 1583, independent conditional: 0, independent unconditional: 1583, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 35, dependent conditional: 21, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 35, dependent conditional: 21, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 587, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 496, dependent conditional: 184, dependent unconditional: 313, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 12, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 28226, independent: 25422, independent conditional: 0, independent unconditional: 25422, dependent: 1182, dependent conditional: 312, dependent unconditional: 870, unknown: 1622, unknown conditional: 21, unknown unconditional: 1601] , Statistics on independence cache: Total cache size (in pairs): 1634, Positive cache size: 1599, Positive conditional cache size: 12, Positive unconditional cache size: 1587, Negative cache size: 35, Negative conditional cache size: 21, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25949, Maximal queried relation: 3, Independence queries for same thread: 8235, Persistent sets #1 benchmarks: Persistent set computation time: 0.5s, Number of persistent set computation: 515, Number of trivial persistent sets: 296, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1944, independent: 1930, independent conditional: 0, independent unconditional: 1930, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 35699, independent: 27009, independent conditional: 25079, independent unconditional: 1930, dependent: 8690, dependent conditional: 8676, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27464, independent: 27009, independent conditional: 25079, independent unconditional: 1930, dependent: 455, dependent conditional: 441, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27464, independent: 27009, independent conditional: 25079, independent unconditional: 1930, dependent: 455, dependent conditional: 441, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28226, independent: 27009, independent conditional: 25079, independent unconditional: 1930, dependent: 1217, dependent conditional: 1203, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28226, independent: 27009, independent conditional: 0, independent unconditional: 27009, dependent: 1217, dependent conditional: 333, dependent unconditional: 884, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28226, independent: 27009, independent conditional: 0, independent unconditional: 27009, dependent: 1217, dependent conditional: 333, dependent unconditional: 884, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1622, independent: 1587, independent conditional: 0, independent unconditional: 1587, dependent: 35, dependent conditional: 21, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1622, independent: 1583, independent conditional: 0, independent unconditional: 1583, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 35, dependent conditional: 21, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 35, dependent conditional: 21, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 587, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 496, dependent conditional: 184, dependent unconditional: 313, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 12, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 28226, independent: 25422, independent conditional: 0, independent unconditional: 25422, dependent: 1182, dependent conditional: 312, dependent unconditional: 870, unknown: 1622, unknown conditional: 21, unknown unconditional: 1601] , Statistics on independence cache: Total cache size (in pairs): 1634, Positive cache size: 1599, Positive conditional cache size: 12, Positive unconditional cache size: 1587, Negative cache size: 35, Negative conditional cache size: 21, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25949, Maximal queried relation: 3, Independence queries for same thread: 8235 - TimeoutResultAtElement [Line: 136]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 439 with TraceHistMax 46,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4409 for 511529ms.. - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 439 with TraceHistMax 46,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4409 for 511529ms.. - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 439 with TraceHistMax 46,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4409 for 511529ms.. - TimeoutResultAtElement [Line: 128]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 439 with TraceHistMax 46,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4409 for 511529ms.. - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 439 with TraceHistMax 46,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4409 for 511529ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 78 locations, 94 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 848.3s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 10, EmptinessCheckTime: 14.4s, 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: 427, 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.4s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 34.5s InterpolantComputationTime, 3930 NumberOfCodeBlocks, 3772 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 5736 ConstructedInterpolants, 0 QuantifiedInterpolants, 31386 SizeOfPredicates, 95 NumberOfNonLiveVariables, 7887 ConjunctsInSsa, 351 ConjunctsInUnsatCore, 27 InterpolantComputations, 3 PerfectInterpolantSequences, 15053/21202 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 5863, ConditionCalculationTime [ms]: 265, ConditionCalculations: 55, QuantifiedConditions: 0, TraceChecks: 12, UnknownTraceChecks: 0, UnsatisfiedConditions: 5, ImperfectProofs: 7 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown