/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/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:49:11,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:49:11,933 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 21:49:11,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:49:11,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:49:11,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:49:11,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:49:11,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:49:11,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:49:11,959 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:49:11,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:49:11,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:49:11,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:49:11,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:49:11,960 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:49:11,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:49:11,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:49:11,961 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:49:11,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:49:11,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:49:11,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:49:11,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:49:11,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:49:11,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:49:11,961 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:49:11,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:49:11,961 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:49:11,961 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:49:11,961 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:49:11,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:49:11,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:49:11,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:49:11,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:49:11,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:49:11,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:49:11,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:49:11,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:49:11,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:49:11,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:49:11,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:49:11,962 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:49:11,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:49:11,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:49:11,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:49:11,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:49:11,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:49:11,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:49:11,963 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 21:49:12,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:49:12,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:49:12,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:49:12,183 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:49:12,185 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:49:12,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-13 21:49:13,480 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c149e959c/1ea1a24aed7a45beac6f67b4f072fd04/FLAG03f0be769 [2025-04-13 21:49:13,736 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:49:13,738 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-13 21:49:13,753 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c149e959c/1ea1a24aed7a45beac6f67b4f072fd04/FLAG03f0be769 [2025-04-13 21:49:14,531 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c149e959c/1ea1a24aed7a45beac6f67b4f072fd04 [2025-04-13 21:49:14,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:49:14,534 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:49:14,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:49:14,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:49:14,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:49:14,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:49:14" (1/1) ... [2025-04-13 21:49:14,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647543c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:14, skipping insertion in model container [2025-04-13 21:49:14,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:49:14" (1/1) ... [2025-04-13 21:49:14,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:49:14,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2025-04-13 21:49:14,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:49:14,909 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:49:14,935 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2025-04-13 21:49:14,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:49:15,013 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:49:15,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:15 WrapperNode [2025-04-13 21:49:15,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:49:15,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:49:15,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:49:15,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:49:15,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:15" (1/1) ... [2025-04-13 21:49:15,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:15" (1/1) ... [2025-04-13 21:49:15,049 INFO L138 Inliner]: procedures = 176, calls = 46, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2025-04-13 21:49:15,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:49:15,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:49:15,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:49:15,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:49:15,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:15" (1/1) ... [2025-04-13 21:49:15,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:15" (1/1) ... [2025-04-13 21:49:15,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:15" (1/1) ... [2025-04-13 21:49:15,068 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 21:49:15,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:15" (1/1) ... [2025-04-13 21:49:15,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:15" (1/1) ... [2025-04-13 21:49:15,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:15" (1/1) ... [2025-04-13 21:49:15,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:15" (1/1) ... [2025-04-13 21:49:15,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:15" (1/1) ... [2025-04-13 21:49:15,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:15" (1/1) ... [2025-04-13 21:49:15,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:49:15,076 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:49:15,076 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:49:15,077 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:49:15,077 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:15" (1/1) ... [2025-04-13 21:49:15,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:49:15,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:49:15,104 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 21:49:15,106 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 21:49:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:49:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:49:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 21:49:15,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 21:49:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 21:49:15,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 21:49:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 21:49:15,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 21:49:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-13 21:49:15,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-13 21:49:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:49:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:49:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:49:15,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:49:15,123 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 21:49:15,222 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:49:15,224 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:49:15,348 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:49:15,349 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:49:15,349 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:49:15,436 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:49:15,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:49:15 BoogieIcfgContainer [2025-04-13 21:49:15,436 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:49:15,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:49:15,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:49:15,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:49:15,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:49:14" (1/3) ... [2025-04-13 21:49:15,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ee5ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:49:15, skipping insertion in model container [2025-04-13 21:49:15,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:49:15" (2/3) ... [2025-04-13 21:49:15,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ee5ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:49:15, skipping insertion in model container [2025-04-13 21:49:15,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:49:15" (3/3) ... [2025-04-13 21:49:15,444 INFO L128 eAbstractionObserver]: Analyzing ICFG safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-13 21:49:15,455 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:49:15,456 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i that has 5 procedures, 42 locations, 37 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 21:49:15,456 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:49:15,499 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:49:15,527 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 41 transitions, 98 flow [2025-04-13 21:49:16,011 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13036 states, 13035 states have (on average 4.194246260069045) internal successors, (54672), 13035 states have internal predecessors, (54672), 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 21:49:16,039 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:49:16,049 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;@1ae85f01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:49:16,049 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 21:49:16,089 INFO L278 IsEmpty]: Start isEmpty. Operand has 13036 states, 13035 states have (on average 4.194246260069045) internal successors, (54672), 13035 states have internal predecessors, (54672), 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 21:49:16,110 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 21:49:16,110 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:49:16,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:49:16,111 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:49:16,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:49:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1819042727, now seen corresponding path program 1 times [2025-04-13 21:49:16,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:49:16,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093512104] [2025-04-13 21:49:16,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:49:16,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:49:16,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:49:16,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:49:16,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:49:16,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:49:16,568 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 21:49:16,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:49:16,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093512104] [2025-04-13 21:49:16,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093512104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:49:16,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:49:16,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:49:16,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316879997] [2025-04-13 21:49:16,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:49:16,577 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:49:16,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:49:16,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:49:16,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:49:16,625 INFO L87 Difference]: Start difference. First operand has 13036 states, 13035 states have (on average 4.194246260069045) internal successors, (54672), 13035 states have internal predecessors, (54672), 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 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 21:49:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:49:17,135 INFO L93 Difference]: Finished difference Result 15556 states and 64308 transitions. [2025-04-13 21:49:17,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:49:17,138 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2025-04-13 21:49:17,138 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:49:17,270 INFO L225 Difference]: With dead ends: 15556 [2025-04-13 21:49:17,272 INFO L226 Difference]: Without dead ends: 12028 [2025-04-13 21:49:17,293 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:49:17,298 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 56 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:49:17,298 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 18 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:49:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12028 states. [2025-04-13 21:49:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12028 to 12028. [2025-04-13 21:49:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12028 states, 12027 states have (on average 4.166625093539536) internal successors, (50112), 12027 states have internal predecessors, (50112), 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 21:49:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12028 states to 12028 states and 50112 transitions. [2025-04-13 21:49:17,947 INFO L79 Accepts]: Start accepts. Automaton has 12028 states and 50112 transitions. Word has length 14 [2025-04-13 21:49:17,948 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:49:17,948 INFO L485 AbstractCegarLoop]: Abstraction has 12028 states and 50112 transitions. [2025-04-13 21:49:17,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 21:49:17,949 INFO L278 IsEmpty]: Start isEmpty. Operand 12028 states and 50112 transitions. [2025-04-13 21:49:17,957 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 21:49:17,957 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:49:17,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:49:17,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:49:17,957 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:49:17,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:49:17,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1449268696, now seen corresponding path program 1 times [2025-04-13 21:49:17,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:49:17,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040175254] [2025-04-13 21:49:17,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:49:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:49:17,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 21:49:17,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:49:17,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:49:17,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:49:18,250 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 21:49:18,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:49:18,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040175254] [2025-04-13 21:49:18,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040175254] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:49:18,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:49:18,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:49:18,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528305583] [2025-04-13 21:49:18,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:49:18,252 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:49:18,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:49:18,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:49:18,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:49:18,252 INFO L87 Difference]: Start difference. First operand 12028 states and 50112 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 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 21:49:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:49:18,808 INFO L93 Difference]: Finished difference Result 23148 states and 94972 transitions. [2025-04-13 21:49:18,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:49:18,813 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 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 21:49:18,813 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:49:19,000 INFO L225 Difference]: With dead ends: 23148 [2025-04-13 21:49:19,000 INFO L226 Difference]: Without dead ends: 17780 [2025-04-13 21:49:19,013 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:49:19,014 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 94 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:49:19,014 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 25 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:49:19,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17780 states. [2025-04-13 21:49:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17780 to 14644. [2025-04-13 21:49:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14644 states, 14643 states have (on average 4.080311411595985) internal successors, (59748), 14643 states have internal predecessors, (59748), 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 21:49:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14644 states to 14644 states and 59748 transitions. [2025-04-13 21:49:19,861 INFO L79 Accepts]: Start accepts. Automaton has 14644 states and 59748 transitions. Word has length 16 [2025-04-13 21:49:19,862 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:49:19,862 INFO L485 AbstractCegarLoop]: Abstraction has 14644 states and 59748 transitions. [2025-04-13 21:49:19,862 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 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 21:49:19,862 INFO L278 IsEmpty]: Start isEmpty. Operand 14644 states and 59748 transitions. [2025-04-13 21:49:19,876 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 21:49:19,876 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:49:19,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:49:19,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:49:19,878 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:49:19,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:49:19,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1106183305, now seen corresponding path program 1 times [2025-04-13 21:49:19,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:49:19,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75666303] [2025-04-13 21:49:19,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:49:19,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:49:19,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:49:19,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:49:19,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:49:19,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:49:20,035 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 21:49:20,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:49:20,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75666303] [2025-04-13 21:49:20,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75666303] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:49:20,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:49:20,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:49:20,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439887069] [2025-04-13 21:49:20,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:49:20,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:49:20,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:49:20,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:49:20,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:49:20,036 INFO L87 Difference]: Start difference. First operand 14644 states and 59748 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 21:49:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:49:20,326 INFO L93 Difference]: Finished difference Result 15844 states and 64168 transitions. [2025-04-13 21:49:20,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:49:20,328 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2025-04-13 21:49:20,328 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:49:20,431 INFO L225 Difference]: With dead ends: 15844 [2025-04-13 21:49:20,431 INFO L226 Difference]: Without dead ends: 14164 [2025-04-13 21:49:20,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:49:20,446 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 44 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:49:20,447 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 14 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:49:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14164 states. [2025-04-13 21:49:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14164 to 13204. [2025-04-13 21:49:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13204 states, 13203 states have (on average 4.065439672801636) internal successors, (53676), 13203 states have internal predecessors, (53676), 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 21:49:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13204 states to 13204 states and 53676 transitions. [2025-04-13 21:49:20,937 INFO L79 Accepts]: Start accepts. Automaton has 13204 states and 53676 transitions. Word has length 18 [2025-04-13 21:49:20,937 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:49:20,937 INFO L485 AbstractCegarLoop]: Abstraction has 13204 states and 53676 transitions. [2025-04-13 21:49:20,938 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 21:49:20,938 INFO L278 IsEmpty]: Start isEmpty. Operand 13204 states and 53676 transitions. [2025-04-13 21:49:20,949 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:49:20,949 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:49:20,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:49:20,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:49:20,950 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:49:20,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:49:20,950 INFO L85 PathProgramCache]: Analyzing trace with hash -413650950, now seen corresponding path program 1 times [2025-04-13 21:49:20,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:49:20,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831668413] [2025-04-13 21:49:20,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:49:20,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:49:20,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:49:20,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:49:20,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:49:20,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:49:21,089 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 21:49:21,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:49:21,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831668413] [2025-04-13 21:49:21,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831668413] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:49:21,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:49:21,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:49:21,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193519922] [2025-04-13 21:49:21,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:49:21,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:49:21,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:49:21,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:49:21,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:49:21,090 INFO L87 Difference]: Start difference. First operand 13204 states and 53676 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 21:49:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:49:21,567 INFO L93 Difference]: Finished difference Result 19252 states and 77380 transitions. [2025-04-13 21:49:21,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:49:21,571 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2025-04-13 21:49:21,571 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:49:21,675 INFO L225 Difference]: With dead ends: 19252 [2025-04-13 21:49:21,676 INFO L226 Difference]: Without dead ends: 16932 [2025-04-13 21:49:21,687 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:49:21,689 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 92 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:49:21,690 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 22 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:49:21,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16932 states. [2025-04-13 21:49:22,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16932 to 12708. [2025-04-13 21:49:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12708 states, 12707 states have (on average 4.0557173211615645) internal successors, (51536), 12707 states have internal predecessors, (51536), 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 21:49:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12708 states to 12708 states and 51536 transitions. [2025-04-13 21:49:22,222 INFO L79 Accepts]: Start accepts. Automaton has 12708 states and 51536 transitions. Word has length 19 [2025-04-13 21:49:22,223 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:49:22,223 INFO L485 AbstractCegarLoop]: Abstraction has 12708 states and 51536 transitions. [2025-04-13 21:49:22,223 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 21:49:22,224 INFO L278 IsEmpty]: Start isEmpty. Operand 12708 states and 51536 transitions. [2025-04-13 21:49:22,259 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:49:22,259 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:49:22,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:49:22,260 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:49:22,261 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:49:22,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:49:22,261 INFO L85 PathProgramCache]: Analyzing trace with hash 86476136, now seen corresponding path program 1 times [2025-04-13 21:49:22,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:49:22,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965749718] [2025-04-13 21:49:22,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:49:22,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:49:22,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 21:49:22,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:49:22,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:49:22,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:49:22,460 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 21:49:22,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:49:22,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965749718] [2025-04-13 21:49:22,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965749718] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:49:22,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:49:22,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:49:22,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074150228] [2025-04-13 21:49:22,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:49:22,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:49:22,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:49:22,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:49:22,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:49:22,462 INFO L87 Difference]: Start difference. First operand 12708 states and 51536 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 21:49:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:49:22,949 INFO L93 Difference]: Finished difference Result 20676 states and 82552 transitions. [2025-04-13 21:49:22,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:49:22,950 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2025-04-13 21:49:22,950 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:49:23,039 INFO L225 Difference]: With dead ends: 20676 [2025-04-13 21:49:23,040 INFO L226 Difference]: Without dead ends: 15524 [2025-04-13 21:49:23,058 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:49:23,059 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 84 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:49:23,059 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 23 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:49:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15524 states. [2025-04-13 21:49:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15524 to 11588. [2025-04-13 21:49:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11588 states, 11587 states have (on average 3.9858462069560714) internal successors, (46184), 11587 states have internal predecessors, (46184), 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 21:49:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11588 states to 11588 states and 46184 transitions. [2025-04-13 21:49:23,444 INFO L79 Accepts]: Start accepts. Automaton has 11588 states and 46184 transitions. Word has length 21 [2025-04-13 21:49:23,444 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:49:23,444 INFO L485 AbstractCegarLoop]: Abstraction has 11588 states and 46184 transitions. [2025-04-13 21:49:23,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 21:49:23,444 INFO L278 IsEmpty]: Start isEmpty. Operand 11588 states and 46184 transitions. [2025-04-13 21:49:23,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:49:23,460 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:49:23,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:49:23,462 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:49:23,462 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:49:23,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:49:23,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2017757323, now seen corresponding path program 1 times [2025-04-13 21:49:23,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:49:23,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034037832] [2025-04-13 21:49:23,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:49:23,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:49:23,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 21:49:23,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:49:23,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:49:23,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:49:23,647 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 21:49:23,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:49:23,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034037832] [2025-04-13 21:49:23,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034037832] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:49:23,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:49:23,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:49:23,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948046422] [2025-04-13 21:49:23,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:49:23,648 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:49:23,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:49:23,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:49:23,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:49:23,649 INFO L87 Difference]: Start difference. First operand 11588 states and 46184 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 21:49:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:49:24,129 INFO L93 Difference]: Finished difference Result 16548 states and 65432 transitions. [2025-04-13 21:49:24,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:49:24,130 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2025-04-13 21:49:24,130 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:49:24,190 INFO L225 Difference]: With dead ends: 16548 [2025-04-13 21:49:24,190 INFO L226 Difference]: Without dead ends: 11908 [2025-04-13 21:49:24,202 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:49:24,204 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 53 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:49:24,204 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 19 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:49:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11908 states. [2025-04-13 21:49:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11908 to 10308. [2025-04-13 21:49:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10308 states, 10307 states have (on average 3.953817793732415) internal successors, (40752), 10307 states have internal predecessors, (40752), 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 21:49:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10308 states to 10308 states and 40752 transitions. [2025-04-13 21:49:24,499 INFO L79 Accepts]: Start accepts. Automaton has 10308 states and 40752 transitions. Word has length 21 [2025-04-13 21:49:24,500 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:49:24,500 INFO L485 AbstractCegarLoop]: Abstraction has 10308 states and 40752 transitions. [2025-04-13 21:49:24,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 21:49:24,500 INFO L278 IsEmpty]: Start isEmpty. Operand 10308 states and 40752 transitions. [2025-04-13 21:49:24,515 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 21:49:24,515 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:49:24,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:49:24,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:49:24,516 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:49:24,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:49:24,516 INFO L85 PathProgramCache]: Analyzing trace with hash -568083255, now seen corresponding path program 1 times [2025-04-13 21:49:24,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:49:24,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117486318] [2025-04-13 21:49:24,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:49:24,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:49:24,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 21:49:24,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:49:24,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:49:24,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:49:24,728 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 21:49:24,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:49:24,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117486318] [2025-04-13 21:49:24,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117486318] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:49:24,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:49:24,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:49:24,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770277549] [2025-04-13 21:49:24,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:49:24,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:49:24,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:49:24,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:49:24,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:49:24,730 INFO L87 Difference]: Start difference. First operand 10308 states and 40752 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 21:49:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:49:24,958 INFO L93 Difference]: Finished difference Result 18316 states and 71354 transitions. [2025-04-13 21:49:24,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:49:24,958 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2025-04-13 21:49:24,959 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:49:25,006 INFO L225 Difference]: With dead ends: 18316 [2025-04-13 21:49:25,006 INFO L226 Difference]: Without dead ends: 10726 [2025-04-13 21:49:25,023 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:49:25,023 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 90 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:49:25,024 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 21 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:49:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10726 states. [2025-04-13 21:49:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10726 to 9158. [2025-04-13 21:49:25,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9158 states, 9157 states have (on average 3.915474500382221) internal successors, (35854), 9157 states have internal predecessors, (35854), 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 21:49:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9158 states to 9158 states and 35854 transitions. [2025-04-13 21:49:25,262 INFO L79 Accepts]: Start accepts. Automaton has 9158 states and 35854 transitions. Word has length 22 [2025-04-13 21:49:25,263 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:49:25,264 INFO L485 AbstractCegarLoop]: Abstraction has 9158 states and 35854 transitions. [2025-04-13 21:49:25,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 21:49:25,264 INFO L278 IsEmpty]: Start isEmpty. Operand 9158 states and 35854 transitions. [2025-04-13 21:49:25,275 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 21:49:25,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:49:25,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:49:25,276 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:49:25,276 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:49:25,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:49:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash 318001167, now seen corresponding path program 2 times [2025-04-13 21:49:25,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:49:25,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948699298] [2025-04-13 21:49:25,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:49:25,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:49:25,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-13 21:49:25,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:49:25,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:49:25,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:49:25,371 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 21:49:25,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:49:25,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948699298] [2025-04-13 21:49:25,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948699298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:49:25,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:49:25,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:49:25,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655222699] [2025-04-13 21:49:25,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:49:25,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:49:25,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:49:25,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:49:25,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:49:25,372 INFO L87 Difference]: Start difference. First operand 9158 states and 35854 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 21:49:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:49:25,523 INFO L93 Difference]: Finished difference Result 13654 states and 52512 transitions. [2025-04-13 21:49:25,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:49:25,523 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-04-13 21:49:25,523 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:49:25,575 INFO L225 Difference]: With dead ends: 13654 [2025-04-13 21:49:25,575 INFO L226 Difference]: Without dead ends: 8102 [2025-04-13 21:49:25,587 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:49:25,587 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 60 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:49:25,587 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 12 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:49:25,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8102 states. [2025-04-13 21:49:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8102 to 8102. [2025-04-13 21:49:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8102 states, 8101 states have (on average 3.8081718306381926) internal successors, (30850), 8101 states have internal predecessors, (30850), 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 21:49:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8102 states to 8102 states and 30850 transitions. [2025-04-13 21:49:25,855 INFO L79 Accepts]: Start accepts. Automaton has 8102 states and 30850 transitions. Word has length 22 [2025-04-13 21:49:25,856 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:49:25,856 INFO L485 AbstractCegarLoop]: Abstraction has 8102 states and 30850 transitions. [2025-04-13 21:49:25,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 21:49:25,856 INFO L278 IsEmpty]: Start isEmpty. Operand 8102 states and 30850 transitions. [2025-04-13 21:49:25,866 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 21:49:25,866 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:49:25,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:49:25,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:49:25,866 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:49:25,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:49:25,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1315781742, now seen corresponding path program 1 times [2025-04-13 21:49:25,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:49:25,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308426280] [2025-04-13 21:49:25,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:49:25,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:49:25,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 21:49:25,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 21:49:25,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:49:25,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:49:25,951 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 21:49:25,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:49:25,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308426280] [2025-04-13 21:49:25,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308426280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:49:25,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:49:25,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:49:25,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471581686] [2025-04-13 21:49:25,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:49:25,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:49:25,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:49:25,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:49:25,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:49:25,952 INFO L87 Difference]: Start difference. First operand 8102 states and 30850 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 21:49:26,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:49:26,115 INFO L93 Difference]: Finished difference Result 10450 states and 38934 transitions. [2025-04-13 21:49:26,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:49:26,115 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2025-04-13 21:49:26,116 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:49:26,156 INFO L225 Difference]: With dead ends: 10450 [2025-04-13 21:49:26,157 INFO L226 Difference]: Without dead ends: 5954 [2025-04-13 21:49:26,167 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:49:26,167 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 106 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:49:26,168 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 16 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:49:26,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2025-04-13 21:49:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 5954. [2025-04-13 21:49:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5954 states, 5953 states have (on average 3.635141945237695) internal successors, (21640), 5953 states have internal predecessors, (21640), 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 21:49:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5954 states to 5954 states and 21640 transitions. [2025-04-13 21:49:26,281 INFO L79 Accepts]: Start accepts. Automaton has 5954 states and 21640 transitions. Word has length 24 [2025-04-13 21:49:26,282 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:49:26,282 INFO L485 AbstractCegarLoop]: Abstraction has 5954 states and 21640 transitions. [2025-04-13 21:49:26,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 21:49:26,282 INFO L278 IsEmpty]: Start isEmpty. Operand 5954 states and 21640 transitions. [2025-04-13 21:49:26,290 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 21:49:26,291 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:49:26,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:49:26,291 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:49:26,291 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:49:26,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:49:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1566180077, now seen corresponding path program 1 times [2025-04-13 21:49:26,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:49:26,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400353300] [2025-04-13 21:49:26,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:49:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:49:26,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 21:49:26,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 21:49:26,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:49:26,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:49:26,359 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 21:49:26,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:49:26,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400353300] [2025-04-13 21:49:26,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400353300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:49:26,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:49:26,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:49:26,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391432203] [2025-04-13 21:49:26,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:49:26,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:49:26,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:49:26,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:49:26,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:49:26,360 INFO L87 Difference]: Start difference. First operand 5954 states and 21640 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 21:49:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:49:26,513 INFO L93 Difference]: Finished difference Result 6626 states and 23744 transitions. [2025-04-13 21:49:26,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:49:26,513 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2025-04-13 21:49:26,513 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:49:26,549 INFO L225 Difference]: With dead ends: 6626 [2025-04-13 21:49:26,549 INFO L226 Difference]: Without dead ends: 3990 [2025-04-13 21:49:26,555 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:49:26,556 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 154 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:49:26,556 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 20 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:49:26,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2025-04-13 21:49:26,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3990. [2025-04-13 21:49:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3990 states, 3989 states have (on average 3.539734269240411) internal successors, (14120), 3989 states have internal predecessors, (14120), 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 21:49:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 14120 transitions. [2025-04-13 21:49:26,721 INFO L79 Accepts]: Start accepts. Automaton has 3990 states and 14120 transitions. Word has length 26 [2025-04-13 21:49:26,721 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:49:26,721 INFO L485 AbstractCegarLoop]: Abstraction has 3990 states and 14120 transitions. [2025-04-13 21:49:26,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 21:49:26,721 INFO L278 IsEmpty]: Start isEmpty. Operand 3990 states and 14120 transitions. [2025-04-13 21:49:26,727 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 21:49:26,727 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:49:26,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:49:26,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 21:49:26,728 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:49:26,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:49:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash -905584513, now seen corresponding path program 1 times [2025-04-13 21:49:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:49:26,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232625747] [2025-04-13 21:49:26,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:49:26,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:49:26,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 21:49:26,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 21:49:26,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:49:26,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:49:26,800 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 21:49:26,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:49:26,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232625747] [2025-04-13 21:49:26,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232625747] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:49:26,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:49:26,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:49:26,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578952210] [2025-04-13 21:49:26,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:49:26,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:49:26,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:49:26,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:49:26,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:49:26,801 INFO L87 Difference]: Start difference. First operand 3990 states and 14120 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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 21:49:26,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:49:26,951 INFO L93 Difference]: Finished difference Result 5502 states and 19300 transitions. [2025-04-13 21:49:26,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:49:26,952 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2025-04-13 21:49:26,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:49:26,978 INFO L225 Difference]: With dead ends: 5502 [2025-04-13 21:49:26,978 INFO L226 Difference]: Without dead ends: 3286 [2025-04-13 21:49:26,983 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:49:26,983 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:49:26,983 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 30 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:49:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3286 states. [2025-04-13 21:49:27,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3286 to 3222. [2025-04-13 21:49:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3222 states, 3221 states have (on average 3.4858739521887614) internal successors, (11228), 3221 states have internal predecessors, (11228), 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 21:49:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 11228 transitions. [2025-04-13 21:49:27,043 INFO L79 Accepts]: Start accepts. Automaton has 3222 states and 11228 transitions. Word has length 29 [2025-04-13 21:49:27,043 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:49:27,043 INFO L485 AbstractCegarLoop]: Abstraction has 3222 states and 11228 transitions. [2025-04-13 21:49:27,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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 21:49:27,043 INFO L278 IsEmpty]: Start isEmpty. Operand 3222 states and 11228 transitions. [2025-04-13 21:49:27,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 21:49:27,049 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:49:27,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:49:27,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 21:49:27,050 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:49:27,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:49:27,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1951743041, now seen corresponding path program 2 times [2025-04-13 21:49:27,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:49:27,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814310840] [2025-04-13 21:49:27,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:49:27,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:49:27,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 21:49:27,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 21:49:27,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:49:27,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:49:27,126 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 21:49:27,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:49:27,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814310840] [2025-04-13 21:49:27,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814310840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:49:27,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:49:27,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:49:27,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251527393] [2025-04-13 21:49:27,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:49:27,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:49:27,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:49:27,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:49:27,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:49:27,128 INFO L87 Difference]: Start difference. First operand 3222 states and 11228 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 21:49:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:49:27,272 INFO L93 Difference]: Finished difference Result 3302 states and 11452 transitions. [2025-04-13 21:49:27,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:49:27,272 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2025-04-13 21:49:27,273 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:49:27,295 INFO L225 Difference]: With dead ends: 3302 [2025-04-13 21:49:27,296 INFO L226 Difference]: Without dead ends: 1222 [2025-04-13 21:49:27,299 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:49:27,299 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 162 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:49:27,299 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 15 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:49:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-04-13 21:49:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1222. [2025-04-13 21:49:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1221 states have (on average 3.43980343980344) internal successors, (4200), 1221 states have internal predecessors, (4200), 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 21:49:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 4200 transitions. [2025-04-13 21:49:27,326 INFO L79 Accepts]: Start accepts. Automaton has 1222 states and 4200 transitions. Word has length 29 [2025-04-13 21:49:27,326 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:49:27,326 INFO L485 AbstractCegarLoop]: Abstraction has 1222 states and 4200 transitions. [2025-04-13 21:49:27,326 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 21:49:27,326 INFO L278 IsEmpty]: Start isEmpty. Operand 1222 states and 4200 transitions. [2025-04-13 21:49:27,328 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 21:49:27,328 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:49:27,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:49:27,328 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 21:49:27,329 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:49:27,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:49:27,329 INFO L85 PathProgramCache]: Analyzing trace with hash 481386790, now seen corresponding path program 1 times [2025-04-13 21:49:27,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:49:27,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13923935] [2025-04-13 21:49:27,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:49:27,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:49:27,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 21:49:27,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 21:49:27,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:49:27,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:49:27,424 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 21:49:27,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:49:27,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13923935] [2025-04-13 21:49:27,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13923935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:49:27,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:49:27,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:49:27,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100780653] [2025-04-13 21:49:27,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:49:27,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:49:27,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:49:27,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:49:27,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:49:27,426 INFO L87 Difference]: Start difference. First operand 1222 states and 4200 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 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-13 21:49:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:49:27,487 INFO L93 Difference]: Finished difference Result 1222 states and 4200 transitions. [2025-04-13 21:49:27,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:49:27,488 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 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) Word has length 32 [2025-04-13 21:49:27,488 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:49:27,505 INFO L225 Difference]: With dead ends: 1222 [2025-04-13 21:49:27,505 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 21:49:27,507 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:49:27,507 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:49:27,507 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 9 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:49:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 21:49:27,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 21:49:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 21:49:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 21:49:27,521 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2025-04-13 21:49:27,522 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:49:27,522 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 21:49:27,522 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 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-13 21:49:27,522 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 21:49:27,522 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 21:49:27,525 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 21:49:27,526 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 21:49:27,526 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 21:49:27,526 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 21:49:27,526 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 21:49:27,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 21:49:27,528 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:49:27,530 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:49:27,530 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:49:27,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:49:27 BasicIcfg [2025-04-13 21:49:27,532 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:49:27,533 INFO L158 Benchmark]: Toolchain (without parser) took 12998.94ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 98.1MB in the beginning and 406.8MB in the end (delta: -308.8MB). Peak memory consumption was 595.3MB. Max. memory is 8.0GB. [2025-04-13 21:49:27,533 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 155.2MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:49:27,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.45ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 74.0MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:49:27,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.81ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 72.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:49:27,533 INFO L158 Benchmark]: Boogie Preprocessor took 26.10ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 70.4MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:49:27,533 INFO L158 Benchmark]: IcfgBuilder took 360.16ms. Allocated memory is still 142.6MB. Free memory was 70.4MB in the beginning and 46.3MB in the end (delta: 24.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:49:27,534 INFO L158 Benchmark]: TraceAbstraction took 12094.45ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 46.3MB in the beginning and 406.8MB in the end (delta: -360.5MB). Peak memory consumption was 545.0MB. Max. memory is 8.0GB. [2025-04-13 21:49:27,535 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.27ms. Allocated memory is still 155.2MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 478.45ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 74.0MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.81ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 72.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.10ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 70.4MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 360.16ms. Allocated memory is still 142.6MB. Free memory was 70.4MB in the beginning and 46.3MB in the end (delta: 24.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 12094.45ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 46.3MB in the beginning and 406.8MB in the end (delta: -360.5MB). Peak memory consumption was 545.0MB. 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 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 72 locations, 67 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1094 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1094 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1945 IncrementalHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 76 mSDtfsCounter, 1945 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14644occurred in iteration=2, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 15488 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 1091 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 21:49:27,550 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 0 Received shutdown request...