/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/goblint-regression/13-privatized_27-multiple-protecting2_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:52:42,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:52:42,935 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:52:42,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:52:42,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:52:42,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:52:42,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:52:42,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:52:42,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:52:42,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:52:42,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:52:42,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:52:42,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:52:42,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:52:42,969 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:52:42,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:52:42,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:52:42,970 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:52:42,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:52:42,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:52:42,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:52:42,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:52:42,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:52:42,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:52:42,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:52:42,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:52:42,971 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:52:42,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:52:42,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:52:42,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:52:42,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:52:42,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:52:42,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:52:42,971 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:52:43,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:52:43,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:52:43,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:52:43,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:52:43,187 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:52:43,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-04-13 21:52:44,504 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00643f39b/d0d78fabc379452cb17c4711e47da984/FLAG6301dd903 [2025-04-13 21:52:44,736 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:52:44,736 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-04-13 21:52:44,752 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00643f39b/d0d78fabc379452cb17c4711e47da984/FLAG6301dd903 [2025-04-13 21:52:45,706 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00643f39b/d0d78fabc379452cb17c4711e47da984 [2025-04-13 21:52:45,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:52:45,709 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:52:45,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:52:45,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:52:45,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:52:45,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:52:45" (1/1) ... [2025-04-13 21:52:45,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@169e3d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:45, skipping insertion in model container [2025-04-13 21:52:45,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:52:45" (1/1) ... [2025-04-13 21:52:45,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:52:45,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i[1097,1110] [2025-04-13 21:52:45,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:52:45,962 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:52:45,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i[1097,1110] [2025-04-13 21:52:46,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:52:46,053 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:52:46,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:46 WrapperNode [2025-04-13 21:52:46,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:52:46,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:52:46,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:52:46,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:52:46,059 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:52:46" (1/1) ... [2025-04-13 21:52:46,071 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:52:46" (1/1) ... [2025-04-13 21:52:46,089 INFO L138 Inliner]: procedures = 163, calls = 54, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 109 [2025-04-13 21:52:46,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:52:46,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:52:46,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:52:46,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:52:46,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:46" (1/1) ... [2025-04-13 21:52:46,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:46" (1/1) ... [2025-04-13 21:52:46,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:46" (1/1) ... [2025-04-13 21:52:46,122 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-04-13 21:52:46,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:46" (1/1) ... [2025-04-13 21:52:46,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:46" (1/1) ... [2025-04-13 21:52:46,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:46" (1/1) ... [2025-04-13 21:52:46,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:46" (1/1) ... [2025-04-13 21:52:46,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:46" (1/1) ... [2025-04-13 21:52:46,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:46" (1/1) ... [2025-04-13 21:52:46,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:52:46,141 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:52:46,141 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:52:46,141 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:52:46,141 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:46" (1/1) ... [2025-04-13 21:52:46,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:52:46,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:52:46,163 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:52:46,169 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:52:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-04-13 21:52:46,187 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-04-13 21:52:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 21:52:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:52:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-13 21:52:46,187 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-13 21:52:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:52:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:52:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:52:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 21:52:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 21:52:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:52:46,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:52:46,188 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:52:46,288 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:52:46,289 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:52:46,494 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:52:46,495 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:52:46,495 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:52:46,666 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:52:46,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:52:46 BoogieIcfgContainer [2025-04-13 21:52:46,666 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:52:46,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:52:46,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:52:46,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:52:46,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:52:45" (1/3) ... [2025-04-13 21:52:46,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5005919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:52:46, skipping insertion in model container [2025-04-13 21:52:46,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:46" (2/3) ... [2025-04-13 21:52:46,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5005919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:52:46, skipping insertion in model container [2025-04-13 21:52:46,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:52:46" (3/3) ... [2025-04-13 21:52:46,671 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_27-multiple-protecting2_true.i [2025-04-13 21:52:46,680 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:52:46,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_27-multiple-protecting2_true.i that has 3 procedures, 65 locations, 62 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-13 21:52:46,681 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:52:46,733 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:52:46,756 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 64 transitions, 142 flow [2025-04-13 21:52:46,914 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4930 states, 4926 states have (on average 2.8136419001218025) internal successors, (13860), 4929 states have internal predecessors, (13860), 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:52:46,933 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:52:46,943 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;@43bf1b7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:52:46,943 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 21:52:46,956 INFO L278 IsEmpty]: Start isEmpty. Operand has 4930 states, 4926 states have (on average 2.8136419001218025) internal successors, (13860), 4929 states have internal predecessors, (13860), 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:52:46,962 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 21:52:46,962 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:46,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:46,963 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:46,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:46,968 INFO L85 PathProgramCache]: Analyzing trace with hash -87923769, now seen corresponding path program 1 times [2025-04-13 21:52:46,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:46,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242780444] [2025-04-13 21:52:46,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:46,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:47,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:52:47,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:52:47,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:47,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:47,279 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:52:47,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:47,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242780444] [2025-04-13 21:52:47,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242780444] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:47,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:47,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:52:47,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718408065] [2025-04-13 21:52:47,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:47,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:52:47,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:47,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:52:47,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:52:47,313 INFO L87 Difference]: Start difference. First operand has 4930 states, 4926 states have (on average 2.8136419001218025) internal successors, (13860), 4929 states have internal predecessors, (13860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:52:47,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:47,549 INFO L93 Difference]: Finished difference Result 7450 states and 20708 transitions. [2025-04-13 21:52:47,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:52:47,550 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2025-04-13 21:52:47,551 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:47,594 INFO L225 Difference]: With dead ends: 7450 [2025-04-13 21:52:47,594 INFO L226 Difference]: Without dead ends: 6442 [2025-04-13 21:52:47,602 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:52:47,604 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:47,604 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 28 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:52:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6442 states. [2025-04-13 21:52:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6442 to 6316. [2025-04-13 21:52:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6316 states, 6312 states have (on average 2.81669835234474) internal successors, (17779), 6315 states have internal predecessors, (17779), 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:52:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6316 states to 6316 states and 17779 transitions. [2025-04-13 21:52:47,881 INFO L79 Accepts]: Start accepts. Automaton has 6316 states and 17779 transitions. Word has length 9 [2025-04-13 21:52:47,881 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:47,881 INFO L485 AbstractCegarLoop]: Abstraction has 6316 states and 17779 transitions. [2025-04-13 21:52:47,881 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:52:47,882 INFO L278 IsEmpty]: Start isEmpty. Operand 6316 states and 17779 transitions. [2025-04-13 21:52:47,883 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 21:52:47,883 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:47,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:47,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:52:47,884 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:47,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:47,884 INFO L85 PathProgramCache]: Analyzing trace with hash 389350988, now seen corresponding path program 1 times [2025-04-13 21:52:47,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:47,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104217478] [2025-04-13 21:52:47,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:47,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:47,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:52:47,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:52:47,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:47,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:48,073 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:52:48,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:48,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104217478] [2025-04-13 21:52:48,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104217478] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:48,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:48,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:52:48,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649440763] [2025-04-13 21:52:48,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:48,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:52:48,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:48,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:52:48,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:52:48,077 INFO L87 Difference]: Start difference. First operand 6316 states and 17779 transitions. Second operand has 4 states, 4 states have (on average 3.5) 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:52:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:48,296 INFO L93 Difference]: Finished difference Result 8220 states and 22449 transitions. [2025-04-13 21:52:48,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:52:48,297 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) 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:52:48,297 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:48,314 INFO L225 Difference]: With dead ends: 8220 [2025-04-13 21:52:48,315 INFO L226 Difference]: Without dead ends: 2886 [2025-04-13 21:52:48,324 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:52:48,325 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 104 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:48,325 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 34 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:52:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2025-04-13 21:52:48,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2752. [2025-04-13 21:52:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2752 states, 2747 states have (on average 2.475063705860939) internal successors, (6799), 2751 states have internal predecessors, (6799), 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:52:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 6799 transitions. [2025-04-13 21:52:48,397 INFO L79 Accepts]: Start accepts. Automaton has 2752 states and 6799 transitions. Word has length 14 [2025-04-13 21:52:48,397 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:48,397 INFO L485 AbstractCegarLoop]: Abstraction has 2752 states and 6799 transitions. [2025-04-13 21:52:48,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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:52:48,398 INFO L278 IsEmpty]: Start isEmpty. Operand 2752 states and 6799 transitions. [2025-04-13 21:52:48,400 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:48,401 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:48,401 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:52:48,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:52:48,401 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:48,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:48,401 INFO L85 PathProgramCache]: Analyzing trace with hash 374561214, now seen corresponding path program 1 times [2025-04-13 21:52:48,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:48,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111635096] [2025-04-13 21:52:48,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:48,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:48,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:48,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:48,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:48,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:48,524 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:52:48,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:48,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111635096] [2025-04-13 21:52:48,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111635096] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:48,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:48,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:52:48,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182486591] [2025-04-13 21:52:48,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:48,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:52:48,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:48,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:52:48,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:52:48,525 INFO L87 Difference]: Start difference. First operand 2752 states and 6799 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 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:52:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:48,622 INFO L93 Difference]: Finished difference Result 3393 states and 8354 transitions. [2025-04-13 21:52:48,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:52:48,622 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 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:52:48,623 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:48,642 INFO L225 Difference]: With dead ends: 3393 [2025-04-13 21:52:48,642 INFO L226 Difference]: Without dead ends: 3317 [2025-04-13 21:52:48,644 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:52:48,645 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:48,645 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 28 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:52:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2025-04-13 21:52:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 2732. [2025-04-13 21:52:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2732 states, 2727 states have (on average 2.474880821415475) internal successors, (6749), 2731 states have internal predecessors, (6749), 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:52:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 6749 transitions. [2025-04-13 21:52:48,719 INFO L79 Accepts]: Start accepts. Automaton has 2732 states and 6749 transitions. Word has length 19 [2025-04-13 21:52:48,720 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:48,720 INFO L485 AbstractCegarLoop]: Abstraction has 2732 states and 6749 transitions. [2025-04-13 21:52:48,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 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:52:48,720 INFO L278 IsEmpty]: Start isEmpty. Operand 2732 states and 6749 transitions. [2025-04-13 21:52:48,721 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:52:48,722 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:48,722 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:52:48,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:52:48,722 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:48,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:48,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1077907725, now seen corresponding path program 1 times [2025-04-13 21:52:48,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:48,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700736089] [2025-04-13 21:52:48,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:48,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:48,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 21:52:48,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:52:48,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:48,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:48,876 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:52:48,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:48,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700736089] [2025-04-13 21:52:48,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700736089] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:48,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:48,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:52:48,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694045506] [2025-04-13 21:52:48,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:48,877 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:52:48,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:48,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:52:48,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:52:48,878 INFO L87 Difference]: Start difference. First operand 2732 states and 6749 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 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:52:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:48,994 INFO L93 Difference]: Finished difference Result 3040 states and 7401 transitions. [2025-04-13 21:52:48,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:52:48,995 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 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:52:48,995 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:49,008 INFO L225 Difference]: With dead ends: 3040 [2025-04-13 21:52:49,008 INFO L226 Difference]: Without dead ends: 2340 [2025-04-13 21:52:49,010 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:52:49,012 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 68 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:49,013 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 48 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:52:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2025-04-13 21:52:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2240. [2025-04-13 21:52:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2240 states, 2235 states have (on average 2.41744966442953) internal successors, (5403), 2239 states have internal predecessors, (5403), 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:52:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 5403 transitions. [2025-04-13 21:52:49,068 INFO L79 Accepts]: Start accepts. Automaton has 2240 states and 5403 transitions. Word has length 21 [2025-04-13 21:52:49,069 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:49,069 INFO L485 AbstractCegarLoop]: Abstraction has 2240 states and 5403 transitions. [2025-04-13 21:52:49,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 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:52:49,069 INFO L278 IsEmpty]: Start isEmpty. Operand 2240 states and 5403 transitions. [2025-04-13 21:52:49,074 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 21:52:49,075 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:49,075 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:52:49,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:52:49,075 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:49,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:49,075 INFO L85 PathProgramCache]: Analyzing trace with hash 463083096, now seen corresponding path program 1 times [2025-04-13 21:52:49,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:49,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402006180] [2025-04-13 21:52:49,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:49,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:49,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 21:52:49,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 21:52:49,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:49,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:49,220 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:52:49,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:49,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402006180] [2025-04-13 21:52:49,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402006180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:49,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:49,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:52:49,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028818379] [2025-04-13 21:52:49,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:49,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:52:49,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:49,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:52:49,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:52:49,221 INFO L87 Difference]: Start difference. First operand 2240 states and 5403 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:52:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:49,330 INFO L93 Difference]: Finished difference Result 3946 states and 9512 transitions. [2025-04-13 21:52:49,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:52:49,330 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:52:49,330 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:49,342 INFO L225 Difference]: With dead ends: 3946 [2025-04-13 21:52:49,342 INFO L226 Difference]: Without dead ends: 2348 [2025-04-13 21:52:49,345 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:52:49,346 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 118 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:49,346 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 42 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:52:49,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-04-13 21:52:49,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2276. [2025-04-13 21:52:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2276 states, 2262 states have (on average 2.3010610079575597) internal successors, (5205), 2275 states have internal predecessors, (5205), 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:52:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 5205 transitions. [2025-04-13 21:52:49,396 INFO L79 Accepts]: Start accepts. Automaton has 2276 states and 5205 transitions. Word has length 24 [2025-04-13 21:52:49,396 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:49,396 INFO L485 AbstractCegarLoop]: Abstraction has 2276 states and 5205 transitions. [2025-04-13 21:52:49,396 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:52:49,396 INFO L278 IsEmpty]: Start isEmpty. Operand 2276 states and 5205 transitions. [2025-04-13 21:52:49,398 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:52:49,398 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:49,398 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] [2025-04-13 21:52:49,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:52:49,398 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:49,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:49,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1061966299, now seen corresponding path program 1 times [2025-04-13 21:52:49,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:49,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853023618] [2025-04-13 21:52:49,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:49,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:49,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 21:52:49,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:52:49,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:49,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:49,600 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:52:49,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:49,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853023618] [2025-04-13 21:52:49,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853023618] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:49,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:49,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:52:49,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706227410] [2025-04-13 21:52:49,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:49,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:52:49,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:49,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:52:49,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:52:49,601 INFO L87 Difference]: Start difference. First operand 2276 states and 5205 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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:52:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:49,686 INFO L93 Difference]: Finished difference Result 2876 states and 6511 transitions. [2025-04-13 21:52:49,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:52:49,686 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2025-04-13 21:52:49,686 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:49,696 INFO L225 Difference]: With dead ends: 2876 [2025-04-13 21:52:49,696 INFO L226 Difference]: Without dead ends: 1708 [2025-04-13 21:52:49,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:52:49,699 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 89 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:49,699 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 30 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:52:49,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2025-04-13 21:52:49,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1708. [2025-04-13 21:52:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1696 states have (on average 2.263561320754717) internal successors, (3839), 1707 states have internal predecessors, (3839), 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:52:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 3839 transitions. [2025-04-13 21:52:49,729 INFO L79 Accepts]: Start accepts. Automaton has 1708 states and 3839 transitions. Word has length 25 [2025-04-13 21:52:49,729 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:49,729 INFO L485 AbstractCegarLoop]: Abstraction has 1708 states and 3839 transitions. [2025-04-13 21:52:49,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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:52:49,730 INFO L278 IsEmpty]: Start isEmpty. Operand 1708 states and 3839 transitions. [2025-04-13 21:52:49,731 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 21:52:49,731 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:49,731 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:52:49,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:52:49,731 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:49,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1420664910, now seen corresponding path program 1 times [2025-04-13 21:52:49,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:49,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068717302] [2025-04-13 21:52:49,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:49,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:49,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 21:52:49,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 21:52:49,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:49,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:49,892 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:52:49,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:49,893 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068717302] [2025-04-13 21:52:49,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068717302] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:49,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:49,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:52:49,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395344661] [2025-04-13 21:52:49,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:49,893 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:52:49,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:49,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:52:49,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:52:49,894 INFO L87 Difference]: Start difference. First operand 1708 states and 3839 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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:52:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:49,970 INFO L93 Difference]: Finished difference Result 1764 states and 3947 transitions. [2025-04-13 21:52:49,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:52:49,971 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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:52:49,971 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:49,978 INFO L225 Difference]: With dead ends: 1764 [2025-04-13 21:52:49,978 INFO L226 Difference]: Without dead ends: 878 [2025-04-13 21:52:49,980 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:52:49,980 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:49,980 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 29 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:52:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-04-13 21:52:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 758. [2025-04-13 21:52:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 756 states have (on average 2.248677248677249) internal successors, (1700), 757 states have internal predecessors, (1700), 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:52:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1700 transitions. [2025-04-13 21:52:49,995 INFO L79 Accepts]: Start accepts. Automaton has 758 states and 1700 transitions. Word has length 26 [2025-04-13 21:52:49,995 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:49,995 INFO L485 AbstractCegarLoop]: Abstraction has 758 states and 1700 transitions. [2025-04-13 21:52:49,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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:52:49,995 INFO L278 IsEmpty]: Start isEmpty. Operand 758 states and 1700 transitions. [2025-04-13 21:52:49,996 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 21:52:49,996 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:49,997 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] [2025-04-13 21:52:49,997 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:52:49,997 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:49,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:49,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1248347110, now seen corresponding path program 1 times [2025-04-13 21:52:49,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:49,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175012368] [2025-04-13 21:52:49,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:49,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:50,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 21:52:50,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 21:52:50,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:50,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:50,129 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:52:50,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:50,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175012368] [2025-04-13 21:52:50,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175012368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:50,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:50,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:52:50,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750723216] [2025-04-13 21:52:50,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:50,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:52:50,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:50,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:52:50,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:52:50,130 INFO L87 Difference]: Start difference. First operand 758 states and 1700 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:50,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:50,188 INFO L93 Difference]: Finished difference Result 758 states and 1700 transitions. [2025-04-13 21:52:50,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:52:50,188 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 21:52:50,188 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:50,192 INFO L225 Difference]: With dead ends: 758 [2025-04-13 21:52:50,192 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 21:52:50,193 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:52:50,194 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:50,194 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 36 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:52:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 21:52:50,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 21:52:50,194 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:52:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 21:52:50,197 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2025-04-13 21:52:50,197 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:50,198 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 21:52:50,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:50,198 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 21:52:50,198 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 21:52:50,200 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 21:52:50,200 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 21:52:50,200 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 21:52:50,200 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 21:52:50,200 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-13 21:52:50,200 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-04-13 21:52:50,200 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:52:50,203 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:50,206 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:52:50,206 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:52:50,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:52:50 BasicIcfg [2025-04-13 21:52:50,208 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:52:50,209 INFO L158 Benchmark]: Toolchain (without parser) took 4500.30ms. Allocated memory was 155.2MB in the beginning and 394.3MB in the end (delta: 239.1MB). Free memory was 108.4MB in the beginning and 149.5MB in the end (delta: -41.1MB). Peak memory consumption was 198.2MB. Max. memory is 8.0GB. [2025-04-13 21:52:50,209 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:52:50,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.13ms. Allocated memory is still 155.2MB. Free memory was 108.4MB in the beginning and 85.0MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:52:50,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.74ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 82.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:52:50,210 INFO L158 Benchmark]: Boogie Preprocessor took 50.13ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:52:50,211 INFO L158 Benchmark]: IcfgBuilder took 525.32ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 29.9MB in the end (delta: 50.9MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-13 21:52:50,211 INFO L158 Benchmark]: TraceAbstraction took 3541.30ms. Allocated memory was 155.2MB in the beginning and 394.3MB in the end (delta: 239.1MB). Free memory was 29.3MB in the beginning and 149.5MB in the end (delta: -120.2MB). Peak memory consumption was 118.6MB. Max. memory is 8.0GB. [2025-04-13 21:52:50,213 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.22ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 344.13ms. Allocated memory is still 155.2MB. Free memory was 108.4MB in the beginning and 85.0MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.74ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 82.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 50.13ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 525.32ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 29.9MB in the end (delta: 50.9MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 3541.30ms. Allocated memory was 155.2MB in the beginning and 394.3MB in the end (delta: 239.1MB). Free memory was 29.3MB in the beginning and 149.5MB in the end (delta: -120.2MB). Peak memory consumption was 118.6MB. 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: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 5 procedures, 95 locations, 94 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 518 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 518 mSDsluCounter, 275 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 723 IncrementalHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 163 mSDtfsCounter, 723 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6316occurred in iteration=1, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 1137 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 21:52:50,227 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...