/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:32:00,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:32:00,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:32:00,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:32:00,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:32:00,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:32:00,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:32:00,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:32:00,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:32:00,996 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:32:00,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:32:00,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:32:00,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:32:00,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:32:00,997 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:32:00,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:32:00,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:32:00,997 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:32:00,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:32:00,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:32:00,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:32:00,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:32:00,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:32:00,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:32:00,997 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:32:00,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:32:00,997 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:32:00,997 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:32:00,997 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:32:00,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:32:00,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:32:00,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:32:00,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:32:00,999 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:32:01,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:32:01,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:32:01,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:32:01,236 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:32:01,238 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:32:01,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i [2025-04-13 23:32:02,519 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d1e271b/8a3f38b9f4f447708e01be10f0b2280c/FLAG58cd9308f [2025-04-13 23:32:02,776 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:32:02,776 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-100.i [2025-04-13 23:32:02,794 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d1e271b/8a3f38b9f4f447708e01be10f0b2280c/FLAG58cd9308f [2025-04-13 23:32:03,569 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d1e271b/8a3f38b9f4f447708e01be10f0b2280c [2025-04-13 23:32:03,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:32:03,572 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:32:03,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:32:03,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:32:03,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:32:03,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:32:03" (1/1) ... [2025-04-13 23:32:03,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ed0147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03, skipping insertion in model container [2025-04-13 23:32:03,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:32:03" (1/1) ... [2025-04-13 23:32:03,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:32:03,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-100.i[33026,33039] [2025-04-13 23:32:03,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:32:03,862 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:32:03,908 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-100.i[33026,33039] [2025-04-13 23:32:03,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:32:03,934 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:32:03,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03 WrapperNode [2025-04-13 23:32:03,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:32:03,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:32:03,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:32:03,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:32:03,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03" (1/1) ... [2025-04-13 23:32:03,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03" (1/1) ... [2025-04-13 23:32:03,963 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-04-13 23:32:03,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:32:03,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:32:03,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:32:03,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:32:03,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03" (1/1) ... [2025-04-13 23:32:03,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03" (1/1) ... [2025-04-13 23:32:03,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03" (1/1) ... [2025-04-13 23:32:03,988 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 23:32:03,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03" (1/1) ... [2025-04-13 23:32:03,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03" (1/1) ... [2025-04-13 23:32:03,991 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03" (1/1) ... [2025-04-13 23:32:03,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03" (1/1) ... [2025-04-13 23:32:03,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03" (1/1) ... [2025-04-13 23:32:03,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03" (1/1) ... [2025-04-13 23:32:03,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:32:03,996 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:32:03,996 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:32:03,996 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:32:03,996 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03" (1/1) ... [2025-04-13 23:32:04,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:32:04,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:04,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 23:32:04,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 23:32:04,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:32:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-13 23:32:04,042 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-13 23:32:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-13 23:32:04,042 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-13 23:32:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:32:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:32:04,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:32:04,043 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:32:04,125 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:32:04,126 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:32:04,227 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:32:04,228 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:32:04,228 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:32:04,315 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:32:04,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:32:04 BoogieIcfgContainer [2025-04-13 23:32:04,316 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:32:04,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:32:04,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:32:04,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:32:04,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:32:03" (1/3) ... [2025-04-13 23:32:04,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca2dc2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:32:04, skipping insertion in model container [2025-04-13 23:32:04,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:03" (2/3) ... [2025-04-13 23:32:04,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca2dc2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:32:04, skipping insertion in model container [2025-04-13 23:32:04,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:32:04" (3/3) ... [2025-04-13 23:32:04,322 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-100.i [2025-04-13 23:32:04,331 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:32:04,332 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-100.i that has 3 procedures, 21 locations, 20 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 23:32:04,332 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:32:04,368 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 23:32:04,385 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 22 transitions, 58 flow [2025-04-13 23:32:04,402 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 89 states, 86 states have (on average 2.453488372093023) internal successors, (211), 88 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:04,422 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:32:04,433 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;@2e2b9629, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:32:04,433 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:32:04,434 INFO L278 IsEmpty]: Start isEmpty. Operand has 89 states, 86 states have (on average 2.453488372093023) internal successors, (211), 88 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:04,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 23:32:04,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:04,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:32:04,438 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:04,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1446625350, now seen corresponding path program 1 times [2025-04-13 23:32:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:04,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215416627] [2025-04-13 23:32:04,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:04,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:32:04,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:32:04,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:04,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:04,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:04,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215416627] [2025-04-13 23:32:04,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215416627] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:04,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:04,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:32:04,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393490969] [2025-04-13 23:32:04,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:04,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:32:04,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:04,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:32:04,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:32:04,756 INFO L87 Difference]: Start difference. First operand has 89 states, 86 states have (on average 2.453488372093023) internal successors, (211), 88 states have internal predecessors, (211), 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 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:04,936 INFO L93 Difference]: Finished difference Result 175 states and 433 transitions. [2025-04-13 23:32:04,937 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:32:04,937 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2025-04-13 23:32:04,938 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:04,944 INFO L225 Difference]: With dead ends: 175 [2025-04-13 23:32:04,944 INFO L226 Difference]: Without dead ends: 144 [2025-04-13 23:32:04,946 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:32:04,948 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:04,949 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-13 23:32:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 111. [2025-04-13 23:32:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 108 states have (on average 2.4537037037037037) internal successors, (265), 110 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 265 transitions. [2025-04-13 23:32:04,981 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 265 transitions. Word has length 6 [2025-04-13 23:32:04,981 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:04,981 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 265 transitions. [2025-04-13 23:32:04,982 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:04,982 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 265 transitions. [2025-04-13 23:32:04,982 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 23:32:04,982 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:04,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:04,982 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:32:04,982 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:04,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:04,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1895713045, now seen corresponding path program 1 times [2025-04-13 23:32:04,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:04,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307275198] [2025-04-13 23:32:04,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:04,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:04,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:32:04,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:32:04,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:04,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:05,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:05,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307275198] [2025-04-13 23:32:05,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307275198] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:05,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777454239] [2025-04-13 23:32:05,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:05,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:05,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:05,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:05,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 23:32:05,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:32:05,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:32:05,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:05,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:05,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:32:05,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:05,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:05,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777454239] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:05,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:05,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 23:32:05,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721520681] [2025-04-13 23:32:05,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:05,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:05,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:05,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:05,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:05,269 INFO L87 Difference]: Start difference. First operand 111 states and 265 transitions. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:05,663 INFO L93 Difference]: Finished difference Result 241 states and 675 transitions. [2025-04-13 23:32:05,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:32:05,666 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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 7 [2025-04-13 23:32:05,666 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:05,668 INFO L225 Difference]: With dead ends: 241 [2025-04-13 23:32:05,668 INFO L226 Difference]: Without dead ends: 210 [2025-04-13 23:32:05,668 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:32:05,669 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:05,669 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:32:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-04-13 23:32:05,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 153. [2025-04-13 23:32:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 150 states have (on average 2.4466666666666668) internal successors, (367), 152 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:05,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2025-04-13 23:32:05,696 INFO L79 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 7 [2025-04-13 23:32:05,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:05,696 INFO L485 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2025-04-13 23:32:05,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:05,697 INFO L278 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2025-04-13 23:32:05,697 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 23:32:05,697 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:05,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:05,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 23:32:05,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:05,901 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:05,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:05,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1379861324, now seen corresponding path program 1 times [2025-04-13 23:32:05,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:05,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731770756] [2025-04-13 23:32:05,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:05,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:05,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:32:05,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:32:05,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:05,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:05,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:05,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731770756] [2025-04-13 23:32:05,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731770756] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:05,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:05,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:32:05,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089192331] [2025-04-13 23:32:05,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:05,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:32:05,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:05,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:32:05,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:32:05,988 INFO L87 Difference]: Start difference. First operand 153 states and 367 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:06,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:06,121 INFO L93 Difference]: Finished difference Result 291 states and 736 transitions. [2025-04-13 23:32:06,121 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:32:06,121 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2025-04-13 23:32:06,121 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:06,123 INFO L225 Difference]: With dead ends: 291 [2025-04-13 23:32:06,123 INFO L226 Difference]: Without dead ends: 248 [2025-04-13 23:32:06,124 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:32:06,124 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:06,124 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-04-13 23:32:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 191. [2025-04-13 23:32:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 188 states have (on average 2.452127659574468) internal successors, (461), 190 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 461 transitions. [2025-04-13 23:32:06,150 INFO L79 Accepts]: Start accepts. Automaton has 191 states and 461 transitions. Word has length 8 [2025-04-13 23:32:06,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:06,150 INFO L485 AbstractCegarLoop]: Abstraction has 191 states and 461 transitions. [2025-04-13 23:32:06,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:06,151 INFO L278 IsEmpty]: Start isEmpty. Operand 191 states and 461 transitions. [2025-04-13 23:32:06,151 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 23:32:06,151 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:06,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:06,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:32:06,151 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:06,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:06,151 INFO L85 PathProgramCache]: Analyzing trace with hash 173972077, now seen corresponding path program 1 times [2025-04-13 23:32:06,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:06,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41059489] [2025-04-13 23:32:06,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:06,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:06,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:32:06,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:32:06,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:06,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:06,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:06,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41059489] [2025-04-13 23:32:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41059489] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:06,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513782569] [2025-04-13 23:32:06,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:06,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:06,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:06,243 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:06,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 23:32:06,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:32:06,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:32:06,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:06,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:06,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:32:06,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:06,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:06,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513782569] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:06,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:06,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 23:32:06,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283616020] [2025-04-13 23:32:06,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:06,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:06,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:06,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:06,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:06,372 INFO L87 Difference]: Start difference. First operand 191 states and 461 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:06,647 INFO L93 Difference]: Finished difference Result 405 states and 1158 transitions. [2025-04-13 23:32:06,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:32:06,647 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-13 23:32:06,647 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:06,649 INFO L225 Difference]: With dead ends: 405 [2025-04-13 23:32:06,649 INFO L226 Difference]: Without dead ends: 362 [2025-04-13 23:32:06,650 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:32:06,650 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:06,650 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-04-13 23:32:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 260. [2025-04-13 23:32:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 257 states have (on average 2.4591439688715955) internal successors, (632), 259 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 632 transitions. [2025-04-13 23:32:06,670 INFO L79 Accepts]: Start accepts. Automaton has 260 states and 632 transitions. Word has length 9 [2025-04-13 23:32:06,670 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:06,671 INFO L485 AbstractCegarLoop]: Abstraction has 260 states and 632 transitions. [2025-04-13 23:32:06,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:06,671 INFO L278 IsEmpty]: Start isEmpty. Operand 260 states and 632 transitions. [2025-04-13 23:32:06,671 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 23:32:06,671 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:06,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:06,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 23:32:06,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-13 23:32:06,875 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:06,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:06,875 INFO L85 PathProgramCache]: Analyzing trace with hash 920789493, now seen corresponding path program 1 times [2025-04-13 23:32:06,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:06,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171182278] [2025-04-13 23:32:06,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:06,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:06,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:32:06,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:32:06,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:06,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:06,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:06,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171182278] [2025-04-13 23:32:06,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171182278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:06,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:06,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:32:06,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341554705] [2025-04-13 23:32:06,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:06,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:32:06,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:06,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:32:06,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:32:06,926 INFO L87 Difference]: Start difference. First operand 260 states and 632 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:07,044 INFO L93 Difference]: Finished difference Result 415 states and 1013 transitions. [2025-04-13 23:32:07,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:32:07,045 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2025-04-13 23:32:07,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:07,047 INFO L225 Difference]: With dead ends: 415 [2025-04-13 23:32:07,047 INFO L226 Difference]: Without dead ends: 378 [2025-04-13 23:32:07,047 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:32:07,048 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:07,048 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-04-13 23:32:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 260. [2025-04-13 23:32:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 257 states have (on average 2.4591439688715955) internal successors, (632), 259 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:07,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 632 transitions. [2025-04-13 23:32:07,073 INFO L79 Accepts]: Start accepts. Automaton has 260 states and 632 transitions. Word has length 10 [2025-04-13 23:32:07,073 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:07,073 INFO L485 AbstractCegarLoop]: Abstraction has 260 states and 632 transitions. [2025-04-13 23:32:07,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:07,073 INFO L278 IsEmpty]: Start isEmpty. Operand 260 states and 632 transitions. [2025-04-13 23:32:07,076 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 23:32:07,077 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:07,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:07,077 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:32:07,077 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:07,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:07,077 INFO L85 PathProgramCache]: Analyzing trace with hash 925431315, now seen corresponding path program 1 times [2025-04-13 23:32:07,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:07,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078926443] [2025-04-13 23:32:07,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:07,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:07,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:32:07,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:32:07,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:07,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:07,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:07,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078926443] [2025-04-13 23:32:07,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078926443] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:07,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:07,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:32:07,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888391578] [2025-04-13 23:32:07,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:07,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:32:07,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:07,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:32:07,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:32:07,142 INFO L87 Difference]: Start difference. First operand 260 states and 632 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:07,267 INFO L93 Difference]: Finished difference Result 410 states and 1003 transitions. [2025-04-13 23:32:07,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:32:07,268 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2025-04-13 23:32:07,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:07,271 INFO L225 Difference]: With dead ends: 410 [2025-04-13 23:32:07,271 INFO L226 Difference]: Without dead ends: 379 [2025-04-13 23:32:07,272 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:32:07,272 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:07,273 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-04-13 23:32:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 260. [2025-04-13 23:32:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 257 states have (on average 2.4591439688715955) internal successors, (632), 259 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 632 transitions. [2025-04-13 23:32:07,294 INFO L79 Accepts]: Start accepts. Automaton has 260 states and 632 transitions. Word has length 10 [2025-04-13 23:32:07,294 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:07,294 INFO L485 AbstractCegarLoop]: Abstraction has 260 states and 632 transitions. [2025-04-13 23:32:07,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:07,294 INFO L278 IsEmpty]: Start isEmpty. Operand 260 states and 632 transitions. [2025-04-13 23:32:07,295 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 23:32:07,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:07,295 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:07,295 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:32:07,295 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:07,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:07,295 INFO L85 PathProgramCache]: Analyzing trace with hash 662502406, now seen corresponding path program 2 times [2025-04-13 23:32:07,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:07,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888107661] [2025-04-13 23:32:07,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:32:07,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:07,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-13 23:32:07,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:32:07,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:32:07,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:07,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:07,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888107661] [2025-04-13 23:32:07,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888107661] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:07,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604994874] [2025-04-13 23:32:07,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:32:07,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:07,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:07,395 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:07,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 23:32:07,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-13 23:32:07,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:32:07,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:32:07,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:07,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:32:07,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:07,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:07,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604994874] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:07,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:07,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-13 23:32:07,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153732877] [2025-04-13 23:32:07,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:07,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:32:07,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:07,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:32:07,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:32:07,590 INFO L87 Difference]: Start difference. First operand 260 states and 632 transitions. Second operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:08,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:08,199 INFO L93 Difference]: Finished difference Result 662 states and 2007 transitions. [2025-04-13 23:32:08,199 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 23:32:08,199 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-13 23:32:08,199 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:08,203 INFO L225 Difference]: With dead ends: 662 [2025-04-13 23:32:08,203 INFO L226 Difference]: Without dead ends: 606 [2025-04-13 23:32:08,204 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=615, Invalid=1365, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 23:32:08,205 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 380 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:08,205 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 0 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:32:08,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-04-13 23:32:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 404. [2025-04-13 23:32:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 401 states have (on average 2.458852867830424) internal successors, (986), 403 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 986 transitions. [2025-04-13 23:32:08,258 INFO L79 Accepts]: Start accepts. Automaton has 404 states and 986 transitions. Word has length 10 [2025-04-13 23:32:08,258 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:08,259 INFO L485 AbstractCegarLoop]: Abstraction has 404 states and 986 transitions. [2025-04-13 23:32:08,259 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:08,259 INFO L278 IsEmpty]: Start isEmpty. Operand 404 states and 986 transitions. [2025-04-13 23:32:08,261 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 23:32:08,261 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:08,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:08,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 23:32:08,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:08,465 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:08,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:08,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1520296634, now seen corresponding path program 1 times [2025-04-13 23:32:08,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:08,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194097017] [2025-04-13 23:32:08,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:08,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:32:08,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:32:08,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:08,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:08,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:08,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194097017] [2025-04-13 23:32:08,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194097017] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:08,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201504508] [2025-04-13 23:32:08,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:08,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:08,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:08,535 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:08,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 23:32:08,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:32:08,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:32:08,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:08,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:08,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:32:08,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:08,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:08,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201504508] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:08,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 23:32:08,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372070030] [2025-04-13 23:32:08,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:08,663 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:08,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:08,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:08,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:08,664 INFO L87 Difference]: Start difference. First operand 404 states and 986 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:08,949 INFO L93 Difference]: Finished difference Result 691 states and 1757 transitions. [2025-04-13 23:32:08,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:32:08,950 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-13 23:32:08,950 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:08,953 INFO L225 Difference]: With dead ends: 691 [2025-04-13 23:32:08,953 INFO L226 Difference]: Without dead ends: 654 [2025-04-13 23:32:08,954 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2025-04-13 23:32:08,954 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:08,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-04-13 23:32:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 404. [2025-04-13 23:32:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 401 states have (on average 2.458852867830424) internal successors, (986), 403 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 986 transitions. [2025-04-13 23:32:09,014 INFO L79 Accepts]: Start accepts. Automaton has 404 states and 986 transitions. Word has length 11 [2025-04-13 23:32:09,014 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:09,014 INFO L485 AbstractCegarLoop]: Abstraction has 404 states and 986 transitions. [2025-04-13 23:32:09,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:09,014 INFO L278 IsEmpty]: Start isEmpty. Operand 404 states and 986 transitions. [2025-04-13 23:32:09,014 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 23:32:09,014 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:09,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:09,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 23:32:09,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:09,219 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:09,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:09,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1376400146, now seen corresponding path program 1 times [2025-04-13 23:32:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:09,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840942932] [2025-04-13 23:32:09,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:09,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:09,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:32:09,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:32:09,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:09,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:09,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:09,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840942932] [2025-04-13 23:32:09,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840942932] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:09,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980429897] [2025-04-13 23:32:09,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:09,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:09,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:09,267 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:09,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 23:32:09,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:32:09,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:32:09,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:09,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:09,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:32:09,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:09,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:09,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:09,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980429897] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:09,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:09,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 23:32:09,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984578641] [2025-04-13 23:32:09,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:09,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:09,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:09,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:09,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:09,378 INFO L87 Difference]: Start difference. First operand 404 states and 986 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:09,618 INFO L93 Difference]: Finished difference Result 761 states and 1983 transitions. [2025-04-13 23:32:09,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:32:09,618 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-13 23:32:09,618 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:09,621 INFO L225 Difference]: With dead ends: 761 [2025-04-13 23:32:09,622 INFO L226 Difference]: Without dead ends: 706 [2025-04-13 23:32:09,622 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2025-04-13 23:32:09,624 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:09,625 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:09,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-04-13 23:32:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 377. [2025-04-13 23:32:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 374 states have (on average 2.4572192513368982) internal successors, (919), 376 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 919 transitions. [2025-04-13 23:32:09,665 INFO L79 Accepts]: Start accepts. Automaton has 377 states and 919 transitions. Word has length 11 [2025-04-13 23:32:09,665 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:09,665 INFO L485 AbstractCegarLoop]: Abstraction has 377 states and 919 transitions. [2025-04-13 23:32:09,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:09,665 INFO L278 IsEmpty]: Start isEmpty. Operand 377 states and 919 transitions. [2025-04-13 23:32:09,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 23:32:09,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:09,666 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:09,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 23:32:09,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:09,866 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:09,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1223220492, now seen corresponding path program 2 times [2025-04-13 23:32:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:09,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198170548] [2025-04-13 23:32:09,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:32:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:09,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-13 23:32:09,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:32:09,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:32:09,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:09,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:09,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198170548] [2025-04-13 23:32:09,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198170548] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:09,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888951058] [2025-04-13 23:32:09,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:32:09,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:09,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:09,949 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:09,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 23:32:09,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-13 23:32:09,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:32:09,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:32:09,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:09,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:32:09,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:10,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:10,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888951058] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:10,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:10,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-13 23:32:10,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400444759] [2025-04-13 23:32:10,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:10,141 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:32:10,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:10,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:32:10,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:32:10,142 INFO L87 Difference]: Start difference. First operand 377 states and 919 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:10,747 INFO L93 Difference]: Finished difference Result 1145 states and 3468 transitions. [2025-04-13 23:32:10,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 23:32:10,747 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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 12 [2025-04-13 23:32:10,747 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:10,751 INFO L225 Difference]: With dead ends: 1145 [2025-04-13 23:32:10,752 INFO L226 Difference]: Without dead ends: 1078 [2025-04-13 23:32:10,752 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=615, Invalid=1365, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 23:32:10,753 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 339 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:10,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 0 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:32:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2025-04-13 23:32:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 614. [2025-04-13 23:32:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 611 states have (on average 2.4680851063829787) internal successors, (1508), 613 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1508 transitions. [2025-04-13 23:32:10,817 INFO L79 Accepts]: Start accepts. Automaton has 614 states and 1508 transitions. Word has length 12 [2025-04-13 23:32:10,817 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:10,817 INFO L485 AbstractCegarLoop]: Abstraction has 614 states and 1508 transitions. [2025-04-13 23:32:10,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:10,817 INFO L278 IsEmpty]: Start isEmpty. Operand 614 states and 1508 transitions. [2025-04-13 23:32:10,818 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 23:32:10,818 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:10,818 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:10,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 23:32:11,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:11,019 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:11,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash -726733259, now seen corresponding path program 2 times [2025-04-13 23:32:11,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:11,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476377940] [2025-04-13 23:32:11,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:32:11,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:11,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 23:32:11,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:32:11,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:32:11,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:11,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:11,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476377940] [2025-04-13 23:32:11,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476377940] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:11,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905916714] [2025-04-13 23:32:11,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:32:11,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:11,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:11,116 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:11,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 23:32:11,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 23:32:11,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:32:11,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:32:11,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:11,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:32:11,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:11,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:11,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905916714] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:11,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:11,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-13 23:32:11,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132509118] [2025-04-13 23:32:11,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:11,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:32:11,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:11,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:32:11,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:32:11,298 INFO L87 Difference]: Start difference. First operand 614 states and 1508 transitions. Second operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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 23:32:11,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:11,777 INFO L93 Difference]: Finished difference Result 1309 states and 3503 transitions. [2025-04-13 23:32:11,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:11,777 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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 14 [2025-04-13 23:32:11,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:11,782 INFO L225 Difference]: With dead ends: 1309 [2025-04-13 23:32:11,782 INFO L226 Difference]: Without dead ends: 1242 [2025-04-13 23:32:11,783 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:32:11,783 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:11,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-04-13 23:32:11,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 588. [2025-04-13 23:32:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 585 states have (on average 2.466666666666667) internal successors, (1443), 587 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1443 transitions. [2025-04-13 23:32:11,875 INFO L79 Accepts]: Start accepts. Automaton has 588 states and 1443 transitions. Word has length 14 [2025-04-13 23:32:11,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:11,875 INFO L485 AbstractCegarLoop]: Abstraction has 588 states and 1443 transitions. [2025-04-13 23:32:11,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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 23:32:11,875 INFO L278 IsEmpty]: Start isEmpty. Operand 588 states and 1443 transitions. [2025-04-13 23:32:11,875 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 23:32:11,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:11,875 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:11,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 23:32:12,076 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:12,076 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:12,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:12,077 INFO L85 PathProgramCache]: Analyzing trace with hash -283814701, now seen corresponding path program 2 times [2025-04-13 23:32:12,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:12,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719503813] [2025-04-13 23:32:12,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:32:12,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:12,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 23:32:12,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:32:12,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:32:12,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:12,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:12,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719503813] [2025-04-13 23:32:12,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719503813] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:12,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276211069] [2025-04-13 23:32:12,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:32:12,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:12,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:12,163 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:12,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 23:32:12,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 23:32:12,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:32:12,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:32:12,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:12,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:32:12,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:12,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:12,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276211069] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:12,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:12,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-13 23:32:12,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563888058] [2025-04-13 23:32:12,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:12,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:32:12,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:12,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:32:12,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:32:12,330 INFO L87 Difference]: Start difference. First operand 588 states and 1443 transitions. Second operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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 23:32:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:12,844 INFO L93 Difference]: Finished difference Result 1307 states and 3504 transitions. [2025-04-13 23:32:12,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:12,844 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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 14 [2025-04-13 23:32:12,844 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:12,849 INFO L225 Difference]: With dead ends: 1307 [2025-04-13 23:32:12,849 INFO L226 Difference]: Without dead ends: 1252 [2025-04-13 23:32:12,850 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:32:12,850 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 257 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:12,851 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 0 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-04-13 23:32:12,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 559. [2025-04-13 23:32:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 556 states have (on average 2.4658273381294964) internal successors, (1371), 558 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1371 transitions. [2025-04-13 23:32:12,943 INFO L79 Accepts]: Start accepts. Automaton has 559 states and 1371 transitions. Word has length 14 [2025-04-13 23:32:12,943 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:12,943 INFO L485 AbstractCegarLoop]: Abstraction has 559 states and 1371 transitions. [2025-04-13 23:32:12,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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 23:32:12,944 INFO L278 IsEmpty]: Start isEmpty. Operand 559 states and 1371 transitions. [2025-04-13 23:32:12,944 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:32:12,944 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:12,944 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:12,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 23:32:13,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 23:32:13,148 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:13,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1954180698, now seen corresponding path program 3 times [2025-04-13 23:32:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:13,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601888775] [2025-04-13 23:32:13,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:13,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 6 equivalence classes. [2025-04-13 23:32:13,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 16 statements. [2025-04-13 23:32:13,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:32:13,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 23:32:13,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:13,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601888775] [2025-04-13 23:32:13,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601888775] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:13,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129087626] [2025-04-13 23:32:13,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:13,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:13,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:13,244 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:13,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 23:32:13,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 6 equivalence classes. [2025-04-13 23:32:13,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 16 statements. [2025-04-13 23:32:13,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:32:13,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:13,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:32:13,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 23:32:13,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:32:13,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129087626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:13,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:32:13,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-13 23:32:13,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767171] [2025-04-13 23:32:13,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:13,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:32:13,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:13,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:32:13,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:32:13,311 INFO L87 Difference]: Start difference. First operand 559 states and 1371 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:13,805 INFO L93 Difference]: Finished difference Result 1309 states and 3261 transitions. [2025-04-13 23:32:13,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:32:13,805 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:32:13,805 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:13,809 INFO L225 Difference]: With dead ends: 1309 [2025-04-13 23:32:13,809 INFO L226 Difference]: Without dead ends: 1225 [2025-04-13 23:32:13,809 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:32:13,810 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:13,810 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:13,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-04-13 23:32:13,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 861. [2025-04-13 23:32:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 858 states have (on average 2.5093240093240095) internal successors, (2153), 860 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 2153 transitions. [2025-04-13 23:32:14,001 INFO L79 Accepts]: Start accepts. Automaton has 861 states and 2153 transitions. Word has length 16 [2025-04-13 23:32:14,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:14,001 INFO L485 AbstractCegarLoop]: Abstraction has 861 states and 2153 transitions. [2025-04-13 23:32:14,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:14,001 INFO L278 IsEmpty]: Start isEmpty. Operand 861 states and 2153 transitions. [2025-04-13 23:32:14,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:32:14,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:14,002 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:14,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 23:32:14,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 23:32:14,203 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:14,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash -452280236, now seen corresponding path program 3 times [2025-04-13 23:32:14,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:14,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713178932] [2025-04-13 23:32:14,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:14,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:14,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-13 23:32:14,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-04-13 23:32:14,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:32:14,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 23:32:14,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:14,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713178932] [2025-04-13 23:32:14,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713178932] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:14,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207935913] [2025-04-13 23:32:14,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:14,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:14,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:14,259 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:14,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 23:32:14,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-13 23:32:14,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-04-13 23:32:14,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:32:14,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:14,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:32:14,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 23:32:14,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:32:14,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207935913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:14,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:32:14,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-13 23:32:14,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617376273] [2025-04-13 23:32:14,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:14,318 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:32:14,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:14,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:32:14,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:32:14,318 INFO L87 Difference]: Start difference. First operand 861 states and 2153 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:14,925 INFO L93 Difference]: Finished difference Result 1485 states and 3726 transitions. [2025-04-13 23:32:14,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:32:14,926 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:32:14,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:14,929 INFO L225 Difference]: With dead ends: 1485 [2025-04-13 23:32:14,929 INFO L226 Difference]: Without dead ends: 713 [2025-04-13 23:32:14,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:32:14,930 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:14,930 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:14,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-04-13 23:32:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2025-04-13 23:32:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 711 states have (on average 2.4753867791842477) internal successors, (1760), 712 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:15,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1760 transitions. [2025-04-13 23:32:15,111 INFO L79 Accepts]: Start accepts. Automaton has 713 states and 1760 transitions. Word has length 18 [2025-04-13 23:32:15,111 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:15,111 INFO L485 AbstractCegarLoop]: Abstraction has 713 states and 1760 transitions. [2025-04-13 23:32:15,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:15,111 INFO L278 IsEmpty]: Start isEmpty. Operand 713 states and 1760 transitions. [2025-04-13 23:32:15,112 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:32:15,112 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:15,112 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:15,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 23:32:15,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 23:32:15,317 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:15,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:15,317 INFO L85 PathProgramCache]: Analyzing trace with hash 708764821, now seen corresponding path program 3 times [2025-04-13 23:32:15,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:15,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026659504] [2025-04-13 23:32:15,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:15,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:15,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-13 23:32:15,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:32:15,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:32:15,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:15,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026659504] [2025-04-13 23:32:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026659504] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:15,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522659853] [2025-04-13 23:32:15,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:15,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:15,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:15,468 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:15,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 23:32:15,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-13 23:32:15,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:32:15,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:32:15,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:15,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:32:15,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:15,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:15,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522659853] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:15,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:15,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-04-13 23:32:15,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379619165] [2025-04-13 23:32:15,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:15,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:32:15,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:15,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:32:15,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=1075, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:32:15,854 INFO L87 Difference]: Start difference. First operand 713 states and 1760 transitions. Second operand has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:16,590 INFO L93 Difference]: Finished difference Result 1051 states and 2891 transitions. [2025-04-13 23:32:16,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 23:32:16,590 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 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 20 [2025-04-13 23:32:16,590 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:16,594 INFO L225 Difference]: With dead ends: 1051 [2025-04-13 23:32:16,594 INFO L226 Difference]: Without dead ends: 1025 [2025-04-13 23:32:16,595 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1350, Invalid=2810, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 23:32:16,596 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 389 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:16,596 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 0 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-04-13 23:32:16,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1025. [2025-04-13 23:32:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1023 states have (on average 2.482893450635386) internal successors, (2540), 1024 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 2540 transitions. [2025-04-13 23:32:16,836 INFO L79 Accepts]: Start accepts. Automaton has 1025 states and 2540 transitions. Word has length 20 [2025-04-13 23:32:16,836 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:16,836 INFO L485 AbstractCegarLoop]: Abstraction has 1025 states and 2540 transitions. [2025-04-13 23:32:16,836 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:16,837 INFO L278 IsEmpty]: Start isEmpty. Operand 1025 states and 2540 transitions. [2025-04-13 23:32:16,837 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:32:16,837 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:16,837 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:16,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 23:32:17,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 23:32:17,038 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:17,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:17,038 INFO L85 PathProgramCache]: Analyzing trace with hash -865218829, now seen corresponding path program 3 times [2025-04-13 23:32:17,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:17,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346084390] [2025-04-13 23:32:17,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:17,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-13 23:32:17,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:32:17,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:32:17,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:17,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:17,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346084390] [2025-04-13 23:32:17,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346084390] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:17,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091993205] [2025-04-13 23:32:17,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:17,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:17,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:17,195 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:17,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 23:32:17,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-13 23:32:17,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:32:17,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:32:17,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:17,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:32:17,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:17,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:17,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091993205] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:17,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:17,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-04-13 23:32:17,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470196503] [2025-04-13 23:32:17,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:17,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:32:17,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:17,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:32:17,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=1075, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:32:17,566 INFO L87 Difference]: Start difference. First operand 1025 states and 2540 transitions. Second operand has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:18,581 INFO L93 Difference]: Finished difference Result 1376 states and 3708 transitions. [2025-04-13 23:32:18,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 23:32:18,581 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 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 20 [2025-04-13 23:32:18,581 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:18,586 INFO L225 Difference]: With dead ends: 1376 [2025-04-13 23:32:18,586 INFO L226 Difference]: Without dead ends: 1349 [2025-04-13 23:32:18,587 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1350, Invalid=2810, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 23:32:18,587 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 456 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:18,588 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 0 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:32:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2025-04-13 23:32:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2025-04-13 23:32:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1347 states have (on average 2.482553823311062) internal successors, (3344), 1348 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 3344 transitions. [2025-04-13 23:32:18,873 INFO L79 Accepts]: Start accepts. Automaton has 1349 states and 3344 transitions. Word has length 20 [2025-04-13 23:32:18,873 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:18,873 INFO L485 AbstractCegarLoop]: Abstraction has 1349 states and 3344 transitions. [2025-04-13 23:32:18,873 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:18,873 INFO L278 IsEmpty]: Start isEmpty. Operand 1349 states and 3344 transitions. [2025-04-13 23:32:18,875 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:32:18,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:18,875 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:18,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 23:32:19,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 23:32:19,076 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:19,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:19,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1136264875, now seen corresponding path program 4 times [2025-04-13 23:32:19,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:19,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848974867] [2025-04-13 23:32:19,076 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:32:19,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:19,080 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:32:19,084 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:32:19,084 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:32:19,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:19,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:19,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848974867] [2025-04-13 23:32:19,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848974867] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:19,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623788516] [2025-04-13 23:32:19,465 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:32:19,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:19,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:19,467 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:19,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 23:32:19,501 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:32:19,515 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:32:19,515 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:32:19,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:19,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 23:32:19,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:19,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:20,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623788516] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:20,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:20,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 75 [2025-04-13 23:32:20,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724053118] [2025-04-13 23:32:20,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:20,404 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-04-13 23:32:20,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:20,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-04-13 23:32:20,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2247, Invalid=3605, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 23:32:20,406 INFO L87 Difference]: Start difference. First operand 1349 states and 3344 transitions. Second operand has 77 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:22,266 INFO L93 Difference]: Finished difference Result 1999 states and 5567 transitions. [2025-04-13 23:32:22,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 23:32:22,266 INFO L79 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:32:22,266 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:22,274 INFO L225 Difference]: With dead ends: 1999 [2025-04-13 23:32:22,274 INFO L226 Difference]: Without dead ends: 1973 [2025-04-13 23:32:22,277 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4547 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5114, Invalid=10386, Unknown=0, NotChecked=0, Total=15500 [2025-04-13 23:32:22,278 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 869 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:22,278 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 0 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:32:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2025-04-13 23:32:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1973. [2025-04-13 23:32:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1973 states, 1971 states have (on average 2.4880771182141044) internal successors, (4904), 1972 states have internal predecessors, (4904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 4904 transitions. [2025-04-13 23:32:22,678 INFO L79 Accepts]: Start accepts. Automaton has 1973 states and 4904 transitions. Word has length 32 [2025-04-13 23:32:22,678 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:22,678 INFO L485 AbstractCegarLoop]: Abstraction has 1973 states and 4904 transitions. [2025-04-13 23:32:22,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:22,678 INFO L278 IsEmpty]: Start isEmpty. Operand 1973 states and 4904 transitions. [2025-04-13 23:32:22,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:32:22,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:22,680 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:22,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 23:32:22,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 23:32:22,880 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:22,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2006743859, now seen corresponding path program 4 times [2025-04-13 23:32:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:22,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751167364] [2025-04-13 23:32:22,881 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:32:22,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:22,885 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:32:22,896 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:32:22,896 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:32:22,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:23,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:23,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751167364] [2025-04-13 23:32:23,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751167364] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:23,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901945225] [2025-04-13 23:32:23,310 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:32:23,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:23,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:23,311 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:23,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 23:32:23,341 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:32:23,352 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:32:23,352 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:32:23,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:23,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 23:32:23,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:23,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:24,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901945225] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:24,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:24,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 76 [2025-04-13 23:32:24,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835053534] [2025-04-13 23:32:24,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:24,264 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-04-13 23:32:24,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:24,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-04-13 23:32:24,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2253, Invalid=3753, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 23:32:24,266 INFO L87 Difference]: Start difference. First operand 1973 states and 4904 transitions. Second operand has 78 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 77 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:26,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:26,435 INFO L93 Difference]: Finished difference Result 2648 states and 7200 transitions. [2025-04-13 23:32:26,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 23:32:26,435 INFO L79 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 77 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:32:26,435 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:26,444 INFO L225 Difference]: With dead ends: 2648 [2025-04-13 23:32:26,444 INFO L226 Difference]: Without dead ends: 2621 [2025-04-13 23:32:26,447 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4648 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5114, Invalid=10386, Unknown=0, NotChecked=0, Total=15500 [2025-04-13 23:32:26,448 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 917 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:26,448 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 0 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:32:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2025-04-13 23:32:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 2621. [2025-04-13 23:32:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2621 states, 2619 states have (on average 2.486445208094693) internal successors, (6512), 2620 states have internal predecessors, (6512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2621 states and 6512 transitions. [2025-04-13 23:32:27,010 INFO L79 Accepts]: Start accepts. Automaton has 2621 states and 6512 transitions. Word has length 32 [2025-04-13 23:32:27,010 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:27,010 INFO L485 AbstractCegarLoop]: Abstraction has 2621 states and 6512 transitions. [2025-04-13 23:32:27,010 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 77 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:27,010 INFO L278 IsEmpty]: Start isEmpty. Operand 2621 states and 6512 transitions. [2025-04-13 23:32:27,014 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 23:32:27,014 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:27,014 INFO L218 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:27,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 23:32:27,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:27,215 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:27,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:27,215 INFO L85 PathProgramCache]: Analyzing trace with hash 836289237, now seen corresponding path program 5 times [2025-04-13 23:32:27,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:27,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94596552] [2025-04-13 23:32:27,215 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:32:27,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:27,219 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-13 23:32:27,252 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 23:32:27,252 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-13 23:32:27,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:28,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:28,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94596552] [2025-04-13 23:32:28,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94596552] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:28,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741065303] [2025-04-13 23:32:28,214 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:32:28,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:28,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:28,216 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:28,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 23:32:28,256 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-13 23:32:28,281 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 23:32:28,281 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-13 23:32:28,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:28,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 23:32:28,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:29,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:29,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:31,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741065303] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:31,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:31,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2025-04-13 23:32:31,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379130654] [2025-04-13 23:32:31,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:31,220 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2025-04-13 23:32:31,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:31,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2025-04-13 23:32:31,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9087, Invalid=12965, Unknown=0, NotChecked=0, Total=22052 [2025-04-13 23:32:31,224 INFO L87 Difference]: Start difference. First operand 2621 states and 6512 transitions. Second operand has 149 states, 148 states have (on average 1.0810810810810811) internal successors, (160), 148 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:36,940 INFO L93 Difference]: Finished difference Result 3895 states and 10919 transitions. [2025-04-13 23:32:36,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 23:32:36,941 INFO L79 Accepts]: Start accepts. Automaton has has 149 states, 148 states have (on average 1.0810810810810811) internal successors, (160), 148 states have internal predecessors, (160), 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 56 [2025-04-13 23:32:36,941 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:36,952 INFO L225 Difference]: With dead ends: 3895 [2025-04-13 23:32:36,952 INFO L226 Difference]: Without dead ends: 3869 [2025-04-13 23:32:36,955 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18323 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=20006, Invalid=39774, Unknown=0, NotChecked=0, Total=59780 [2025-04-13 23:32:36,955 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1898 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:36,956 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 0 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:32:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2025-04-13 23:32:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 3869. [2025-04-13 23:32:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3869 states, 3867 states have (on average 2.490819756917507) internal successors, (9632), 3868 states have internal predecessors, (9632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3869 states to 3869 states and 9632 transitions. [2025-04-13 23:32:37,764 INFO L79 Accepts]: Start accepts. Automaton has 3869 states and 9632 transitions. Word has length 56 [2025-04-13 23:32:37,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:37,765 INFO L485 AbstractCegarLoop]: Abstraction has 3869 states and 9632 transitions. [2025-04-13 23:32:37,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 148 states have (on average 1.0810810810810811) internal successors, (160), 148 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:37,765 INFO L278 IsEmpty]: Start isEmpty. Operand 3869 states and 9632 transitions. [2025-04-13 23:32:37,769 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 23:32:37,769 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:37,769 INFO L218 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:37,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 23:32:37,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:37,969 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:37,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:37,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2011739059, now seen corresponding path program 5 times [2025-04-13 23:32:37,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:37,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136807998] [2025-04-13 23:32:37,970 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:32:37,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:37,975 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-13 23:32:37,991 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 23:32:37,991 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-13 23:32:37,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:39,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136807998] [2025-04-13 23:32:39,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136807998] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:39,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95834008] [2025-04-13 23:32:39,047 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:32:39,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:39,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:39,049 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:39,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 23:32:39,083 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-13 23:32:39,109 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 23:32:39,109 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-13 23:32:39,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:39,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 23:32:39,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:39,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:42,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95834008] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:42,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:42,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2025-04-13 23:32:42,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266166577] [2025-04-13 23:32:42,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:42,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2025-04-13 23:32:42,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:42,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2025-04-13 23:32:42,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9087, Invalid=12965, Unknown=0, NotChecked=0, Total=22052 [2025-04-13 23:32:42,028 INFO L87 Difference]: Start difference. First operand 3869 states and 9632 transitions. Second operand has 149 states, 148 states have (on average 1.0810810810810811) internal successors, (160), 148 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:48,362 INFO L93 Difference]: Finished difference Result 5192 states and 14184 transitions. [2025-04-13 23:32:48,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 23:32:48,363 INFO L79 Accepts]: Start accepts. Automaton has has 149 states, 148 states have (on average 1.0810810810810811) internal successors, (160), 148 states have internal predecessors, (160), 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 56 [2025-04-13 23:32:48,363 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:48,374 INFO L225 Difference]: With dead ends: 5192 [2025-04-13 23:32:48,374 INFO L226 Difference]: Without dead ends: 5165 [2025-04-13 23:32:48,377 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18323 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=20006, Invalid=39774, Unknown=0, NotChecked=0, Total=59780 [2025-04-13 23:32:48,377 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 2386 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2386 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:48,377 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2386 Valid, 0 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:32:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2025-04-13 23:32:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 5165. [2025-04-13 23:32:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5163 states have (on average 2.4884756924268836) internal successors, (12848), 5164 states have internal predecessors, (12848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 12848 transitions. [2025-04-13 23:32:49,354 INFO L79 Accepts]: Start accepts. Automaton has 5165 states and 12848 transitions. Word has length 56 [2025-04-13 23:32:49,354 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:49,354 INFO L485 AbstractCegarLoop]: Abstraction has 5165 states and 12848 transitions. [2025-04-13 23:32:49,355 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 148 states have (on average 1.0810810810810811) internal successors, (160), 148 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:49,355 INFO L278 IsEmpty]: Start isEmpty. Operand 5165 states and 12848 transitions. [2025-04-13 23:32:49,361 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-04-13 23:32:49,361 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:49,361 INFO L218 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:49,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 23:32:49,562 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:49,562 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:49,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1370434091, now seen corresponding path program 6 times [2025-04-13 23:32:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:49,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179350656] [2025-04-13 23:32:49,562 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:32:49,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:49,568 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-13 23:32:49,589 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-13 23:32:49,589 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-13 23:32:49,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:53,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:53,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179350656] [2025-04-13 23:32:53,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179350656] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:32:53,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134796166] [2025-04-13 23:32:53,139 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:32:53,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:53,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:53,141 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:53,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 23:32:53,182 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-13 23:32:53,226 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-13 23:32:53,226 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-13 23:32:53,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:53,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-04-13 23:32:53,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:56,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:32:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:59,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134796166] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:32:59,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:32:59,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 202 [2025-04-13 23:32:59,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446011657] [2025-04-13 23:32:59,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:32:59,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 204 states [2025-04-13 23:32:59,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:59,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2025-04-13 23:32:59,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=26265, Unknown=0, NotChecked=0, Total=41412 [2025-04-13 23:32:59,680 INFO L87 Difference]: Start difference. First operand 5165 states and 12848 transitions. Second operand has 204 states, 203 states have (on average 1.064039408866995) internal successors, (216), 203 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:08,075 INFO L93 Difference]: Finished difference Result 5373 states and 13524 transitions. [2025-04-13 23:33:08,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-04-13 23:33:08,075 INFO L79 Accepts]: Start accepts. Automaton has has 204 states, 203 states have (on average 1.064039408866995) internal successors, (216), 203 states have internal predecessors, (216), 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 104 [2025-04-13 23:33:08,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:08,087 INFO L225 Difference]: With dead ends: 5373 [2025-04-13 23:33:08,087 INFO L226 Difference]: Without dead ends: 5347 [2025-04-13 23:33:08,091 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 13 SyntacticMatches, 89 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43524 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=30933, Invalid=63009, Unknown=0, NotChecked=0, Total=93942 [2025-04-13 23:33:08,091 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 2712 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2712 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:08,092 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2712 Valid, 0 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:33:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5347 states. [2025-04-13 23:33:09,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5347 to 5347. [2025-04-13 23:33:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5347 states, 5345 states have (on average 2.488868101028999) internal successors, (13303), 5346 states have internal predecessors, (13303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5347 states to 5347 states and 13303 transitions. [2025-04-13 23:33:09,140 INFO L79 Accepts]: Start accepts. Automaton has 5347 states and 13303 transitions. Word has length 104 [2025-04-13 23:33:09,141 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:09,141 INFO L485 AbstractCegarLoop]: Abstraction has 5347 states and 13303 transitions. [2025-04-13 23:33:09,141 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 204 states, 203 states have (on average 1.064039408866995) internal successors, (216), 203 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:09,141 INFO L278 IsEmpty]: Start isEmpty. Operand 5347 states and 13303 transitions. [2025-04-13 23:33:09,146 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-04-13 23:33:09,146 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:09,146 INFO L218 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:09,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 23:33:09,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:33:09,347 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:33:09,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1812159309, now seen corresponding path program 6 times [2025-04-13 23:33:09,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:09,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440772675] [2025-04-13 23:33:09,347 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:33:09,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:09,352 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-13 23:33:09,367 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-13 23:33:09,367 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-13 23:33:09,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:12,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:12,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440772675] [2025-04-13 23:33:12,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440772675] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:33:12,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395924489] [2025-04-13 23:33:12,598 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:33:12,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:33:12,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:33:12,599 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:33:12,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 23:33:12,636 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-13 23:33:12,677 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-13 23:33:12,677 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-13 23:33:12,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:12,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-04-13 23:33:12,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:33:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:15,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:33:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:18,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395924489] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:33:18,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:33:18,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 201 [2025-04-13 23:33:18,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231004906] [2025-04-13 23:33:18,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:33:18,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 203 states [2025-04-13 23:33:18,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:18,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2025-04-13 23:33:18,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14950, Invalid=26056, Unknown=0, NotChecked=0, Total=41006 [2025-04-13 23:33:18,954 INFO L87 Difference]: Start difference. First operand 5347 states and 13303 transitions. Second operand has 203 states, 202 states have (on average 1.0643564356435644) internal successors, (215), 202 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:28,270 INFO L93 Difference]: Finished difference Result 5536 states and 13907 transitions. [2025-04-13 23:33:28,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-04-13 23:33:28,270 INFO L79 Accepts]: Start accepts. Automaton has has 203 states, 202 states have (on average 1.0643564356435644) internal successors, (215), 202 states have internal predecessors, (215), 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 104 [2025-04-13 23:33:28,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:28,282 INFO L225 Difference]: With dead ends: 5536 [2025-04-13 23:33:28,282 INFO L226 Difference]: Without dead ends: 5509 [2025-04-13 23:33:28,286 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 13 SyntacticMatches, 90 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43143 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=30525, Invalid=62195, Unknown=0, NotChecked=0, Total=92720 [2025-04-13 23:33:28,287 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 3813 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3813 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:28,287 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3813 Valid, 0 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2025-04-13 23:33:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5509. [2025-04-13 23:33:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5509 states, 5507 states have (on average 2.488650808062466) internal successors, (13705), 5508 states have internal predecessors, (13705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 13705 transitions. [2025-04-13 23:33:29,380 INFO L79 Accepts]: Start accepts. Automaton has 5509 states and 13705 transitions. Word has length 104 [2025-04-13 23:33:29,380 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:29,380 INFO L485 AbstractCegarLoop]: Abstraction has 5509 states and 13705 transitions. [2025-04-13 23:33:29,380 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 203 states, 202 states have (on average 1.0643564356435644) internal successors, (215), 202 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:29,380 INFO L278 IsEmpty]: Start isEmpty. Operand 5509 states and 13705 transitions. [2025-04-13 23:33:29,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-04-13 23:33:29,386 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:29,386 INFO L218 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:29,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 23:33:29,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:33:29,587 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:33:29,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:29,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1037154003, now seen corresponding path program 7 times [2025-04-13 23:33:29,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:29,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018437156] [2025-04-13 23:33:29,588 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:33:29,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:29,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 23:33:29,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 23:33:29,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:33:29,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:33:29,613 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:33:29,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 23:33:29,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 23:33:29,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:33:29,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:33:29,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:33:29,694 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:33:29,695 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 23:33:29,696 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-13 23:33:29,696 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 23:33:29,696 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 23:33:29,696 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 23:33:29,696 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 23:33:29,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 23:33:29,699 INFO L422 BasicCegarLoop]: Path program histogram: [7, 6, 3, 3, 1, 1, 1, 1] [2025-04-13 23:33:29,826 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:33:29,826 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:33:29,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:33:29 BasicIcfg [2025-04-13 23:33:29,828 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:33:29,831 INFO L158 Benchmark]: Toolchain (without parser) took 86257.02ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 97.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 798.2MB. Max. memory is 8.0GB. [2025-04-13 23:33:29,831 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:33:29,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.83ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 74.0MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 23:33:29,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.59ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 72.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:33:29,832 INFO L158 Benchmark]: Boogie Preprocessor took 31.18ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 70.7MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:33:29,832 INFO L158 Benchmark]: IcfgBuilder took 320.02ms. Allocated memory is still 142.6MB. Free memory was 70.7MB in the beginning and 48.0MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 23:33:29,832 INFO L158 Benchmark]: TraceAbstraction took 85511.32ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 47.1MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 747.9MB. Max. memory is 8.0GB. [2025-04-13 23:33:29,833 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 361.83ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 74.0MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.59ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 72.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 31.18ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 70.7MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 320.02ms. Allocated memory is still 142.6MB. Free memory was 70.7MB in the beginning and 48.0MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 85511.32ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 47.1MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 747.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 - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 100 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=100, limit=0, t1=-1] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=100, limit=0, t1=-1, t2=0] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=100, limit=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=101, limit=0] [L768] 2 limit = lim VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=101, limit=101] [L759] 1 limit = lim VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=100, limit=100] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=101, limit=100] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression [L753] 2 reach_error() VAL [\at(expression, Pre)=0, _N=100, expression=0, limit=100] - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 35 locations, 38 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 85.3s, OverallIterations: 23, TraceHistogramMax: 100, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 40.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15420 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15420 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8644 IncrementalHoareTripleChecker+Invalid, 8722 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 0 mSDtfsCounter, 8644 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2135 GetRequests, 216 SyntacticMatches, 179 SemanticMatches, 1740 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136408 ImplicationChecksByTransitivity, 45.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5509occurred in iteration=22, InterpolantAutomatonStates: 729, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 3442 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 33.0s InterpolantComputationTime, 1236 NumberOfCodeBlocks, 1204 NumberOfCodeBlocksAsserted, 357 NumberOfCheckSat, 1582 ConstructedInterpolants, 0 QuantifiedInterpolants, 7794 SizeOfPredicates, 50 NumberOfNonLiveVariables, 2430 ConjunctsInSsa, 480 ConjunctsInUnsatCore, 56 InterpolantComputations, 6 PerfectInterpolantSequences, 200/35476 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 RESULT: Ultimate proved your program to be incorrect! [2025-04-13 23:33:29,845 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...