/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:42:27,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:42:27,714 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 22:42:27,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:42:27,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:42:27,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:42:27,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:42:27,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:42:27,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:42:27,739 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:42:27,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:42:27,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:42:27,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:42:27,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:42:27,741 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:42:27,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:42:27,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:42:27,741 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:42:27,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:42:27,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:42:27,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:42:27,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:42:27,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:42:27,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:42:27,741 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:42:27,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:42:27,742 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:42:27,742 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:42:27,742 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:42:27,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:42:27,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:42:27,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:42:27,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:42:27,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:42:27,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:42:27,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:42:27,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:42:27,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:42:27,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:42:27,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:42:27,743 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:42:27,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:42:27,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:42:27,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:42:27,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:42:27,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:42:27,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:42:27,743 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:42:27,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:42:27,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:42:27,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:42:27,977 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:42:27,979 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:42:27,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2025-04-13 22:42:29,198 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80f654b55/16eaa5f8c8c84ebf94fa3f0702324d33/FLAGa9950ef93 [2025-04-13 22:42:29,392 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:42:29,392 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2025-04-13 22:42:29,418 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80f654b55/16eaa5f8c8c84ebf94fa3f0702324d33/FLAGa9950ef93 [2025-04-13 22:42:30,249 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80f654b55/16eaa5f8c8c84ebf94fa3f0702324d33 [2025-04-13 22:42:30,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:42:30,252 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:42:30,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:42:30,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:42:30,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:42:30,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:42:30" (1/1) ... [2025-04-13 22:42:30,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692e560c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30, skipping insertion in model container [2025-04-13 22:42:30,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:42:30" (1/1) ... [2025-04-13 22:42:30,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:42:30,429 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/popl20-bad-counter-queue.wvr.c[2142,2155] [2025-04-13 22:42:30,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:42:30,448 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:42:30,475 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/popl20-bad-counter-queue.wvr.c[2142,2155] [2025-04-13 22:42:30,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:42:30,499 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:42:30,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30 WrapperNode [2025-04-13 22:42:30,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:42:30,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:42:30,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:42:30,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:42:30,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30" (1/1) ... [2025-04-13 22:42:30,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30" (1/1) ... [2025-04-13 22:42:30,535 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 125 [2025-04-13 22:42:30,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:42:30,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:42:30,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:42:30,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:42:30,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30" (1/1) ... [2025-04-13 22:42:30,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30" (1/1) ... [2025-04-13 22:42:30,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30" (1/1) ... [2025-04-13 22:42:30,566 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 22:42:30,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30" (1/1) ... [2025-04-13 22:42:30,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30" (1/1) ... [2025-04-13 22:42:30,573 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30" (1/1) ... [2025-04-13 22:42:30,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30" (1/1) ... [2025-04-13 22:42:30,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30" (1/1) ... [2025-04-13 22:42:30,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30" (1/1) ... [2025-04-13 22:42:30,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:42:30,578 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:42:30,579 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:42:30,579 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:42:30,579 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30" (1/1) ... [2025-04-13 22:42:30,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:42:30,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:30,601 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-13 22:42:30,605 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-13 22:42:30,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:42:30,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:42:30,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:42:30,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:42:30,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:42:30,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:42:30,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:42:30,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:42:30,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:42:30,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:42:30,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:42:30,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:42:30,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:42:30,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:42:30,619 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:42:30,687 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:42:30,689 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:42:30,872 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:42:30,873 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:42:30,873 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:42:31,055 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:42:31,059 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:42:31,065 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:42:31,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:42:31 BoogieIcfgContainer [2025-04-13 22:42:31,066 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:42:31,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:42:31,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:42:31,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:42:31,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:42:30" (1/3) ... [2025-04-13 22:42:31,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24969651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:42:31, skipping insertion in model container [2025-04-13 22:42:31,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:42:30" (2/3) ... [2025-04-13 22:42:31,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24969651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:42:31, skipping insertion in model container [2025-04-13 22:42:31,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:42:31" (3/3) ... [2025-04-13 22:42:31,072 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-04-13 22:42:31,082 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:42:31,083 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 19 locations, 21 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 22:42:31,083 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:42:31,145 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 22:42:31,169 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 23 transitions, 60 flow [2025-04-13 22:42:31,183 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 49 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 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-13 22:42:31,204 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:42:31,214 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=FINITE_AUTOMATA, 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;@226daae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:42:31,214 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 22:42:31,216 INFO L278 IsEmpty]: Start isEmpty. Operand has 49 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 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-13 22:42:31,222 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 22:42:31,222 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:31,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:31,223 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:42:31,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:31,228 INFO L85 PathProgramCache]: Analyzing trace with hash 188298092, now seen corresponding path program 1 times [2025-04-13 22:42:31,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:31,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077786223] [2025-04-13 22:42:31,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:42:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:31,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 22:42:31,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 22:42:31,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:42:31,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:31,428 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-13 22:42:31,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:31,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077786223] [2025-04-13 22:42:31,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077786223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:42:31,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:42:31,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 22:42:31,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633791411] [2025-04-13 22:42:31,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:42:31,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:42:31,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:31,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:42:31,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:42:31,451 INFO L87 Difference]: Start difference. First operand has 49 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 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) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-13 22:42:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:31,507 INFO L93 Difference]: Finished difference Result 74 states and 179 transitions. [2025-04-13 22:42:31,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:42:31,509 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) Word has length 11 [2025-04-13 22:42:31,510 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:31,514 INFO L225 Difference]: With dead ends: 74 [2025-04-13 22:42:31,515 INFO L226 Difference]: Without dead ends: 69 [2025-04-13 22:42:31,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:42:31,518 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:31,518 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:42:31,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-13 22:42:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2025-04-13 22:42:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 2.5272727272727273) internal successors, (139), 55 states have internal predecessors, (139), 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-13 22:42:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 139 transitions. [2025-04-13 22:42:31,553 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 139 transitions. Word has length 11 [2025-04-13 22:42:31,554 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:31,554 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 139 transitions. [2025-04-13 22:42:31,554 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-13 22:42:31,555 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 139 transitions. [2025-04-13 22:42:31,556 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 22:42:31,556 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:31,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:31,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:42:31,556 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:42:31,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:31,557 INFO L85 PathProgramCache]: Analyzing trace with hash -236977720, now seen corresponding path program 1 times [2025-04-13 22:42:31,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:31,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410341296] [2025-04-13 22:42:31,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:42:31,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:31,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 22:42:31,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 22:42:31,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:42:31,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:31,650 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-13 22:42:31,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:31,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410341296] [2025-04-13 22:42:31,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410341296] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:42:31,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:42:31,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:42:31,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789429458] [2025-04-13 22:42:31,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:42:31,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:42:31,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:31,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:42:31,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:42:31,652 INFO L87 Difference]: Start difference. First operand 56 states and 139 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-13 22:42:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:31,699 INFO L93 Difference]: Finished difference Result 71 states and 164 transitions. [2025-04-13 22:42:31,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:42:31,699 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2025-04-13 22:42:31,700 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:31,700 INFO L225 Difference]: With dead ends: 71 [2025-04-13 22:42:31,700 INFO L226 Difference]: Without dead ends: 56 [2025-04-13 22:42:31,700 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:42:31,701 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:31,701 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:42:31,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-13 22:42:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2025-04-13 22:42:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 2.4166666666666665) internal successors, (116), 48 states have internal predecessors, (116), 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-13 22:42:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 116 transitions. [2025-04-13 22:42:31,707 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 116 transitions. Word has length 13 [2025-04-13 22:42:31,707 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:31,707 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 116 transitions. [2025-04-13 22:42:31,707 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-13 22:42:31,707 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 116 transitions. [2025-04-13 22:42:31,707 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 22:42:31,707 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:31,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:31,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:42:31,708 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:42:31,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:31,708 INFO L85 PathProgramCache]: Analyzing trace with hash 896469696, now seen corresponding path program 2 times [2025-04-13 22:42:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:31,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759766267] [2025-04-13 22:42:31,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:42:31,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:31,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-04-13 22:42:31,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 22:42:31,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:42:31,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:31,776 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-13 22:42:31,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:31,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759766267] [2025-04-13 22:42:31,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759766267] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:42:31,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:42:31,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:42:31,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876580280] [2025-04-13 22:42:31,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:42:31,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:42:31,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:31,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:42:31,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:42:31,778 INFO L87 Difference]: Start difference. First operand 49 states and 116 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-13 22:42:31,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:31,825 INFO L93 Difference]: Finished difference Result 71 states and 151 transitions. [2025-04-13 22:42:31,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:42:31,826 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2025-04-13 22:42:31,826 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:31,826 INFO L225 Difference]: With dead ends: 71 [2025-04-13 22:42:31,826 INFO L226 Difference]: Without dead ends: 49 [2025-04-13 22:42:31,827 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:42:31,827 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:31,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:42:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-13 22:42:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-04-13 22:42:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 2.2916666666666665) internal successors, (110), 48 states have internal predecessors, (110), 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-13 22:42:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 110 transitions. [2025-04-13 22:42:31,832 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 110 transitions. Word has length 13 [2025-04-13 22:42:31,833 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:31,833 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 110 transitions. [2025-04-13 22:42:31,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-13 22:42:31,833 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 110 transitions. [2025-04-13 22:42:31,833 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 22:42:31,833 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:31,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:31,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:42:31,833 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:42:31,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:31,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1220941256, now seen corresponding path program 1 times [2025-04-13 22:42:31,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:31,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348211550] [2025-04-13 22:42:31,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:42:31,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:31,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 22:42:31,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 22:42:31,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:42:31,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:31,954 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-13 22:42:31,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:31,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348211550] [2025-04-13 22:42:31,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348211550] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:42:31,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:42:31,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:42:31,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559397767] [2025-04-13 22:42:31,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:42:31,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:42:31,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:31,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:42:31,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:42:31,956 INFO L87 Difference]: Start difference. First operand 49 states and 110 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-13 22:42:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:32,006 INFO L93 Difference]: Finished difference Result 97 states and 219 transitions. [2025-04-13 22:42:32,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:42:32,006 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2025-04-13 22:42:32,007 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:32,007 INFO L225 Difference]: With dead ends: 97 [2025-04-13 22:42:32,007 INFO L226 Difference]: Without dead ends: 50 [2025-04-13 22:42:32,007 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:42:32,008 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:32,008 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:42:32,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-13 22:42:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-04-13 22:42:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.2653061224489797) internal successors, (111), 49 states have internal predecessors, (111), 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-13 22:42:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 111 transitions. [2025-04-13 22:42:32,014 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 111 transitions. Word has length 15 [2025-04-13 22:42:32,014 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:32,014 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 111 transitions. [2025-04-13 22:42:32,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-13 22:42:32,014 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 111 transitions. [2025-04-13 22:42:32,015 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:42:32,015 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:32,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:32,015 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:42:32,015 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:42:32,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash -404302717, now seen corresponding path program 1 times [2025-04-13 22:42:32,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:32,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169316368] [2025-04-13 22:42:32,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:42:32,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:32,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 22:42:32,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:42:32,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:42:32,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:32,516 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-13 22:42:32,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:32,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169316368] [2025-04-13 22:42:32,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169316368] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:32,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61306384] [2025-04-13 22:42:32,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:42:32,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:32,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:32,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:42:32,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 22:42:32,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 22:42:32,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:42:32,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:42:32,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:32,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:42:32,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:32,645 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-13 22:42:32,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:42:32,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61306384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:42:32,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:42:32,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-04-13 22:42:32,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150172262] [2025-04-13 22:42:32,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:42:32,646 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:42:32,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:32,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:42:32,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:42:32,646 INFO L87 Difference]: Start difference. First operand 50 states and 111 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-13 22:42:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:32,840 INFO L93 Difference]: Finished difference Result 156 states and 380 transitions. [2025-04-13 22:42:32,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:42:32,841 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) Word has length 16 [2025-04-13 22:42:32,841 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:32,842 INFO L225 Difference]: With dead ends: 156 [2025-04-13 22:42:32,842 INFO L226 Difference]: Without dead ends: 151 [2025-04-13 22:42:32,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:42:32,843 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:32,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:42:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-04-13 22:42:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 81. [2025-04-13 22:42:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 2.2875) internal successors, (183), 80 states have internal predecessors, (183), 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-13 22:42:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 183 transitions. [2025-04-13 22:42:32,853 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 183 transitions. Word has length 16 [2025-04-13 22:42:32,853 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:32,853 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 183 transitions. [2025-04-13 22:42:32,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-13 22:42:32,853 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 183 transitions. [2025-04-13 22:42:32,853 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:42:32,854 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:32,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:32,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 22:42:33,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:33,057 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:42:33,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:33,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1572007099, now seen corresponding path program 2 times [2025-04-13 22:42:33,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:33,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160355275] [2025-04-13 22:42:33,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:42:33,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:33,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 22:42:33,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:42:33,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:42:33,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 22:42:33,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 22:42:33,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 22:42:33,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:42:33,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:42:33,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 22:42:33,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 22:42:33,113 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 22:42:33,114 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 22:42:33,115 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 22:42:33,115 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 22:42:33,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:42:33,120 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-04-13 22:42:33,164 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:42:33,164 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:42:33,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:42:33 BasicIcfg [2025-04-13 22:42:33,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:42:33,167 INFO L158 Benchmark]: Toolchain (without parser) took 2914.87ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 58.4MB in the end (delta: 42.4MB). Peak memory consumption was 42.0MB. Max. memory is 8.0GB. [2025-04-13 22:42:33,167 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:42:33,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.00ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 85.7MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 22:42:33,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.13ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 84.2MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:42:33,167 INFO L158 Benchmark]: Boogie Preprocessor took 41.72ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:42:33,168 INFO L158 Benchmark]: IcfgBuilder took 487.67ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 33.3MB in the end (delta: 48.8MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-13 22:42:33,169 INFO L158 Benchmark]: TraceAbstraction took 2098.89ms. Allocated memory is still 142.6MB. Free memory was 32.8MB in the beginning and 58.4MB in the end (delta: -25.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:42:33,170 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.18ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.00ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 85.7MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.13ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 84.2MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.72ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 487.67ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 33.3MB in the end (delta: 48.8MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 2098.89ms. Allocated memory is still 142.6MB. Free memory was 32.8MB in the beginning and 58.4MB in the end (delta: -25.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 78]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=1, \at(size, Pre)=1, arr={-3:0}, counter=0, i=0, size=1] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=1, \at(size, Pre)=1, arr={-3:0}, counter=0, i=1, size=1] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-3:0}, N=1, counter=0, t1=-2] [L48] 1 int i=0; [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-3:0}, N=1, counter=0, t1=-2, t2=-1] [L57] 2 int i=0; [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-3:0}, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=1, i=0, tmp=1] [L48] 1 i++ [L48] COND FALSE 1 !(i