/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:50:44,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:50:44,892 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:50:44,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:50:44,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:50:44,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:50:44,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:50:44,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:50:44,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:50:44,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:50:44,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:50:44,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:50:44,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:50:44,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:50:44,918 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:50:44,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:50:44,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:50:44,919 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:50:44,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:50:44,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:50:44,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:50:44,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:50:44,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:50:44,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:50:44,919 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:50:44,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:50:44,919 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:50:44,919 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:50:44,919 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:50:44,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:50:44,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:50:44,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:50:44,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:44,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:50:44,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:50:44,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:50:44,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:50:44,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:44,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:50:44,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:50:44,920 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:50:44,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:50:44,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:50:44,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:50:44,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:50:44,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:50:44,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:50:44,921 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:50:45,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:50:45,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:50:45,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:50:45,162 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:50:45,162 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:50:45,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-13 21:50:46,501 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1d8d610/c9efc075236d4a3e849a259eead5bf1e/FLAGd75fb7bb2 [2025-04-13 21:50:46,771 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:50:46,772 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-13 21:50:46,783 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1d8d610/c9efc075236d4a3e849a259eead5bf1e/FLAGd75fb7bb2 [2025-04-13 21:50:47,553 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1d8d610/c9efc075236d4a3e849a259eead5bf1e [2025-04-13 21:50:47,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:50:47,559 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:50:47,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:50:47,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:50:47,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:50:47,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:50:47" (1/1) ... [2025-04-13 21:50:47,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777c127b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:47, skipping insertion in model container [2025-04-13 21:50:47,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:50:47" (1/1) ... [2025-04-13 21:50:47,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:50:47,786 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2025-04-13 21:50:47,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:50:47,920 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:50:47,936 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2025-04-13 21:50:47,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:50:47,991 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:50:47,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:47 WrapperNode [2025-04-13 21:50:47,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:50:47,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:50:47,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:50:47,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:50:47,998 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:50:47" (1/1) ... [2025-04-13 21:50:48,011 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:50:47" (1/1) ... [2025-04-13 21:50:48,027 INFO L138 Inliner]: procedures = 176, calls = 50, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2025-04-13 21:50:48,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:50:48,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:50:48,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:50:48,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:50:48,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:47" (1/1) ... [2025-04-13 21:50:48,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:47" (1/1) ... [2025-04-13 21:50:48,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:47" (1/1) ... [2025-04-13 21:50:48,047 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 21:50:48,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:47" (1/1) ... [2025-04-13 21:50:48,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:47" (1/1) ... [2025-04-13 21:50:48,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:47" (1/1) ... [2025-04-13 21:50:48,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:47" (1/1) ... [2025-04-13 21:50:48,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:47" (1/1) ... [2025-04-13 21:50:48,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:47" (1/1) ... [2025-04-13 21:50:48,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:50:48,057 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:50:48,057 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:50:48,057 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:50:48,058 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:47" (1/1) ... [2025-04-13 21:50:48,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:48,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:50:48,082 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:50:48,083 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:50:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:50:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:50:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 21:50:48,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 21:50:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 21:50:48,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 21:50:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 21:50:48,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 21:50:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-13 21:50:48,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-13 21:50:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:50:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:50:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:50:48,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:50:48,099 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:50:48,202 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:50:48,203 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:50:48,348 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:50:48,349 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:50:48,349 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:50:48,456 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:50:48,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:50:48 BoogieIcfgContainer [2025-04-13 21:50:48,456 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:50:48,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:50:48,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:50:48,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:50:48,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:50:47" (1/3) ... [2025-04-13 21:50:48,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1258eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:50:48, skipping insertion in model container [2025-04-13 21:50:48,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:47" (2/3) ... [2025-04-13 21:50:48,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1258eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:50:48, skipping insertion in model container [2025-04-13 21:50:48,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:50:48" (3/3) ... [2025-04-13 21:50:48,463 INFO L128 eAbstractionObserver]: Analyzing ICFG thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-13 21:50:48,473 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:50:48,474 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i that has 5 procedures, 44 locations, 39 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 21:50:48,474 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:50:48,521 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:50:48,548 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 43 transitions, 102 flow [2025-04-13 21:50:49,277 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 17607 states, 17606 states have (on average 4.247074860842894) internal successors, (74774), 17606 states have internal predecessors, (74774), 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:50:49,301 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:50:49,311 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;@2eac1f7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:50:49,312 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 21:50:49,354 INFO L278 IsEmpty]: Start isEmpty. Operand has 17607 states, 17606 states have (on average 4.247074860842894) internal successors, (74774), 17606 states have internal predecessors, (74774), 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:50:49,373 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 21:50:49,373 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:49,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:50:49,377 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:50:49,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1150882308, now seen corresponding path program 1 times [2025-04-13 21:50:49,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:49,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794915935] [2025-04-13 21:50:49,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:49,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:49,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:50:49,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:50:49,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:49,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:49,793 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:50:49,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:49,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794915935] [2025-04-13 21:50:49,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794915935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:49,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:49,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:50:49,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067146689] [2025-04-13 21:50:49,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:49,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:50:49,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:49,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:50:49,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:50:49,851 INFO L87 Difference]: Start difference. First operand has 17607 states, 17606 states have (on average 4.247074860842894) internal successors, (74774), 17606 states have internal predecessors, (74774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 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:50:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:50,409 INFO L93 Difference]: Finished difference Result 26487 states and 110538 transitions. [2025-04-13 21:50:50,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:50:50,411 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:50:50,411 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:50,564 INFO L225 Difference]: With dead ends: 26487 [2025-04-13 21:50:50,565 INFO L226 Difference]: Without dead ends: 14482 [2025-04-13 21:50:50,599 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:50:50,601 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 76 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:50,601 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 12 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:50,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14482 states. [2025-04-13 21:50:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14482 to 14482. [2025-04-13 21:50:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14482 states, 14481 states have (on average 4.084593605413991) internal successors, (59149), 14481 states have internal predecessors, (59149), 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:50:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14482 states to 14482 states and 59149 transitions. [2025-04-13 21:50:51,577 INFO L79 Accepts]: Start accepts. Automaton has 14482 states and 59149 transitions. Word has length 14 [2025-04-13 21:50:51,577 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:51,578 INFO L485 AbstractCegarLoop]: Abstraction has 14482 states and 59149 transitions. [2025-04-13 21:50:51,578 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:50:51,579 INFO L278 IsEmpty]: Start isEmpty. Operand 14482 states and 59149 transitions. [2025-04-13 21:50:51,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:50:51,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:51,595 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:50:51,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:50:51,595 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:50:51,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:51,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1686380118, now seen corresponding path program 1 times [2025-04-13 21:50:51,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:51,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329610430] [2025-04-13 21:50:51,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:51,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:51,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:50:51,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:50:51,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:51,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:51,858 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:50:51,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:51,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329610430] [2025-04-13 21:50:51,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329610430] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:51,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:51,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:50:51,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593819376] [2025-04-13 21:50:51,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:51,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:50:51,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:51,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:50:51,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:50:51,860 INFO L87 Difference]: Start difference. First operand 14482 states and 59149 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:52,200 INFO L93 Difference]: Finished difference Result 18362 states and 73413 transitions. [2025-04-13 21:50:52,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:50:52,200 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:50:52,201 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:52,267 INFO L225 Difference]: With dead ends: 18362 [2025-04-13 21:50:52,267 INFO L226 Difference]: Without dead ends: 9482 [2025-04-13 21:50:52,286 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:50:52,287 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 140 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:52,287 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 16 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:52,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9482 states. [2025-04-13 21:50:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9482 to 9482. [2025-04-13 21:50:52,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9482 states, 9481 states have (on average 3.865520514713638) internal successors, (36649), 9481 states have internal predecessors, (36649), 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:50:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9482 states to 9482 states and 36649 transitions. [2025-04-13 21:50:52,664 INFO L79 Accepts]: Start accepts. Automaton has 9482 states and 36649 transitions. Word has length 19 [2025-04-13 21:50:52,665 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:52,665 INFO L485 AbstractCegarLoop]: Abstraction has 9482 states and 36649 transitions. [2025-04-13 21:50:52,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:52,666 INFO L278 IsEmpty]: Start isEmpty. Operand 9482 states and 36649 transitions. [2025-04-13 21:50:52,679 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 21:50:52,679 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:52,680 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:50:52,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:50:52,680 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:50:52,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash -281780792, now seen corresponding path program 1 times [2025-04-13 21:50:52,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:52,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911918817] [2025-04-13 21:50:52,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:52,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:52,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 21:50:52,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 21:50:52,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:52,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:52,842 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:50:52,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:52,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911918817] [2025-04-13 21:50:52,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911918817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:52,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:52,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:50:52,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133659912] [2025-04-13 21:50:52,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:52,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:50:52,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:52,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:50:52,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:50:52,844 INFO L87 Difference]: Start difference. First operand 9482 states and 36649 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:50:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:53,104 INFO L93 Difference]: Finished difference Result 10362 states and 39513 transitions. [2025-04-13 21:50:53,105 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:50:53,105 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:50:53,105 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:53,149 INFO L225 Difference]: With dead ends: 10362 [2025-04-13 21:50:53,149 INFO L226 Difference]: Without dead ends: 6482 [2025-04-13 21:50:53,158 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:50:53,158 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 210 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:53,159 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 20 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:50:53,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6482 states. [2025-04-13 21:50:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6482 to 6482. [2025-04-13 21:50:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6482 states, 6481 states have (on average 3.8032711001388675) internal successors, (24649), 6481 states have internal predecessors, (24649), 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:50:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6482 states to 6482 states and 24649 transitions. [2025-04-13 21:50:53,409 INFO L79 Accepts]: Start accepts. Automaton has 6482 states and 24649 transitions. Word has length 24 [2025-04-13 21:50:53,410 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:53,410 INFO L485 AbstractCegarLoop]: Abstraction has 6482 states and 24649 transitions. [2025-04-13 21:50:53,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:50:53,410 INFO L278 IsEmpty]: Start isEmpty. Operand 6482 states and 24649 transitions. [2025-04-13 21:50:53,424 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 21:50:53,424 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:53,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:50:53,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:50:53,424 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:50:53,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash 636868352, now seen corresponding path program 1 times [2025-04-13 21:50:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:53,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860707503] [2025-04-13 21:50:53,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:53,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:53,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 21:50:53,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 21:50:53,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:53,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:53,585 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:50:53,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:53,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860707503] [2025-04-13 21:50:53,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860707503] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:53,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:53,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:50:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558176071] [2025-04-13 21:50:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:53,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:50:53,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:53,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:50:53,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:50:53,587 INFO L87 Difference]: Start difference. First operand 6482 states and 24649 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:53,866 INFO L93 Difference]: Finished difference Result 6562 states and 24873 transitions. [2025-04-13 21:50:53,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:50:53,866 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 21:50:53,866 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:53,948 INFO L225 Difference]: With dead ends: 6562 [2025-04-13 21:50:53,948 INFO L226 Difference]: Without dead ends: 5682 [2025-04-13 21:50:53,951 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:50:53,952 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 235 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:53,952 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 16 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5682 states. [2025-04-13 21:50:54,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5682 to 5682. [2025-04-13 21:50:54,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5682 states, 5681 states have (on average 3.845977820806196) internal successors, (21849), 5681 states have internal predecessors, (21849), 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:50:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5682 states to 5682 states and 21849 transitions. [2025-04-13 21:50:54,134 INFO L79 Accepts]: Start accepts. Automaton has 5682 states and 21849 transitions. Word has length 29 [2025-04-13 21:50:54,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:54,134 INFO L485 AbstractCegarLoop]: Abstraction has 5682 states and 21849 transitions. [2025-04-13 21:50:54,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:54,134 INFO L278 IsEmpty]: Start isEmpty. Operand 5682 states and 21849 transitions. [2025-04-13 21:50:54,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 21:50:54,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:54,164 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] [2025-04-13 21:50:54,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:50:54,164 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:50:54,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash -9801972, now seen corresponding path program 1 times [2025-04-13 21:50:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:54,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802361825] [2025-04-13 21:50:54,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:54,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:54,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 21:50:54,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 21:50:54,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:54,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:54,398 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:50:54,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:54,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802361825] [2025-04-13 21:50:54,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802361825] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:54,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:54,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:50:54,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523847968] [2025-04-13 21:50:54,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:54,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:50:54,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:54,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:50:54,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:50:54,399 INFO L87 Difference]: Start difference. First operand 5682 states and 21849 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:54,557 INFO L93 Difference]: Finished difference Result 7722 states and 29467 transitions. [2025-04-13 21:50:54,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:50:54,557 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 21:50:54,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:54,587 INFO L225 Difference]: With dead ends: 7722 [2025-04-13 21:50:54,587 INFO L226 Difference]: Without dead ends: 4212 [2025-04-13 21:50:54,594 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:50:54,595 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 60 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:54,595 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 15 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4212 states. [2025-04-13 21:50:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4212 to 4212. [2025-04-13 21:50:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4212 states, 4211 states have (on average 3.7174067917359297) internal successors, (15654), 4211 states have internal predecessors, (15654), 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:50:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4212 states to 4212 states and 15654 transitions. [2025-04-13 21:50:54,690 INFO L79 Accepts]: Start accepts. Automaton has 4212 states and 15654 transitions. Word has length 34 [2025-04-13 21:50:54,690 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:54,690 INFO L485 AbstractCegarLoop]: Abstraction has 4212 states and 15654 transitions. [2025-04-13 21:50:54,690 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:54,691 INFO L278 IsEmpty]: Start isEmpty. Operand 4212 states and 15654 transitions. [2025-04-13 21:50:54,701 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 21:50:54,701 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:54,701 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] [2025-04-13 21:50:54,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:50:54,702 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:50:54,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:54,702 INFO L85 PathProgramCache]: Analyzing trace with hash 606830546, now seen corresponding path program 2 times [2025-04-13 21:50:54,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:54,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208253330] [2025-04-13 21:50:54,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:50:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:54,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-04-13 21:50:54,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 21:50:54,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:50:54,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:54,812 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:50:54,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:54,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208253330] [2025-04-13 21:50:54,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208253330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:54,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:54,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:50:54,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606739285] [2025-04-13 21:50:54,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:54,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:50:54,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:54,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:50:54,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:50:54,814 INFO L87 Difference]: Start difference. First operand 4212 states and 15654 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:54,929 INFO L93 Difference]: Finished difference Result 5412 states and 19990 transitions. [2025-04-13 21:50:54,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:50:54,929 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 21:50:54,929 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:54,960 INFO L225 Difference]: With dead ends: 5412 [2025-04-13 21:50:54,960 INFO L226 Difference]: Without dead ends: 2382 [2025-04-13 21:50:54,967 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:50:54,967 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:54,968 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 11 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2025-04-13 21:50:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 2382. [2025-04-13 21:50:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2381 states have (on average 3.588408231835363) internal successors, (8544), 2381 states have internal predecessors, (8544), 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:50:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 8544 transitions. [2025-04-13 21:50:55,039 INFO L79 Accepts]: Start accepts. Automaton has 2382 states and 8544 transitions. Word has length 34 [2025-04-13 21:50:55,040 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:55,040 INFO L485 AbstractCegarLoop]: Abstraction has 2382 states and 8544 transitions. [2025-04-13 21:50:55,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:55,040 INFO L278 IsEmpty]: Start isEmpty. Operand 2382 states and 8544 transitions. [2025-04-13 21:50:55,083 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 21:50:55,084 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:55,084 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] [2025-04-13 21:50:55,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:50:55,084 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:50:55,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash -699899984, now seen corresponding path program 3 times [2025-04-13 21:50:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:55,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723452280] [2025-04-13 21:50:55,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:50:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:55,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 1 equivalence classes. [2025-04-13 21:50:55,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 21:50:55,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:50:55,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:55,211 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:50:55,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:55,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723452280] [2025-04-13 21:50:55,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723452280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:55,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:55,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:50:55,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018994932] [2025-04-13 21:50:55,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:55,211 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:50:55,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:55,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:50:55,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:50:55,212 INFO L87 Difference]: Start difference. First operand 2382 states and 8544 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:55,324 INFO L93 Difference]: Finished difference Result 3102 states and 11056 transitions. [2025-04-13 21:50:55,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:50:55,324 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 21:50:55,324 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:55,342 INFO L225 Difference]: With dead ends: 3102 [2025-04-13 21:50:55,342 INFO L226 Difference]: Without dead ends: 1382 [2025-04-13 21:50:55,346 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:50:55,346 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:55,346 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 9 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2025-04-13 21:50:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1382. [2025-04-13 21:50:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1381 states have (on average 3.4641564083997105) internal successors, (4784), 1381 states have internal predecessors, (4784), 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:50:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 4784 transitions. [2025-04-13 21:50:55,388 INFO L79 Accepts]: Start accepts. Automaton has 1382 states and 4784 transitions. Word has length 34 [2025-04-13 21:50:55,389 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:55,389 INFO L485 AbstractCegarLoop]: Abstraction has 1382 states and 4784 transitions. [2025-04-13 21:50:55,389 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:55,389 INFO L278 IsEmpty]: Start isEmpty. Operand 1382 states and 4784 transitions. [2025-04-13 21:50:55,392 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 21:50:55,392 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:55,392 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] [2025-04-13 21:50:55,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:50:55,392 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:50:55,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:55,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1883294890, now seen corresponding path program 4 times [2025-04-13 21:50:55,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:55,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282716377] [2025-04-13 21:50:55,393 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:50:55,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:55,400 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 21:50:55,407 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 21:50:55,407 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:50:55,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:55,494 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:50:55,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:55,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282716377] [2025-04-13 21:50:55,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282716377] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:55,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:55,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:50:55,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794462761] [2025-04-13 21:50:55,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:55,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:50:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:55,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:50:55,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:50:55,496 INFO L87 Difference]: Start difference. First operand 1382 states and 4784 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:55,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:55,575 INFO L93 Difference]: Finished difference Result 1382 states and 4784 transitions. [2025-04-13 21:50:55,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:50:55,576 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 21:50:55,576 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:55,590 INFO L225 Difference]: With dead ends: 1382 [2025-04-13 21:50:55,590 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 21:50:55,592 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:50:55,593 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:55,593 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 21:50:55,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 21:50:55,593 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:50:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 21:50:55,605 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2025-04-13 21:50:55,605 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:55,605 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 21:50:55,605 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:55,605 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 21:50:55,606 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 21:50:55,608 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 21:50:55,608 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 21:50:55,608 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 21:50:55,609 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 21:50:55,609 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 21:50:55,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:50:55,611 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2025-04-13 21:50:55,613 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:50:55,613 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:50:55,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:50:55 BasicIcfg [2025-04-13 21:50:55,615 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:50:55,616 INFO L158 Benchmark]: Toolchain (without parser) took 8056.44ms. Allocated memory was 125.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 83.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 276.5MB. Max. memory is 8.0GB. [2025-04-13 21:50:55,616 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:50:55,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.56ms. Allocated memory is still 125.8MB. Free memory was 82.6MB in the beginning and 59.8MB in the end (delta: 22.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:50:55,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.99ms. Allocated memory is still 125.8MB. Free memory was 59.8MB in the beginning and 57.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:50:55,616 INFO L158 Benchmark]: Boogie Preprocessor took 28.95ms. Allocated memory is still 125.8MB. Free memory was 57.4MB in the beginning and 55.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:50:55,616 INFO L158 Benchmark]: IcfgBuilder took 398.82ms. Allocated memory is still 125.8MB. Free memory was 55.6MB in the beginning and 29.6MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:50:55,617 INFO L158 Benchmark]: TraceAbstraction took 7157.48ms. Allocated memory was 125.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 29.0MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 221.9MB. Max. memory is 8.0GB. [2025-04-13 21:50:55,618 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 86.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 429.56ms. Allocated memory is still 125.8MB. Free memory was 82.6MB in the beginning and 59.8MB in the end (delta: 22.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.99ms. Allocated memory is still 125.8MB. Free memory was 59.8MB in the beginning and 57.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.95ms. Allocated memory is still 125.8MB. Free memory was 57.4MB in the beginning and 55.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 398.82ms. Allocated memory is still 125.8MB. Free memory was 55.6MB in the beginning and 29.6MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 7157.48ms. Allocated memory was 125.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 29.0MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 221.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 76 locations, 71 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.2s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 844 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 844 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 963 IncrementalHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 32 mSDtfsCounter, 963 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17607occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 760 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 21:50:55,631 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...