/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-theta/wsc.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:32:14,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:32:14,845 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 23:32:14,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:32:14,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:32:14,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:32:14,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:32:14,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:32:14,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:32:14,876 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:32:14,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:32:14,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:32:14,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:32:14,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:32:14,877 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:32:14,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:32:14,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:32:14,878 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:32:14,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:32:14,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:32:14,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:32:14,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:32:14,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:32:14,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:32:14,878 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:32:14,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:32:14,878 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:32:14,878 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:32:14,878 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:32:14,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:32:14,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:32:14,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:32:14,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:32:14,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:32:14,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:32:14,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:32:14,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:32:14,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:32:14,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:32:14,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:32:14,879 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:32:14,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:32:14,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:32:14,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:32:14,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:32:14,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:32:14,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:32:14,880 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 23:32:15,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:32:15,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:32:15,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:32:15,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:32:15,128 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:32:15,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/wsc.i [2025-04-13 23:32:16,420 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa967a18e/687d84b00e57499f83a0b25b53546eca/FLAGec90338ec [2025-04-13 23:32:16,666 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:32:16,667 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/wsc.i [2025-04-13 23:32:16,678 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa967a18e/687d84b00e57499f83a0b25b53546eca/FLAGec90338ec [2025-04-13 23:32:17,419 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa967a18e/687d84b00e57499f83a0b25b53546eca [2025-04-13 23:32:17,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:32:17,422 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:32:17,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:32:17,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:32:17,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:32:17,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:32:17" (1/1) ... [2025-04-13 23:32:17,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4619fe1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17, skipping insertion in model container [2025-04-13 23:32:17,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:32:17" (1/1) ... [2025-04-13 23:32:17,452 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:32:17,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/wsc.i[33949,33962] [2025-04-13 23:32:17,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:32:17,746 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:32:17,787 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/wsc.i[33949,33962] [2025-04-13 23:32:17,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:32:17,817 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:32:17,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17 WrapperNode [2025-04-13 23:32:17,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:32:17,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:32:17,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:32:17,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:32:17,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17" (1/1) ... [2025-04-13 23:32:17,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17" (1/1) ... [2025-04-13 23:32:17,859 INFO L138 Inliner]: procedures = 171, calls = 26, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 122 [2025-04-13 23:32:17,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:32:17,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:32:17,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:32:17,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:32:17,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17" (1/1) ... [2025-04-13 23:32:17,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17" (1/1) ... [2025-04-13 23:32:17,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17" (1/1) ... [2025-04-13 23:32:17,884 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 0 writes are split as follows [0, 0]. [2025-04-13 23:32:17,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17" (1/1) ... [2025-04-13 23:32:17,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17" (1/1) ... [2025-04-13 23:32:17,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17" (1/1) ... [2025-04-13 23:32:17,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17" (1/1) ... [2025-04-13 23:32:17,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17" (1/1) ... [2025-04-13 23:32:17,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17" (1/1) ... [2025-04-13 23:32:17,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:32:17,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:32:17,910 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:32:17,910 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:32:17,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17" (1/1) ... [2025-04-13 23:32:17,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:32:17,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:17,941 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 23:32:17,944 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 23:32:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:32:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure f0 [2025-04-13 23:32:17,964 INFO L138 BoogieDeclarations]: Found implementation of procedure f0 [2025-04-13 23:32:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-13 23:32:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-13 23:32:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-13 23:32:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-13 23:32:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure f3 [2025-04-13 23:32:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure f3 [2025-04-13 23:32:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure f4 [2025-04-13 23:32:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure f4 [2025-04-13 23:32:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure f5 [2025-04-13 23:32:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure f5 [2025-04-13 23:32:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:32:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:32:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:32:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:32:17,966 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 23:32:18,070 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:32:18,071 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:32:18,223 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:32:18,224 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:32:18,224 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:32:18,389 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:32:18,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:32:18 BoogieIcfgContainer [2025-04-13 23:32:18,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:32:18,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:32:18,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:32:18,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:32:18,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:32:17" (1/3) ... [2025-04-13 23:32:18,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f849a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:32:18, skipping insertion in model container [2025-04-13 23:32:18,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:17" (2/3) ... [2025-04-13 23:32:18,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f849a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:32:18, skipping insertion in model container [2025-04-13 23:32:18,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:32:18" (3/3) ... [2025-04-13 23:32:18,398 INFO L128 eAbstractionObserver]: Analyzing ICFG wsc.i [2025-04-13 23:32:18,408 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:32:18,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG wsc.i that has 7 procedures, 50 locations, 43 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 23:32:18,410 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:32:18,468 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-13 23:32:18,498 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 49 transitions, 140 flow [2025-04-13 23:32:19,644 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 27312 states, 27311 states have (on average 5.015012266119879) internal successors, (136965), 27311 states have internal predecessors, (136965), 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 23:32:19,668 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:32:19,735 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;@55e80c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:32:19,735 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:32:19,801 INFO L278 IsEmpty]: Start isEmpty. Operand has 27312 states, 27311 states have (on average 5.015012266119879) internal successors, (136965), 27311 states have internal predecessors, (136965), 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 23:32:19,993 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 23:32:19,993 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:19,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:19,994 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:19,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:19,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1651095876, now seen corresponding path program 1 times [2025-04-13 23:32:20,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:20,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014977380] [2025-04-13 23:32:20,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:20,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:20,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 23:32:20,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 23:32:20,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:20,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:20,335 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 23:32:20,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:20,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014977380] [2025-04-13 23:32:20,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014977380] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:20,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:20,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:32:20,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108214617] [2025-04-13 23:32:20,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:20,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:32:20,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:20,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:32:20,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:20,420 INFO L87 Difference]: Start difference. First operand has 27312 states, 27311 states have (on average 5.015012266119879) internal successors, (136965), 27311 states have internal predecessors, (136965), 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, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 23:32:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:21,415 INFO L93 Difference]: Finished difference Result 58872 states and 291673 transitions. [2025-04-13 23:32:21,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:32:21,416 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2025-04-13 23:32:21,417 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:21,812 INFO L225 Difference]: With dead ends: 58872 [2025-04-13 23:32:21,812 INFO L226 Difference]: Without dead ends: 32134 [2025-04-13 23:32:21,861 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:21,863 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:21,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 8 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32134 states. [2025-04-13 23:32:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32134 to 27312. [2025-04-13 23:32:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27312 states, 27311 states have (on average 4.648273589396214) internal successors, (126949), 27311 states have internal predecessors, (126949), 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 23:32:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27312 states to 27312 states and 126949 transitions. [2025-04-13 23:32:23,184 INFO L79 Accepts]: Start accepts. Automaton has 27312 states and 126949 transitions. Word has length 42 [2025-04-13 23:32:23,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:23,186 INFO L485 AbstractCegarLoop]: Abstraction has 27312 states and 126949 transitions. [2025-04-13 23:32:23,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 23:32:23,186 INFO L278 IsEmpty]: Start isEmpty. Operand 27312 states and 126949 transitions. [2025-04-13 23:32:23,306 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 23:32:23,307 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:23,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:23,307 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:32:23,307 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:23,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:23,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1029592230, now seen corresponding path program 2 times [2025-04-13 23:32:23,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:23,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284210935] [2025-04-13 23:32:23,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:32:23,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:23,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 1 equivalence classes. [2025-04-13 23:32:23,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 23:32:23,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:32:23,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:23,523 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 23:32:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:23,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284210935] [2025-04-13 23:32:23,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284210935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:23,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:23,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:32:23,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229431303] [2025-04-13 23:32:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:23,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:32:23,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:23,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:32:23,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:23,525 INFO L87 Difference]: Start difference. First operand 27312 states and 126949 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 23:32:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:24,014 INFO L93 Difference]: Finished difference Result 41623 states and 190283 transitions. [2025-04-13 23:32:24,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:32:24,014 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2025-04-13 23:32:24,015 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:24,282 INFO L225 Difference]: With dead ends: 41623 [2025-04-13 23:32:24,283 INFO L226 Difference]: Without dead ends: 17810 [2025-04-13 23:32:24,314 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:24,315 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:24,315 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17810 states. [2025-04-13 23:32:24,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17810 to 16959. [2025-04-13 23:32:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16959 states, 16958 states have (on average 4.264417973817667) internal successors, (72316), 16958 states have internal predecessors, (72316), 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 23:32:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16959 states to 16959 states and 72316 transitions. [2025-04-13 23:32:24,896 INFO L79 Accepts]: Start accepts. Automaton has 16959 states and 72316 transitions. Word has length 42 [2025-04-13 23:32:24,896 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:24,896 INFO L485 AbstractCegarLoop]: Abstraction has 16959 states and 72316 transitions. [2025-04-13 23:32:24,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 23:32:24,897 INFO L278 IsEmpty]: Start isEmpty. Operand 16959 states and 72316 transitions. [2025-04-13 23:32:24,938 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 23:32:24,938 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:24,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:24,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:32:24,938 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:24,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:24,939 INFO L85 PathProgramCache]: Analyzing trace with hash 735233942, now seen corresponding path program 3 times [2025-04-13 23:32:24,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:24,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508695231] [2025-04-13 23:32:24,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:24,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:24,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 1 equivalence classes. [2025-04-13 23:32:24,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 23:32:24,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:32:24,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:25,056 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 23:32:25,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:25,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508695231] [2025-04-13 23:32:25,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508695231] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:25,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:25,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:32:25,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794128279] [2025-04-13 23:32:25,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:25,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:32:25,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:25,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:32:25,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:25,058 INFO L87 Difference]: Start difference. First operand 16959 states and 72316 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 23:32:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:25,252 INFO L93 Difference]: Finished difference Result 24252 states and 101876 transitions. [2025-04-13 23:32:25,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:32:25,253 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2025-04-13 23:32:25,253 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:25,546 INFO L225 Difference]: With dead ends: 24252 [2025-04-13 23:32:25,546 INFO L226 Difference]: Without dead ends: 18188 [2025-04-13 23:32:25,556 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:25,559 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:25,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 8 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18188 states. [2025-04-13 23:32:25,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18188 to 16959. [2025-04-13 23:32:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16959 states, 16958 states have (on average 4.11204151432952) internal successors, (69732), 16958 states have internal predecessors, (69732), 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 23:32:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16959 states to 16959 states and 69732 transitions. [2025-04-13 23:32:26,114 INFO L79 Accepts]: Start accepts. Automaton has 16959 states and 69732 transitions. Word has length 42 [2025-04-13 23:32:26,114 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:26,115 INFO L485 AbstractCegarLoop]: Abstraction has 16959 states and 69732 transitions. [2025-04-13 23:32:26,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 23:32:26,115 INFO L278 IsEmpty]: Start isEmpty. Operand 16959 states and 69732 transitions. [2025-04-13 23:32:26,159 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 23:32:26,159 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:26,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:26,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:32:26,160 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:26,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:26,160 INFO L85 PathProgramCache]: Analyzing trace with hash 164052886, now seen corresponding path program 4 times [2025-04-13 23:32:26,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:26,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523868172] [2025-04-13 23:32:26,160 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:32:26,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:26,174 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 23:32:26,182 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 42 statements. [2025-04-13 23:32:26,182 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 23:32:26,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:26,260 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 23:32:26,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:26,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523868172] [2025-04-13 23:32:26,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523868172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:26,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:26,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:32:26,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544659078] [2025-04-13 23:32:26,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:26,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:32:26,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:26,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:32:26,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:26,262 INFO L87 Difference]: Start difference. First operand 16959 states and 69732 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 23:32:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:26,503 INFO L93 Difference]: Finished difference Result 22467 states and 91485 transitions. [2025-04-13 23:32:26,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:32:26,504 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2025-04-13 23:32:26,504 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:26,608 INFO L225 Difference]: With dead ends: 22467 [2025-04-13 23:32:26,609 INFO L226 Difference]: Without dead ends: 14238 [2025-04-13 23:32:26,630 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:26,631 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:26,631 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:26,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14238 states. [2025-04-13 23:32:27,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14238 to 13176. [2025-04-13 23:32:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13176 states, 13175 states have (on average 4.042884250474383) internal successors, (53265), 13175 states have internal predecessors, (53265), 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 23:32:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13176 states to 13176 states and 53265 transitions. [2025-04-13 23:32:27,130 INFO L79 Accepts]: Start accepts. Automaton has 13176 states and 53265 transitions. Word has length 42 [2025-04-13 23:32:27,130 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:27,130 INFO L485 AbstractCegarLoop]: Abstraction has 13176 states and 53265 transitions. [2025-04-13 23:32:27,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 23:32:27,131 INFO L278 IsEmpty]: Start isEmpty. Operand 13176 states and 53265 transitions. [2025-04-13 23:32:27,157 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 23:32:27,158 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:27,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:27,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:32:27,158 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:27,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1624461726, now seen corresponding path program 5 times [2025-04-13 23:32:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:27,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616135293] [2025-04-13 23:32:27,158 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:32:27,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:27,166 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 1 equivalence classes. [2025-04-13 23:32:27,171 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 23:32:27,171 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:32:27,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:27,212 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 23:32:27,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:27,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616135293] [2025-04-13 23:32:27,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616135293] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:27,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:27,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:32:27,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674420279] [2025-04-13 23:32:27,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:27,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:32:27,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:27,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:32:27,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:27,213 INFO L87 Difference]: Start difference. First operand 13176 states and 53265 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 23:32:27,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:27,502 INFO L93 Difference]: Finished difference Result 20368 states and 80601 transitions. [2025-04-13 23:32:27,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:32:27,503 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2025-04-13 23:32:27,503 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:27,588 INFO L225 Difference]: With dead ends: 20368 [2025-04-13 23:32:27,588 INFO L226 Difference]: Without dead ends: 14938 [2025-04-13 23:32:27,597 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:27,598 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:27,598 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 8 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14938 states. [2025-04-13 23:32:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14938 to 13176. [2025-04-13 23:32:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13176 states, 13175 states have (on average 3.8965464895635673) internal successors, (51337), 13175 states have internal predecessors, (51337), 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 23:32:27,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13176 states to 13176 states and 51337 transitions. [2025-04-13 23:32:27,944 INFO L79 Accepts]: Start accepts. Automaton has 13176 states and 51337 transitions. Word has length 42 [2025-04-13 23:32:27,944 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:27,945 INFO L485 AbstractCegarLoop]: Abstraction has 13176 states and 51337 transitions. [2025-04-13 23:32:27,945 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 23:32:27,945 INFO L278 IsEmpty]: Start isEmpty. Operand 13176 states and 51337 transitions. [2025-04-13 23:32:27,971 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 23:32:27,971 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:27,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:27,972 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:32:27,972 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:27,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:27,972 INFO L85 PathProgramCache]: Analyzing trace with hash 771856926, now seen corresponding path program 6 times [2025-04-13 23:32:27,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:27,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97227341] [2025-04-13 23:32:27,972 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:32:27,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:27,980 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 1 equivalence classes. [2025-04-13 23:32:27,985 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 23:32:27,985 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:32:27,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:28,033 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 23:32:28,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:28,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97227341] [2025-04-13 23:32:28,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97227341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:28,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:28,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:32:28,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429805076] [2025-04-13 23:32:28,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:28,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:32:28,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:28,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:32:28,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:28,034 INFO L87 Difference]: Start difference. First operand 13176 states and 51337 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 23:32:28,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:28,226 INFO L93 Difference]: Finished difference Result 19744 states and 75553 transitions. [2025-04-13 23:32:28,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:32:28,226 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2025-04-13 23:32:28,226 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:28,323 INFO L225 Difference]: With dead ends: 19744 [2025-04-13 23:32:28,323 INFO L226 Difference]: Without dead ends: 12269 [2025-04-13 23:32:28,339 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:28,340 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:28,340 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 9 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:28,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12269 states. [2025-04-13 23:32:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12269 to 10994. [2025-04-13 23:32:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10994 states, 10993 states have (on average 3.8314381879377786) internal successors, (42119), 10993 states have internal predecessors, (42119), 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 23:32:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10994 states to 10994 states and 42119 transitions. [2025-04-13 23:32:28,715 INFO L79 Accepts]: Start accepts. Automaton has 10994 states and 42119 transitions. Word has length 42 [2025-04-13 23:32:28,715 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:28,715 INFO L485 AbstractCegarLoop]: Abstraction has 10994 states and 42119 transitions. [2025-04-13 23:32:28,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 23:32:28,716 INFO L278 IsEmpty]: Start isEmpty. Operand 10994 states and 42119 transitions. [2025-04-13 23:32:28,740 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 23:32:28,740 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:28,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:28,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:32:28,741 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:28,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:28,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1355520724, now seen corresponding path program 7 times [2025-04-13 23:32:28,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:28,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065578454] [2025-04-13 23:32:28,741 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:32:28,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:28,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 23:32:28,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 23:32:28,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:28,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:28,809 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 23:32:28,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:28,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065578454] [2025-04-13 23:32:28,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065578454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:28,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:28,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:32:28,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704906380] [2025-04-13 23:32:28,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:28,809 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:32:28,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:28,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:32:28,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:28,810 INFO L87 Difference]: Start difference. First operand 10994 states and 42119 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 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 23:32:28,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:28,894 INFO L93 Difference]: Finished difference Result 10994 states and 42119 transitions. [2025-04-13 23:32:28,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:32:28,894 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 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 42 [2025-04-13 23:32:28,895 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:28,942 INFO L225 Difference]: With dead ends: 10994 [2025-04-13 23:32:28,942 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 23:32:28,955 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 23:32:28,956 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:28,956 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:32:28,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 23:32:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 23:32:28,957 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 23:32:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 23:32:28,995 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2025-04-13 23:32:28,995 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:28,995 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 23:32:28,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 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 23:32:28,995 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 23:32:28,995 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 23:32:28,997 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 23:32:28,997 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2025-04-13 23:32:28,998 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 23:32:28,998 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 23:32:28,998 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 23:32:28,998 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-13 23:32:28,998 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2025-04-13 23:32:28,998 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:32:29,000 INFO L422 BasicCegarLoop]: Path program histogram: [7] [2025-04-13 23:32:29,002 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:32:29,002 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:32:29,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:32:29 BasicIcfg [2025-04-13 23:32:29,005 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:32:29,005 INFO L158 Benchmark]: Toolchain (without parser) took 11583.07ms. Allocated memory was 155.2MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 107.3MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-13 23:32:29,005 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:32:29,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.41ms. Allocated memory is still 155.2MB. Free memory was 106.6MB in the beginning and 83.6MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 23:32:29,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.35ms. Allocated memory is still 155.2MB. Free memory was 83.6MB in the beginning and 81.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:32:29,006 INFO L158 Benchmark]: Boogie Preprocessor took 46.02ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 78.8MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:32:29,006 INFO L158 Benchmark]: IcfgBuilder took 479.87ms. Allocated memory is still 155.2MB. Free memory was 78.8MB in the beginning and 41.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 23:32:29,006 INFO L158 Benchmark]: TraceAbstraction took 10612.20ms. Allocated memory was 155.2MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 40.4MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-13 23:32:29,007 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 394.41ms. Allocated memory is still 155.2MB. Free memory was 106.6MB in the beginning and 83.6MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.35ms. Allocated memory is still 155.2MB. Free memory was 83.6MB in the beginning and 81.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 46.02ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 78.8MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 479.87ms. Allocated memory is still 155.2MB. Free memory was 78.8MB in the beginning and 41.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 10612.20ms. Allocated memory was 155.2MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 40.4MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.3GB. 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: 802]: 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 13 procedures, 84 locations, 83 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.5s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 629 IncrementalHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 34 mSDtfsCounter, 629 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27312occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 11001 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 294 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 371 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 23:32:29,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...