/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/chl-word-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 15:49:04,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 15:49:04,948 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 15:49:04,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 15:49:04,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 15:49:04,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 15:49:04,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 15:49:04,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 15:49:04,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 15:49:04,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 15:49:04,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 15:49:04,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 15:49:04,975 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 15:49:04,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 15:49:04,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 15:49:04,975 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 15:49:04,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 15:49:04,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:49:04,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 15:49:04,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 15:49:04,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 15:49:04,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:49:04,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 15:49:04,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 15:49:04,977 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 15:49:04,977 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 15:49:04,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 15:49:04,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 15:49:04,977 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 15:49:04,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 15:49:04,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 15:49:04,977 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 15:49:04,977 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 15:49:04,977 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 15:49:05,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 15:49:05,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 15:49:05,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 15:49:05,216 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 15:49:05,216 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 15:49:05,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2025-04-14 15:49:06,591 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e666b4f0/bb1bdf9768894038871d919822db0e9e/FLAG4ebb2d6fb [2025-04-14 15:49:06,801 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 15:49:06,801 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2025-04-14 15:49:06,808 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e666b4f0/bb1bdf9768894038871d919822db0e9e/FLAG4ebb2d6fb [2025-04-14 15:49:08,642 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e666b4f0/bb1bdf9768894038871d919822db0e9e [2025-04-14 15:49:08,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 15:49:08,645 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 15:49:08,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 15:49:08,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 15:49:08,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 15:49:08,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:49:08" (1/1) ... [2025-04-14 15:49:08,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5177284b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:49:08, skipping insertion in model container [2025-04-14 15:49:08,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:49:08" (1/1) ... [2025-04-14 15:49:08,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 15:49:08,835 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/chl-word-subst.wvr.c[3384,3397] [2025-04-14 15:49:08,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 15:49:08,854 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 15:49:08,891 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/chl-word-subst.wvr.c[3384,3397] [2025-04-14 15:49:08,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 15:49:08,902 INFO L204 MainTranslator]: Completed translation [2025-04-14 15:49:08,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:49:08 WrapperNode [2025-04-14 15:49:08,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 15:49:08,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 15:49:08,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 15:49:08,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 15:49:08,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:49:08" (1/1) ... [2025-04-14 15:49:08,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:49:08" (1/1) ... [2025-04-14 15:49:08,929 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 160 [2025-04-14 15:49:08,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 15:49:08,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 15:49:08,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 15:49:08,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 15:49:08,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:49:08" (1/1) ... [2025-04-14 15:49:08,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:49:08" (1/1) ... [2025-04-14 15:49:08,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:49:08" (1/1) ... [2025-04-14 15:49:08,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:49:08" (1/1) ... [2025-04-14 15:49:08,942 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:49:08" (1/1) ... [2025-04-14 15:49:08,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:49:08" (1/1) ... [2025-04-14 15:49:08,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:49:08" (1/1) ... [2025-04-14 15:49:08,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:49:08" (1/1) ... [2025-04-14 15:49:08,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 15:49:08,948 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 15:49:08,948 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 15:49:08,948 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 15:49:08,948 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:49:08" (1/1) ... [2025-04-14 15:49:08,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:49:08,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:49:08,974 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 15:49:08,979 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 15:49:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 15:49:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 15:49:08,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 15:49:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 15:49:08,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 15:49:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 15:49:08,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 15:49:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 15:49:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 15:49:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 15:49:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 15:49:08,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 15:49:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 15:49:08,996 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 15:49:09,074 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 15:49:09,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 15:49:09,384 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 15:49:09,384 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 15:49:09,563 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 15:49:09,563 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 15:49:09,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 03:49:09 BoogieIcfgContainer [2025-04-14 15:49:09,563 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 15:49:09,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 15:49:09,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 15:49:09,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 15:49:09,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:49:08" (1/3) ... [2025-04-14 15:49:09,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b50dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:49:09, skipping insertion in model container [2025-04-14 15:49:09,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:49:08" (2/3) ... [2025-04-14 15:49:09,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b50dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:49:09, skipping insertion in model container [2025-04-14 15:49:09,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 03:49:09" (3/3) ... [2025-04-14 15:49:09,573 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2025-04-14 15:49:09,585 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 15:49:09,587 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-subst.wvr.c that has 4 procedures, 38 locations, 46 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-14 15:49:09,587 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 15:49:09,642 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 15:49:09,676 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 15:49:09,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 15:49:09,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:49:09,680 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 15:49:09,682 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 15:49:09,748 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 15:49:09,760 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 15:49:09,767 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;@51464909, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 15:49:09,768 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 15:49:09,931 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 1 more)] === [2025-04-14 15:49:09,931 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:49:09,932 INFO L139 ounterexampleChecker]: Examining path program with hash -1034486932, occurence #1 [2025-04-14 15:49:09,932 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:49:09,932 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:49:09,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:49:09,935 INFO L85 PathProgramCache]: Analyzing trace with hash 548536556, now seen corresponding path program 1 times [2025-04-14 15:49:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:49:09,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663430501] [2025-04-14 15:49:09,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:09,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:49:09,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 15:49:10,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 15:49:10,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:10,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:10,382 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 15:49:10,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:49:10,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663430501] [2025-04-14 15:49:10,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663430501] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:49:10,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:49:10,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 15:49:10,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473648201] [2025-04-14 15:49:10,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:49:10,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 15:49:10,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:49:10,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 15:49:10,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 15:49:10,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:10,428 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:49:10,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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 15:49:10,430 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:10,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:49:10,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 15:49:10,663 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 1 more)] === [2025-04-14 15:49:10,663 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:49:10,663 INFO L139 ounterexampleChecker]: Examining path program with hash 1930284750, occurence #1 [2025-04-14 15:49:10,663 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:49:10,663 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:49:10,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:49:10,664 INFO L85 PathProgramCache]: Analyzing trace with hash -220636641, now seen corresponding path program 1 times [2025-04-14 15:49:10,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:49:10,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217533612] [2025-04-14 15:49:10,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:10,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:49:10,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 15:49:10,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 15:49:10,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:10,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:11,346 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 15:49:11,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:49:11,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217533612] [2025-04-14 15:49:11,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217533612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:49:11,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:49:11,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 15:49:11,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684801086] [2025-04-14 15:49:11,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:49:11,348 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 15:49:11,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:49:11,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 15:49:11,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-14 15:49:11,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:11,349 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:49:11,349 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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 15:49:11,349 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:49:11,349 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:11,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:49:11,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:11,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 15:49:11,598 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 1 more)] === [2025-04-14 15:49:11,598 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:49:11,598 INFO L139 ounterexampleChecker]: Examining path program with hash 1930284750, occurence #2 [2025-04-14 15:49:11,598 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:49:11,599 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 15:49:11,599 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:11,599 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-14 15:49:11,609 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:49:11,610 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 15:49:11,610 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:49:11,610 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-14 15:49:11,610 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:49:11,610 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-04-14 15:49:11,610 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:11,610 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-14 15:49:11,610 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:11,610 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-14 15:49:11,610 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:11,610 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-14 15:49:11,610 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:49:11,610 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2025-04-14 15:49:11,611 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:11,611 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:49:11,611 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:49:11,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:49:11,611 INFO L85 PathProgramCache]: Analyzing trace with hash 739011433, now seen corresponding path program 1 times [2025-04-14 15:49:11,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:49:11,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205861819] [2025-04-14 15:49:11,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:11,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:49:11,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 15:49:11,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 15:49:11,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:11,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:11,821 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 15:49:11,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:49:11,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205861819] [2025-04-14 15:49:11,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205861819] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:49:11,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560008249] [2025-04-14 15:49:11,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:11,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:49:11,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:49:11,823 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 15:49:11,825 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 15:49:11,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 15:49:11,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 15:49:11,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:11,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:11,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 15:49:11,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:49:12,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 15:49:12,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:49:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 15:49:14,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560008249] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 15:49:14,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 15:49:14,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 12] total 25 [2025-04-14 15:49:14,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84105369] [2025-04-14 15:49:14,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:49:14,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 15:49:14,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:49:14,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 15:49:14,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2025-04-14 15:49:14,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:14,259 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:49:14,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 15:49:14,260 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:49:14,260 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:14,260 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:15,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:49:15,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:15,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 15:49:15,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 15:49:15,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-14 15:49:15,804 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 1 more)] === [2025-04-14 15:49:15,804 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:49:15,804 INFO L139 ounterexampleChecker]: Examining path program with hash 847947517, occurence #1 [2025-04-14 15:49:15,804 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:49:15,804 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:49:15,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:49:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1943639091, now seen corresponding path program 1 times [2025-04-14 15:49:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:49:15,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718989688] [2025-04-14 15:49:15,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:15,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:49:15,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 15:49:15,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 15:49:15,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:15,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 15:49:15,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:49:15,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718989688] [2025-04-14 15:49:15,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718989688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:49:15,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:49:15,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 15:49:15,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207048132] [2025-04-14 15:49:15,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:49:15,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 15:49:15,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:49:15,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 15:49:15,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 15:49:15,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:15,897 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:49:15,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 15:49:15,897 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:49:15,897 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:15,897 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 15:49:15,897 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:16,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:49:16,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:16,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 15:49:16,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:16,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 15:49:16,002 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 1 more)] === [2025-04-14 15:49:16,002 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:49:16,002 INFO L139 ounterexampleChecker]: Examining path program with hash 847947517, occurence #2 [2025-04-14 15:49:16,002 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:49:16,002 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 15:49:16,002 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:16,002 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 15:49:16,002 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:49:16,002 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-14 15:49:16,002 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:49:16,002 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 15:49:16,002 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:49:16,002 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-14 15:49:16,002 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:16,003 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-14 15:49:16,003 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:16,003 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-14 15:49:16,003 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:16,003 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-14 15:49:16,003 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:16,003 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-04-14 15:49:16,003 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:49:16,003 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2025-04-14 15:49:16,003 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:16,003 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:49:16,003 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:49:16,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:49:16,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1641752140, now seen corresponding path program 1 times [2025-04-14 15:49:16,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:49:16,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972564403] [2025-04-14 15:49:16,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:16,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:49:16,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 15:49:16,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 15:49:16,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:16,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 15:49:16,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:49:16,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972564403] [2025-04-14 15:49:16,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972564403] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:49:16,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:49:16,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 15:49:16,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421091379] [2025-04-14 15:49:16,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:49:16,091 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 15:49:16,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:49:16,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 15:49:16,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 15:49:16,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:16,091 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:49:16,091 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 15:49:16,091 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:49:16,092 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:16,092 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 15:49:16,092 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:16,092 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:16,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:49:16,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:16,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 15:49:16,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:16,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:16,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 15:49:16,173 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 1 more)] === [2025-04-14 15:49:16,173 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:49:16,173 INFO L139 ounterexampleChecker]: Examining path program with hash 847947517, occurence #3 [2025-04-14 15:49:16,173 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:49:16,173 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 15:49:16,174 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:16,174 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 15:49:16,174 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:49:16,174 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-14 15:49:16,174 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:49:16,174 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-14 15:49:16,174 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:49:16,174 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-14 15:49:16,174 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:16,174 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-14 15:49:16,174 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:16,174 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-14 15:49:16,174 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:16,174 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2025-04-14 15:49:16,174 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:16,174 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2025-04-14 15:49:16,174 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:49:16,174 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 32 [2025-04-14 15:49:16,174 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:49:16,174 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:49:16,174 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:49:16,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:49:16,175 INFO L85 PathProgramCache]: Analyzing trace with hash 301587921, now seen corresponding path program 1 times [2025-04-14 15:49:16,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:49:16,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689747454] [2025-04-14 15:49:16,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:16,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:49:16,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 15:49:16,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 15:49:16,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:16,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 15:49:16,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:49:16,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689747454] [2025-04-14 15:49:16,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689747454] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:49:16,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811155037] [2025-04-14 15:49:16,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:16,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:49:16,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:49:16,320 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 15:49:16,321 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 15:49:16,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 15:49:16,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 15:49:16,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:16,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:16,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 15:49:16,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:49:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 15:49:16,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:49:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 15:49:16,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811155037] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 15:49:16,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 15:49:16,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-14 15:49:16,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577978120] [2025-04-14 15:49:16,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:49:16,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 15:49:16,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:49:16,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 15:49:16,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-14 15:49:16,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:16,561 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:49:16,561 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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 15:49:16,561 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:49:16,561 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:16,561 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 15:49:16,561 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:16,561 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:16,561 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:16,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:49:16,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:16,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 15:49:16,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:16,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:16,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:16,704 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 15:49:16,898 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:49:16,898 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 1 more)] === [2025-04-14 15:49:16,899 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:49:16,899 INFO L139 ounterexampleChecker]: Examining path program with hash -888822574, occurence #1 [2025-04-14 15:49:16,899 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:49:16,899 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:49:16,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:49:16,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2050206762, now seen corresponding path program 1 times [2025-04-14 15:49:16,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:49:16,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292161544] [2025-04-14 15:49:16,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:16,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:49:16,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 15:49:16,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 15:49:16,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:16,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 15:49:17,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:49:17,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292161544] [2025-04-14 15:49:17,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292161544] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:49:17,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537993131] [2025-04-14 15:49:17,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:17,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:49:17,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:49:17,028 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 15:49:17,029 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 15:49:17,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 15:49:17,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 15:49:17,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:17,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:17,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 15:49:17,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:49:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 15:49:17,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:49:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 15:49:17,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537993131] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 15:49:17,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 15:49:17,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-14 15:49:17,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550673010] [2025-04-14 15:49:17,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:49:17,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 15:49:17,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:49:17,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 15:49:17,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-04-14 15:49:17,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:17,260 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:49:17,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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 15:49:17,260 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:49:17,260 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:17,260 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 15:49:17,260 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:17,260 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:17,260 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:17,260 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:17,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:17,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:17,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 15:49:17,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:17,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:17,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:17,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:17,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 15:49:17,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:49:17,734 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 1 more)] === [2025-04-14 15:49:17,734 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:49:17,734 INFO L139 ounterexampleChecker]: Examining path program with hash -907176798, occurence #1 [2025-04-14 15:49:17,734 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:49:17,734 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:49:17,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:49:17,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1150109448, now seen corresponding path program 1 times [2025-04-14 15:49:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:49:17,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656450034] [2025-04-14 15:49:17,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:49:17,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 15:49:17,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 15:49:17,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:17,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 15:49:17,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:49:17,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656450034] [2025-04-14 15:49:17,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656450034] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:49:17,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766545488] [2025-04-14 15:49:17,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:17,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:49:17,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:49:17,854 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 15:49:17,855 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 15:49:17,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 15:49:17,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 15:49:17,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:17,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:17,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 15:49:17,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:49:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 15:49:18,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:49:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 15:49:18,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766545488] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 15:49:18,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 15:49:18,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2025-04-14 15:49:18,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931346921] [2025-04-14 15:49:18,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:49:18,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 15:49:18,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:49:18,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 15:49:18,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-04-14 15:49:18,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:18,117 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:49:18,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 15:49:18,117 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:18,117 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:18,117 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-14 15:49:18,117 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:18,117 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:18,117 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:18,117 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:18,117 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:18,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:18,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:18,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 15:49:18,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:18,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:18,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:18,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:18,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:18,235 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 15:49:18,429 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:49:18,429 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 1 more)] === [2025-04-14 15:49:18,429 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:49:18,429 INFO L139 ounterexampleChecker]: Examining path program with hash -1989514031, occurence #1 [2025-04-14 15:49:18,429 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:49:18,429 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:49:18,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:49:18,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2084502514, now seen corresponding path program 1 times [2025-04-14 15:49:18,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:49:18,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277216656] [2025-04-14 15:49:18,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:49:18,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 15:49:18,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 15:49:18,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:18,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 15:49:18,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:49:18,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277216656] [2025-04-14 15:49:18,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277216656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:49:18,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:49:18,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 15:49:18,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364424061] [2025-04-14 15:49:18,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:49:18,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 15:49:18,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:49:18,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 15:49:18,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 15:49:18,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:18,566 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:49:18,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:49:18,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:18,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:18,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-14 15:49:18,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:18,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:18,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:18,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:18,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:18,567 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:49:18,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:18,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:49:18,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 15:49:18,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:18,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:18,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:18,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:18,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 15:49:18,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:49:18,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 15:49:18,675 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 1 more)] === [2025-04-14 15:49:18,675 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:49:18,675 INFO L139 ounterexampleChecker]: Examining path program with hash 313631775, occurence #1 [2025-04-14 15:49:18,675 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:49:18,675 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:49:18,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:49:18,676 INFO L85 PathProgramCache]: Analyzing trace with hash 373923943, now seen corresponding path program 1 times [2025-04-14 15:49:18,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:49:18,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476566364] [2025-04-14 15:49:18,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:18,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:49:18,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 15:49:18,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 15:49:18,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:18,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 15:49:19,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:49:19,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476566364] [2025-04-14 15:49:19,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476566364] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:49:19,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73315169] [2025-04-14 15:49:19,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:49:19,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:49:19,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:49:19,676 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 15:49:19,678 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 15:49:19,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 15:49:19,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 15:49:19,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:49:19,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:49:19,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-14 15:49:19,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:49:20,452 INFO L325 Elim1Store]: treesize reduction 3, result has 95.9 percent of original size [2025-04-14 15:49:20,453 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 118 [2025-04-14 15:49:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:49:20,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:49:33,594 INFO L325 Elim1Store]: treesize reduction 11, result has 97.5 percent of original size [2025-04-14 15:49:33,595 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 123 treesize of output 448 [2025-04-14 15:51:38,867 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-14 15:51:38,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-14 15:51:38,868 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-14 15:51:38,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 15:51:39,068 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:51:39,074 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 15:51:39,075 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:320) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2025-04-14 15:51:39,079 INFO L158 Benchmark]: Toolchain (without parser) took 150433.92ms. Allocated memory was 155.2MB in the beginning and 939.5MB in the end (delta: 784.3MB). Free memory was 109.4MB in the beginning and 624.7MB in the end (delta: -515.4MB). Peak memory consumption was 578.5MB. Max. memory is 8.0GB. [2025-04-14 15:51:39,080 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 15:51:39,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.91ms. Allocated memory is still 155.2MB. Free memory was 109.4MB in the beginning and 93.5MB in the end (delta: 15.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 15:51:39,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.28ms. Allocated memory is still 155.2MB. Free memory was 93.5MB in the beginning and 91.4MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 15:51:39,080 INFO L158 Benchmark]: Boogie Preprocessor took 18.02ms. Allocated memory is still 155.2MB. Free memory was 91.4MB in the beginning and 89.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 15:51:39,080 INFO L158 Benchmark]: IcfgBuilder took 615.84ms. Allocated memory is still 155.2MB. Free memory was 89.8MB in the beginning and 106.5MB in the end (delta: -16.7MB). Peak memory consumption was 74.6MB. Max. memory is 8.0GB. [2025-04-14 15:51:39,080 INFO L158 Benchmark]: TraceAbstraction took 149514.10ms. Allocated memory was 155.2MB in the beginning and 939.5MB in the end (delta: 784.3MB). Free memory was 105.7MB in the beginning and 624.7MB in the end (delta: -519.1MB). Peak memory consumption was 575.2MB. Max. memory is 8.0GB. [2025-04-14 15:51:39,081 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.14ms. Allocated memory is still 155.2MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.91ms. Allocated memory is still 155.2MB. Free memory was 109.4MB in the beginning and 93.5MB in the end (delta: 15.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.28ms. Allocated memory is still 155.2MB. Free memory was 93.5MB in the beginning and 91.4MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.02ms. Allocated memory is still 155.2MB. Free memory was 91.4MB in the beginning and 89.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 615.84ms. Allocated memory is still 155.2MB. Free memory was 89.8MB in the beginning and 106.5MB in the end (delta: -16.7MB). Peak memory consumption was 74.6MB. Max. memory is 8.0GB. * TraceAbstraction took 149514.10ms. Allocated memory was 155.2MB in the beginning and 939.5MB in the end (delta: 784.3MB). Free memory was 105.7MB in the beginning and 624.7MB in the end (delta: -519.1MB). Peak memory consumption was 575.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...