/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:51:22,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:51:22,371 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 18:51:22,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:51:22,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:51:22,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:51:22,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:51:22,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:51:22,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:51:22,392 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:51:22,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:51:22,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:51:22,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:51:22,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:51:22,392 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:51:22,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:51:22,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:51:22,392 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:51:22,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:51:22,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:51:22,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:51:22,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:51:22,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:51:22,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:51:22,393 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:51:22,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:51:22,393 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:51:22,393 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:51:22,393 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:51:22,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:51:22,393 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:51:22,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:51:22,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:51:22,393 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:51:22,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:51:22,393 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:51:22,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:51:22,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:51:22,394 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:51:22,394 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:51:22,394 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:51:22,394 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:51:22,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:51:22,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:51:22,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:51:22,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:51:22,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:51:22,394 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 [2025-04-13 18:51:22,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:51:22,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:51:22,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:51:22,621 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:51:22,622 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:51:22,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2025-04-13 18:51:23,866 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c9b0e8a/f4a140d4c1fd42309a1353c94272dead/FLAGbd20b3145 [2025-04-13 18:51:24,069 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:51:24,070 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2025-04-13 18:51:24,076 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c9b0e8a/f4a140d4c1fd42309a1353c94272dead/FLAGbd20b3145 [2025-04-13 18:51:24,866 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c9b0e8a/f4a140d4c1fd42309a1353c94272dead [2025-04-13 18:51:24,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:51:24,869 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:51:24,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:51:24,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:51:24,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:51:24,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:51:24" (1/1) ... [2025-04-13 18:51:24,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c2cf15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:24, skipping insertion in model container [2025-04-13 18:51:24,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:51:24" (1/1) ... [2025-04-13 18:51:24,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:51:25,067 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2454,2467] [2025-04-13 18:51:25,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:51:25,086 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:51:25,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2454,2467] [2025-04-13 18:51:25,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:51:25,132 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:51:25,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25 WrapperNode [2025-04-13 18:51:25,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:51:25,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:51:25,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:51:25,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:51:25,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25" (1/1) ... [2025-04-13 18:51:25,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25" (1/1) ... [2025-04-13 18:51:25,161 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 118 [2025-04-13 18:51:25,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:51:25,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:51:25,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:51:25,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:51:25,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25" (1/1) ... [2025-04-13 18:51:25,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25" (1/1) ... [2025-04-13 18:51:25,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25" (1/1) ... [2025-04-13 18:51:25,194 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 18:51:25,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25" (1/1) ... [2025-04-13 18:51:25,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25" (1/1) ... [2025-04-13 18:51:25,203 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25" (1/1) ... [2025-04-13 18:51:25,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25" (1/1) ... [2025-04-13 18:51:25,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25" (1/1) ... [2025-04-13 18:51:25,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25" (1/1) ... [2025-04-13 18:51:25,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25" (1/1) ... [2025-04-13 18:51:25,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:51:25,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:51:25,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:51:25,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:51:25,219 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25" (1/1) ... [2025-04-13 18:51:25,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:51:25,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:25,245 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 18:51:25,246 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 18:51:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:51:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:51:25,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:51:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:51:25,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:51:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:51:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:51:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:51:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:51:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:51:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:51:25,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:51:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:51:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:51:25,262 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:51:25,331 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:51:25,332 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:51:25,496 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:51:25,497 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:51:25,497 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:51:25,673 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:51:25,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:51:25 BoogieIcfgContainer [2025-04-13 18:51:25,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:51:25,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:51:25,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:51:25,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:51:25,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:51:24" (1/3) ... [2025-04-13 18:51:25,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13dd8d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:51:25, skipping insertion in model container [2025-04-13 18:51:25,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:25" (2/3) ... [2025-04-13 18:51:25,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13dd8d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:51:25, skipping insertion in model container [2025-04-13 18:51:25,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:51:25" (3/3) ... [2025-04-13 18:51:25,683 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2025-04-13 18:51:25,698 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:51:25,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-2.wvr.c that has 3 procedures, 17 locations, 17 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 18:51:25,700 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:51:25,750 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 18:51:25,772 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 18:51:25,784 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 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 18:51:25,805 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:51:25,815 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;@b8f080d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:51:25,816 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 18:51:25,818 INFO L278 IsEmpty]: Start isEmpty. Operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 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 18:51:25,822 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 18:51:25,822 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:25,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:25,823 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:25,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:25,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1862671652, now seen corresponding path program 1 times [2025-04-13 18:51:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:25,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235650677] [2025-04-13 18:51:25,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:51:25,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:25,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 18:51:25,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:51:25,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:25,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:26,057 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 18:51:26,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:26,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235650677] [2025-04-13 18:51:26,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235650677] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:26,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:26,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 18:51:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205868963] [2025-04-13 18:51:26,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:26,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:51:26,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:26,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:51:26,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:51:26,074 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 18:51:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:26,129 INFO L93 Difference]: Finished difference Result 57 states and 125 transitions. [2025-04-13 18:51:26,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:51:26,131 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2025-04-13 18:51:26,131 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:26,136 INFO L225 Difference]: With dead ends: 57 [2025-04-13 18:51:26,136 INFO L226 Difference]: Without dead ends: 52 [2025-04-13 18:51:26,138 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:51:26,140 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:26,140 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:51:26,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-13 18:51:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-13 18:51:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.2745098039215685) internal successors, (116), 51 states have internal predecessors, (116), 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 18:51:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 116 transitions. [2025-04-13 18:51:26,165 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 116 transitions. Word has length 13 [2025-04-13 18:51:26,165 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:26,165 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 116 transitions. [2025-04-13 18:51:26,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 18:51:26,165 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 116 transitions. [2025-04-13 18:51:26,165 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:51:26,166 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:26,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:26,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:51:26,166 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:26,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:26,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1943846837, now seen corresponding path program 1 times [2025-04-13 18:51:26,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:26,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762693185] [2025-04-13 18:51:26,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:51:26,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:26,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 18:51:26,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:51:26,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:26,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:26,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:26,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762693185] [2025-04-13 18:51:26,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762693185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:26,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:26,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:51:26,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255834747] [2025-04-13 18:51:26,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:26,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:51:26,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:26,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:51:26,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:51:26,298 INFO L87 Difference]: Start difference. First operand 52 states and 116 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:26,339 INFO L93 Difference]: Finished difference Result 103 states and 231 transitions. [2025-04-13 18:51:26,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:51:26,339 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 18:51:26,340 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:26,341 INFO L225 Difference]: With dead ends: 103 [2025-04-13 18:51:26,341 INFO L226 Difference]: Without dead ends: 53 [2025-04-13 18:51:26,341 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:51:26,342 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:26,342 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:51:26,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-13 18:51:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-04-13 18:51:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 2.25) internal successors, (117), 52 states have internal predecessors, (117), 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 18:51:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 117 transitions. [2025-04-13 18:51:26,350 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 117 transitions. Word has length 14 [2025-04-13 18:51:26,350 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:26,350 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 117 transitions. [2025-04-13 18:51:26,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:26,350 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 117 transitions. [2025-04-13 18:51:26,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:51:26,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:26,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:26,351 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:51:26,351 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:26,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:26,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2074063679, now seen corresponding path program 1 times [2025-04-13 18:51:26,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:26,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090198477] [2025-04-13 18:51:26,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:51:26,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:26,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:51:26,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:51:26,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:26,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:26,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:26,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090198477] [2025-04-13 18:51:26,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090198477] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:26,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:26,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:51:26,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352411746] [2025-04-13 18:51:26,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:26,514 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:51:26,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:26,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:51:26,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:51:26,515 INFO L87 Difference]: Start difference. First operand 53 states and 117 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 18:51:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:26,619 INFO L93 Difference]: Finished difference Result 76 states and 160 transitions. [2025-04-13 18:51:26,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:51:26,619 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2025-04-13 18:51:26,619 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:26,620 INFO L225 Difference]: With dead ends: 76 [2025-04-13 18:51:26,620 INFO L226 Difference]: Without dead ends: 57 [2025-04-13 18:51:26,620 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:26,620 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:26,621 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-13 18:51:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2025-04-13 18:51:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.306122448979592) internal successors, (113), 49 states have internal predecessors, (113), 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 18:51:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 113 transitions. [2025-04-13 18:51:26,627 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 113 transitions. Word has length 15 [2025-04-13 18:51:26,627 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:26,627 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 113 transitions. [2025-04-13 18:51:26,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 18:51:26,627 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 113 transitions. [2025-04-13 18:51:26,627 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:51:26,627 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:26,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:26,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:51:26,628 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:26,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:26,628 INFO L85 PathProgramCache]: Analyzing trace with hash -519461108, now seen corresponding path program 1 times [2025-04-13 18:51:26,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:26,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814954279] [2025-04-13 18:51:26,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:51:26,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:26,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:51:26,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:51:26,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:26,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:26,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:26,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814954279] [2025-04-13 18:51:26,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814954279] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:26,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662612329] [2025-04-13 18:51:26,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:51:26,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:26,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:26,767 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 18:51:26,768 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 18:51:26,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:51:26,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:51:26,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:26,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:26,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:51:26,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:26,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:26,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662612329] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:26,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:51:26,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-13 18:51:26,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036410229] [2025-04-13 18:51:26,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:26,883 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:51:26,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:26,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:51:26,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:51:26,884 INFO L87 Difference]: Start difference. First operand 50 states and 113 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 18:51:26,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:26,935 INFO L93 Difference]: Finished difference Result 62 states and 139 transitions. [2025-04-13 18:51:26,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:51:26,936 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2025-04-13 18:51:26,936 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:26,936 INFO L225 Difference]: With dead ends: 62 [2025-04-13 18:51:26,936 INFO L226 Difference]: Without dead ends: 55 [2025-04-13 18:51:26,936 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:51:26,937 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:26,937 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:51:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-13 18:51:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-04-13 18:51:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.314814814814815) internal successors, (125), 54 states have internal predecessors, (125), 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 18:51:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 125 transitions. [2025-04-13 18:51:26,948 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 125 transitions. Word has length 15 [2025-04-13 18:51:26,948 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:26,948 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 125 transitions. [2025-04-13 18:51:26,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 18:51:26,948 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 125 transitions. [2025-04-13 18:51:26,948 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:51:26,949 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:26,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:26,957 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 18:51:27,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:27,157 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:27,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash 993852462, now seen corresponding path program 2 times [2025-04-13 18:51:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:27,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037078783] [2025-04-13 18:51:27,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:27,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:51:27,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:51:27,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:51:27,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:27,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:27,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037078783] [2025-04-13 18:51:27,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037078783] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:27,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544809373] [2025-04-13 18:51:27,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:27,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:27,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:27,316 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 18:51:27,318 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 18:51:27,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:51:27,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:51:27,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:51:27,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:27,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:51:27,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:27,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:27,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544809373] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:27,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:27,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2025-04-13 18:51:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884040831] [2025-04-13 18:51:27,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:27,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:51:27,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:27,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:51:27,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:51:27,474 INFO L87 Difference]: Start difference. First operand 55 states and 125 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:27,617 INFO L93 Difference]: Finished difference Result 90 states and 191 transitions. [2025-04-13 18:51:27,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:51:27,618 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 18:51:27,618 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:27,618 INFO L225 Difference]: With dead ends: 90 [2025-04-13 18:51:27,618 INFO L226 Difference]: Without dead ends: 83 [2025-04-13 18:51:27,619 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:51:27,619 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:27,619 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-13 18:51:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 57. [2025-04-13 18:51:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.357142857142857) internal successors, (132), 56 states have internal predecessors, (132), 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 18:51:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 132 transitions. [2025-04-13 18:51:27,632 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 132 transitions. Word has length 15 [2025-04-13 18:51:27,633 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:27,633 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 132 transitions. [2025-04-13 18:51:27,633 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:27,633 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 132 transitions. [2025-04-13 18:51:27,633 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:51:27,633 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:27,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:27,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 18:51:27,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:27,834 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:27,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:27,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1500248884, now seen corresponding path program 3 times [2025-04-13 18:51:27,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:27,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490128154] [2025-04-13 18:51:27,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:27,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:27,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:51:27,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:51:27,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:51:27,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:27,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:27,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490128154] [2025-04-13 18:51:27,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490128154] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:27,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:27,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:51:27,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194657488] [2025-04-13 18:51:27,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:27,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:51:27,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:27,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:51:27,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:51:27,910 INFO L87 Difference]: Start difference. First operand 57 states and 132 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 18:51:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:27,966 INFO L93 Difference]: Finished difference Result 76 states and 167 transitions. [2025-04-13 18:51:27,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:51:27,966 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2025-04-13 18:51:27,966 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:27,967 INFO L225 Difference]: With dead ends: 76 [2025-04-13 18:51:27,967 INFO L226 Difference]: Without dead ends: 65 [2025-04-13 18:51:27,967 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:51:27,967 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:27,968 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:51:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-04-13 18:51:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2025-04-13 18:51:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.357142857142857) internal successors, (132), 56 states have internal predecessors, (132), 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 18:51:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 132 transitions. [2025-04-13 18:51:27,975 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 132 transitions. Word has length 15 [2025-04-13 18:51:27,975 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:27,975 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 132 transitions. [2025-04-13 18:51:27,975 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 18:51:27,975 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 132 transitions. [2025-04-13 18:51:27,976 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:51:27,976 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:27,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:27,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:51:27,976 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:27,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:27,976 INFO L85 PathProgramCache]: Analyzing trace with hash -638603791, now seen corresponding path program 2 times [2025-04-13 18:51:27,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:27,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471696541] [2025-04-13 18:51:27,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:27,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:27,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:51:27,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:51:27,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:51:27,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:28,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:28,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471696541] [2025-04-13 18:51:28,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471696541] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:28,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65696748] [2025-04-13 18:51:28,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:28,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:28,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:28,065 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 18:51:28,066 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 18:51:28,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:51:28,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:51:28,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:51:28,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:28,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:51:28,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:28,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:28,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65696748] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:28,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:28,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-04-13 18:51:28,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773261486] [2025-04-13 18:51:28,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:28,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:51:28,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:28,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:51:28,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:51:28,187 INFO L87 Difference]: Start difference. First operand 57 states and 132 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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 18:51:28,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:28,296 INFO L93 Difference]: Finished difference Result 101 states and 230 transitions. [2025-04-13 18:51:28,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:51:28,298 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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 15 [2025-04-13 18:51:28,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:28,298 INFO L225 Difference]: With dead ends: 101 [2025-04-13 18:51:28,299 INFO L226 Difference]: Without dead ends: 80 [2025-04-13 18:51:28,299 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:51:28,299 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:28,299 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:28,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-13 18:51:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2025-04-13 18:51:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 2.3783783783783785) internal successors, (176), 74 states have internal predecessors, (176), 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 18:51:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 176 transitions. [2025-04-13 18:51:28,319 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 176 transitions. Word has length 15 [2025-04-13 18:51:28,319 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:28,319 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 176 transitions. [2025-04-13 18:51:28,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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 18:51:28,319 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 176 transitions. [2025-04-13 18:51:28,320 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:51:28,320 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:28,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:28,331 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 18:51:28,525 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 18:51:28,525 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:28,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:28,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1773475263, now seen corresponding path program 3 times [2025-04-13 18:51:28,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:28,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841017727] [2025-04-13 18:51:28,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:28,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:28,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:51:28,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:51:28,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:51:28,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:28,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:28,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841017727] [2025-04-13 18:51:28,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841017727] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:28,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245623793] [2025-04-13 18:51:28,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:28,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:28,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:28,622 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 18:51:28,627 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 18:51:28,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:51:28,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:51:28,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:51:28,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:28,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:51:28,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:28,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:28,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245623793] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:28,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:51:28,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-13 18:51:28,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473537959] [2025-04-13 18:51:28,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:28,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:51:28,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:28,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:51:28,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:51:28,780 INFO L87 Difference]: Start difference. First operand 75 states and 176 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 18:51:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:28,835 INFO L93 Difference]: Finished difference Result 84 states and 190 transitions. [2025-04-13 18:51:28,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:51:28,835 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2025-04-13 18:51:28,835 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:28,836 INFO L225 Difference]: With dead ends: 84 [2025-04-13 18:51:28,836 INFO L226 Difference]: Without dead ends: 76 [2025-04-13 18:51:28,836 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:51:28,837 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:28,837 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:51:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-13 18:51:28,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2025-04-13 18:51:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.343283582089552) internal successors, (157), 67 states have internal predecessors, (157), 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 18:51:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 157 transitions. [2025-04-13 18:51:28,848 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 157 transitions. Word has length 15 [2025-04-13 18:51:28,848 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:28,848 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 157 transitions. [2025-04-13 18:51:28,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 18:51:28,848 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 157 transitions. [2025-04-13 18:51:28,848 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 18:51:28,848 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:28,848 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:28,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 18:51:29,049 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 18:51:29,049 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:29,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:29,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1303420342, now seen corresponding path program 4 times [2025-04-13 18:51:29,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:29,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515990150] [2025-04-13 18:51:29,050 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:29,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:29,057 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 18:51:29,065 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:51:29,066 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:29,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:29,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:29,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515990150] [2025-04-13 18:51:29,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515990150] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:29,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312708081] [2025-04-13 18:51:29,203 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:29,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:29,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:29,205 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 18:51:29,207 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 18:51:29,243 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 18:51:29,258 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:51:29,258 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:29,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:29,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:51:29,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:51:29,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:51:29,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312708081] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:29,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:29,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-13 18:51:29,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179483178] [2025-04-13 18:51:29,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:29,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:51:29,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:29,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:51:29,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:51:29,364 INFO L87 Difference]: Start difference. First operand 68 states and 157 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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 18:51:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:29,473 INFO L93 Difference]: Finished difference Result 83 states and 186 transitions. [2025-04-13 18:51:29,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:51:29,473 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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 16 [2025-04-13 18:51:29,473 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:29,474 INFO L225 Difference]: With dead ends: 83 [2025-04-13 18:51:29,474 INFO L226 Difference]: Without dead ends: 76 [2025-04-13 18:51:29,474 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:51:29,474 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:29,475 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-13 18:51:29,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 60. [2025-04-13 18:51:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.288135593220339) internal successors, (135), 59 states have internal predecessors, (135), 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 18:51:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 135 transitions. [2025-04-13 18:51:29,488 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 135 transitions. Word has length 16 [2025-04-13 18:51:29,488 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:29,488 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 135 transitions. [2025-04-13 18:51:29,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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 18:51:29,488 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 135 transitions. [2025-04-13 18:51:29,489 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:51:29,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:29,489 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:29,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 18:51:29,689 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 18:51:29,690 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:29,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:29,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1101336129, now seen corresponding path program 1 times [2025-04-13 18:51:29,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:29,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891961550] [2025-04-13 18:51:29,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:51:29,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:29,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 18:51:29,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:51:29,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:29,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:30,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:30,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891961550] [2025-04-13 18:51:30,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891961550] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:30,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083295477] [2025-04-13 18:51:30,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:51:30,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:30,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:30,142 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 18:51:30,144 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 18:51:30,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 18:51:30,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:51:30,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:30,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:30,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:51:30,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:30,248 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:51:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:30,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:30,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 90 [2025-04-13 18:51:30,669 INFO L325 Elim1Store]: treesize reduction 5, result has 95.2 percent of original size [2025-04-13 18:51:30,669 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 406 treesize of output 335 [2025-04-13 18:51:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:32,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083295477] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:32,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:32,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-13 18:51:32,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946796322] [2025-04-13 18:51:32,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:32,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:51:32,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:32,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:51:32,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:51:32,668 INFO L87 Difference]: Start difference. First operand 60 states and 135 transitions. Second operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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 18:51:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:33,035 INFO L93 Difference]: Finished difference Result 167 states and 378 transitions. [2025-04-13 18:51:33,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:51:33,035 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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 17 [2025-04-13 18:51:33,035 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:33,036 INFO L225 Difference]: With dead ends: 167 [2025-04-13 18:51:33,036 INFO L226 Difference]: Without dead ends: 106 [2025-04-13 18:51:33,037 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:51:33,037 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:33,037 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:51:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-13 18:51:33,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2025-04-13 18:51:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 2.4457831325301207) internal successors, (203), 83 states have internal predecessors, (203), 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 18:51:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 203 transitions. [2025-04-13 18:51:33,055 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 203 transitions. Word has length 17 [2025-04-13 18:51:33,056 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:33,056 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 203 transitions. [2025-04-13 18:51:33,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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 18:51:33,056 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 203 transitions. [2025-04-13 18:51:33,057 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 18:51:33,057 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:33,057 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:33,068 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 18:51:33,257 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 18:51:33,257 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:33,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1347257397, now seen corresponding path program 2 times [2025-04-13 18:51:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:33,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229627378] [2025-04-13 18:51:33,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:33,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:33,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 18:51:33,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:51:33,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:51:33,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:33,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:33,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229627378] [2025-04-13 18:51:33,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229627378] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:33,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337297940] [2025-04-13 18:51:33,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:33,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:33,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:33,878 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 18:51:33,880 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 18:51:33,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 18:51:33,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:51:33,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:51:33,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:33,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:51:33,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:34,028 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:51:34,028 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2025-04-13 18:51:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:51:34,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:34,106 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:51:34,106 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 18:51:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:34,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337297940] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:34,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:34,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 3] total 14 [2025-04-13 18:51:34,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054815716] [2025-04-13 18:51:34,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:34,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:51:34,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:34,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:51:34,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:51:34,139 INFO L87 Difference]: Start difference. First operand 84 states and 203 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 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 18:51:34,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:34,462 INFO L93 Difference]: Finished difference Result 148 states and 346 transitions. [2025-04-13 18:51:34,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:34,463 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 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 18:51:34,463 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:34,464 INFO L225 Difference]: With dead ends: 148 [2025-04-13 18:51:34,464 INFO L226 Difference]: Without dead ends: 143 [2025-04-13 18:51:34,464 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:51:34,464 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:34,465 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:51:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-04-13 18:51:34,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 94. [2025-04-13 18:51:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.6021505376344085) internal successors, (242), 93 states have internal predecessors, (242), 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 18:51:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 242 transitions. [2025-04-13 18:51:34,480 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 242 transitions. Word has length 18 [2025-04-13 18:51:34,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:34,480 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 242 transitions. [2025-04-13 18:51:34,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 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 18:51:34,480 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 242 transitions. [2025-04-13 18:51:34,482 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 18:51:34,482 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:34,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:34,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 18:51:34,682 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 18:51:34,682 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:34,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash -541531931, now seen corresponding path program 3 times [2025-04-13 18:51:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:34,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454165837] [2025-04-13 18:51:34,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:34,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-04-13 18:51:34,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:51:34,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:51:34,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:35,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:35,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454165837] [2025-04-13 18:51:35,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454165837] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:35,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901616766] [2025-04-13 18:51:35,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:35,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:35,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:35,172 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 18:51:35,173 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 18:51:35,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-04-13 18:51:35,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:51:35,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:51:35,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:35,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:51:35,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:35,313 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:51:35,314 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2025-04-13 18:51:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:35,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:35,399 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:51:35,399 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 18:51:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:51:35,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901616766] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:35,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:35,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 3] total 13 [2025-04-13 18:51:35,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446194492] [2025-04-13 18:51:35,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:35,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:51:35,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:35,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:51:35,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:51:35,433 INFO L87 Difference]: Start difference. First operand 94 states and 242 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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 18:51:35,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:35,695 INFO L93 Difference]: Finished difference Result 164 states and 401 transitions. [2025-04-13 18:51:35,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:51:35,695 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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 18:51:35,695 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:35,696 INFO L225 Difference]: With dead ends: 164 [2025-04-13 18:51:35,696 INFO L226 Difference]: Without dead ends: 159 [2025-04-13 18:51:35,696 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:51:35,697 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:35,697 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:51:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-04-13 18:51:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 130. [2025-04-13 18:51:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.682170542635659) internal successors, (346), 129 states have internal predecessors, (346), 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 18:51:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 346 transitions. [2025-04-13 18:51:35,714 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 346 transitions. Word has length 18 [2025-04-13 18:51:35,714 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:35,714 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 346 transitions. [2025-04-13 18:51:35,714 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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 18:51:35,714 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 346 transitions. [2025-04-13 18:51:35,714 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:51:35,714 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:35,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:35,721 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 18:51:35,919 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 18:51:35,919 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:35,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:35,919 INFO L85 PathProgramCache]: Analyzing trace with hash -809887420, now seen corresponding path program 4 times [2025-04-13 18:51:35,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:35,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418862820] [2025-04-13 18:51:35,919 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:35,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:35,924 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:51:35,933 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:35,933 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:35,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:36,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:36,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418862820] [2025-04-13 18:51:36,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418862820] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:36,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165005013] [2025-04-13 18:51:36,043 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:36,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:36,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:36,045 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 18:51:36,046 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 18:51:36,086 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:51:36,101 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:36,102 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:36,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:36,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:51:36,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:36,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:36,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165005013] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:36,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:36,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-04-13 18:51:36,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988869702] [2025-04-13 18:51:36,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:36,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:51:36,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:36,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:51:36,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:51:36,294 INFO L87 Difference]: Start difference. First operand 130 states and 346 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:36,764 INFO L93 Difference]: Finished difference Result 241 states and 594 transitions. [2025-04-13 18:51:36,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:51:36,764 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 18:51:36,764 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:36,765 INFO L225 Difference]: With dead ends: 241 [2025-04-13 18:51:36,765 INFO L226 Difference]: Without dead ends: 216 [2025-04-13 18:51:36,766 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=622, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:51:36,766 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 138 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:36,766 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 0 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:51:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-04-13 18:51:36,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 162. [2025-04-13 18:51:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.875776397515528) internal successors, (463), 161 states have internal predecessors, (463), 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 18:51:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 463 transitions. [2025-04-13 18:51:36,788 INFO L79 Accepts]: Start accepts. Automaton has 162 states and 463 transitions. Word has length 19 [2025-04-13 18:51:36,788 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:36,788 INFO L485 AbstractCegarLoop]: Abstraction has 162 states and 463 transitions. [2025-04-13 18:51:36,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:36,788 INFO L278 IsEmpty]: Start isEmpty. Operand 162 states and 463 transitions. [2025-04-13 18:51:36,789 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:51:36,789 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:36,789 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:36,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 18:51:36,989 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 18:51:36,990 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:36,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:36,990 INFO L85 PathProgramCache]: Analyzing trace with hash 138152025, now seen corresponding path program 5 times [2025-04-13 18:51:36,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:36,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692537876] [2025-04-13 18:51:36,990 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:51:36,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:36,998 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 18:51:37,006 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:37,006 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:51:37,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:51:37,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:37,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692537876] [2025-04-13 18:51:37,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692537876] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:37,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491168787] [2025-04-13 18:51:37,098 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:51:37,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:37,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:37,101 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 18:51:37,101 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 18:51:37,143 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 18:51:37,159 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:37,160 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:51:37,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:37,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:51:37,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:37,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:37,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491168787] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:37,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:37,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2025-04-13 18:51:37,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555470501] [2025-04-13 18:51:37,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:37,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:51:37,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:37,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:51:37,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:51:37,304 INFO L87 Difference]: Start difference. First operand 162 states and 463 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 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 18:51:37,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:37,907 INFO L93 Difference]: Finished difference Result 232 states and 624 transitions. [2025-04-13 18:51:37,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:51:37,908 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 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 19 [2025-04-13 18:51:37,908 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:37,910 INFO L225 Difference]: With dead ends: 232 [2025-04-13 18:51:37,910 INFO L226 Difference]: Without dead ends: 211 [2025-04-13 18:51:37,910 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:51:37,911 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 138 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:37,911 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 0 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:51:37,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-04-13 18:51:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 172. [2025-04-13 18:51:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 2.754385964912281) internal successors, (471), 171 states have internal predecessors, (471), 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 18:51:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 471 transitions. [2025-04-13 18:51:37,949 INFO L79 Accepts]: Start accepts. Automaton has 172 states and 471 transitions. Word has length 19 [2025-04-13 18:51:37,949 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:37,949 INFO L485 AbstractCegarLoop]: Abstraction has 172 states and 471 transitions. [2025-04-13 18:51:37,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 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 18:51:37,949 INFO L278 IsEmpty]: Start isEmpty. Operand 172 states and 471 transitions. [2025-04-13 18:51:37,949 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:51:37,949 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:37,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:37,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 18:51:38,150 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 18:51:38,150 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:38,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:38,151 INFO L85 PathProgramCache]: Analyzing trace with hash 739696148, now seen corresponding path program 6 times [2025-04-13 18:51:38,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:38,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848119483] [2025-04-13 18:51:38,151 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:51:38,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:38,159 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:51:38,167 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:38,168 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:51:38,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:38,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:38,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848119483] [2025-04-13 18:51:38,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848119483] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:38,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258861068] [2025-04-13 18:51:38,276 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:51:38,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:38,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:38,278 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 18:51:38,280 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 18:51:38,317 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:51:38,333 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:38,333 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:51:38,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:38,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:51:38,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:38,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:38,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258861068] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:38,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:38,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-13 18:51:38,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042660995] [2025-04-13 18:51:38,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:38,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:51:38,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:38,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:51:38,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:51:38,497 INFO L87 Difference]: Start difference. First operand 172 states and 471 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 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 18:51:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:39,157 INFO L93 Difference]: Finished difference Result 278 states and 687 transitions. [2025-04-13 18:51:39,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:51:39,158 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 18:51:39,158 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:39,159 INFO L225 Difference]: With dead ends: 278 [2025-04-13 18:51:39,159 INFO L226 Difference]: Without dead ends: 258 [2025-04-13 18:51:39,162 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1328, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:51:39,162 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:39,162 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:51:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-13 18:51:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 180. [2025-04-13 18:51:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.7541899441340782) internal successors, (493), 179 states have internal predecessors, (493), 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 18:51:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 493 transitions. [2025-04-13 18:51:39,194 INFO L79 Accepts]: Start accepts. Automaton has 180 states and 493 transitions. Word has length 19 [2025-04-13 18:51:39,194 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:39,195 INFO L485 AbstractCegarLoop]: Abstraction has 180 states and 493 transitions. [2025-04-13 18:51:39,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 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 18:51:39,195 INFO L278 IsEmpty]: Start isEmpty. Operand 180 states and 493 transitions. [2025-04-13 18:51:39,195 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:51:39,195 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:39,195 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:39,202 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 18:51:39,398 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 18:51:39,398 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:39,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:39,398 INFO L85 PathProgramCache]: Analyzing trace with hash -119773028, now seen corresponding path program 7 times [2025-04-13 18:51:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:39,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623537796] [2025-04-13 18:51:39,399 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:51:39,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:39,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 18:51:39,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:39,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:39,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:39,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:39,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623537796] [2025-04-13 18:51:39,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623537796] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:39,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439486482] [2025-04-13 18:51:39,515 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:51:39,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:39,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:39,517 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 18:51:39,518 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 18:51:39,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 18:51:39,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:39,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:39,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:39,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:51:39,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:39,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:39,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439486482] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:39,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:39,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-13 18:51:39,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413560947] [2025-04-13 18:51:39,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:39,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:51:39,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:39,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:51:39,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:51:39,733 INFO L87 Difference]: Start difference. First operand 180 states and 493 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 18:51:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:40,231 INFO L93 Difference]: Finished difference Result 266 states and 680 transitions. [2025-04-13 18:51:40,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:51:40,231 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 19 [2025-04-13 18:51:40,232 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:40,233 INFO L225 Difference]: With dead ends: 266 [2025-04-13 18:51:40,233 INFO L226 Difference]: Without dead ends: 258 [2025-04-13 18:51:40,233 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:51:40,234 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:40,234 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:51:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-13 18:51:40,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 182. [2025-04-13 18:51:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.7624309392265194) internal successors, (500), 181 states have internal predecessors, (500), 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 18:51:40,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 500 transitions. [2025-04-13 18:51:40,263 INFO L79 Accepts]: Start accepts. Automaton has 182 states and 500 transitions. Word has length 19 [2025-04-13 18:51:40,264 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:40,264 INFO L485 AbstractCegarLoop]: Abstraction has 182 states and 500 transitions. [2025-04-13 18:51:40,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 18:51:40,264 INFO L278 IsEmpty]: Start isEmpty. Operand 182 states and 500 transitions. [2025-04-13 18:51:40,264 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:51:40,264 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:40,264 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:40,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 18:51:40,465 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 18:51:40,465 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:40,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1149093180, now seen corresponding path program 8 times [2025-04-13 18:51:40,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:40,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146390921] [2025-04-13 18:51:40,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:40,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:40,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:51:40,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:40,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:51:40,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:40,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:40,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146390921] [2025-04-13 18:51:40,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146390921] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:40,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635909503] [2025-04-13 18:51:40,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:40,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:40,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:40,596 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 18:51:40,598 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 18:51:40,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:51:40,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:40,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:51:40,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:40,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:51:40,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:40,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:40,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635909503] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:40,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:40,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-13 18:51:40,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126072651] [2025-04-13 18:51:40,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:40,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:51:40,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:40,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:51:40,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:51:40,799 INFO L87 Difference]: Start difference. First operand 182 states and 500 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 18:51:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:41,924 INFO L93 Difference]: Finished difference Result 358 states and 869 transitions. [2025-04-13 18:51:41,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 18:51:41,924 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 19 [2025-04-13 18:51:41,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:41,926 INFO L225 Difference]: With dead ends: 358 [2025-04-13 18:51:41,926 INFO L226 Difference]: Without dead ends: 330 [2025-04-13 18:51:41,927 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=585, Invalid=1767, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:51:41,927 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:41,927 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:51:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-04-13 18:51:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 200. [2025-04-13 18:51:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 2.829145728643216) internal successors, (563), 199 states have internal predecessors, (563), 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 18:51:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 563 transitions. [2025-04-13 18:51:41,966 INFO L79 Accepts]: Start accepts. Automaton has 200 states and 563 transitions. Word has length 19 [2025-04-13 18:51:41,966 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:41,966 INFO L485 AbstractCegarLoop]: Abstraction has 200 states and 563 transitions. [2025-04-13 18:51:41,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 18:51:41,967 INFO L278 IsEmpty]: Start isEmpty. Operand 200 states and 563 transitions. [2025-04-13 18:51:41,967 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:51:41,967 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:41,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:41,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 18:51:42,167 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 18:51:42,168 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:42,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2008562356, now seen corresponding path program 9 times [2025-04-13 18:51:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:42,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887728156] [2025-04-13 18:51:42,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:42,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:42,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-13 18:51:42,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:42,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:51:42,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:42,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:42,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887728156] [2025-04-13 18:51:42,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887728156] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:42,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576685892] [2025-04-13 18:51:42,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:42,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:42,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:42,325 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 18:51:42,327 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 18:51:42,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-13 18:51:42,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:42,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:51:42,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:42,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:51:42,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:42,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:42,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576685892] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:42,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:42,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-04-13 18:51:42,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761600938] [2025-04-13 18:51:42,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:42,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:51:42,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:42,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:51:42,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:51:42,533 INFO L87 Difference]: Start difference. First operand 200 states and 563 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:47,761 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:51:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:48,592 INFO L93 Difference]: Finished difference Result 382 states and 945 transitions. [2025-04-13 18:51:48,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 18:51:48,593 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 18:51:48,593 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:48,595 INFO L225 Difference]: With dead ends: 382 [2025-04-13 18:51:48,595 INFO L226 Difference]: Without dead ends: 370 [2025-04-13 18:51:48,595 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=665, Invalid=2641, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 18:51:48,596 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:48,596 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 636 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-04-13 18:51:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-04-13 18:51:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 200. [2025-04-13 18:51:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 2.798994974874372) internal successors, (557), 199 states have internal predecessors, (557), 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 18:51:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 557 transitions. [2025-04-13 18:51:48,641 INFO L79 Accepts]: Start accepts. Automaton has 200 states and 557 transitions. Word has length 19 [2025-04-13 18:51:48,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:48,641 INFO L485 AbstractCegarLoop]: Abstraction has 200 states and 557 transitions. [2025-04-13 18:51:48,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:48,642 INFO L278 IsEmpty]: Start isEmpty. Operand 200 states and 557 transitions. [2025-04-13 18:51:48,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:51:48,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:48,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:48,649 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 18:51:48,844 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 18:51:48,844 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:48,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:48,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1596575004, now seen corresponding path program 10 times [2025-04-13 18:51:48,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:48,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024006928] [2025-04-13 18:51:48,844 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:48,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:48,849 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:51:48,854 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:48,854 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:48,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:48,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:48,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024006928] [2025-04-13 18:51:48,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024006928] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:48,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315771985] [2025-04-13 18:51:48,944 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:48,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:48,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:48,946 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 18:51:48,948 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 18:51:48,985 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:51:49,000 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:49,001 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:49,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:49,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:51:49,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:49,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:49,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315771985] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:49,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:49,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-13 18:51:49,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693841694] [2025-04-13 18:51:49,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:49,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:51:49,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:49,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:51:49,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:51:49,138 INFO L87 Difference]: Start difference. First operand 200 states and 557 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:53,783 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:51:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:55,502 INFO L93 Difference]: Finished difference Result 418 states and 1068 transitions. [2025-04-13 18:51:55,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:51:55,503 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 18:51:55,503 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:55,505 INFO L225 Difference]: With dead ends: 418 [2025-04-13 18:51:55,505 INFO L226 Difference]: Without dead ends: 407 [2025-04-13 18:51:55,505 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:51:55,506 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:55,506 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-04-13 18:51:55,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-04-13 18:51:55,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 228. [2025-04-13 18:51:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.8854625550660793) internal successors, (655), 227 states have internal predecessors, (655), 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 18:51:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 655 transitions. [2025-04-13 18:51:55,560 INFO L79 Accepts]: Start accepts. Automaton has 228 states and 655 transitions. Word has length 19 [2025-04-13 18:51:55,560 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:55,560 INFO L485 AbstractCegarLoop]: Abstraction has 228 states and 655 transitions. [2025-04-13 18:51:55,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:55,560 INFO L278 IsEmpty]: Start isEmpty. Operand 228 states and 655 transitions. [2025-04-13 18:51:55,561 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:51:55,561 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:55,561 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:55,568 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 18:51:55,761 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 18:51:55,762 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:55,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash 427979796, now seen corresponding path program 11 times [2025-04-13 18:51:55,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:55,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684148215] [2025-04-13 18:51:55,762 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:51:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:55,766 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 18:51:55,774 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:55,774 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:51:55,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:55,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:55,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684148215] [2025-04-13 18:51:55,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684148215] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:55,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018505820] [2025-04-13 18:51:55,965 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:51:55,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:55,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:55,967 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 18:51:55,968 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 18:51:56,006 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 18:51:56,027 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:51:56,027 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:51:56,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:56,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:51:56,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:56,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:51:56,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018505820] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:56,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:56,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-04-13 18:51:56,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746888767] [2025-04-13 18:51:56,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:56,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:51:56,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:56,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:51:56,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:51:56,187 INFO L87 Difference]: Start difference. First operand 228 states and 655 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 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 18:52:01,594 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:52:06,358 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:52:10,932 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:52:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:11,584 INFO L93 Difference]: Finished difference Result 452 states and 1214 transitions. [2025-04-13 18:52:11,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 18:52:11,584 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 18:52:11,584 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:11,586 INFO L225 Difference]: With dead ends: 452 [2025-04-13 18:52:11,586 INFO L226 Difference]: Without dead ends: 416 [2025-04-13 18:52:11,587 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=498, Invalid=1854, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:52:11,587 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 38 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:11,587 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 665 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2025-04-13 18:52:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-04-13 18:52:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 286. [2025-04-13 18:52:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 3.0456140350877194) internal successors, (868), 285 states have internal predecessors, (868), 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 18:52:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 868 transitions. [2025-04-13 18:52:11,658 INFO L79 Accepts]: Start accepts. Automaton has 286 states and 868 transitions. Word has length 19 [2025-04-13 18:52:11,658 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:11,658 INFO L485 AbstractCegarLoop]: Abstraction has 286 states and 868 transitions. [2025-04-13 18:52:11,658 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 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 18:52:11,658 INFO L278 IsEmpty]: Start isEmpty. Operand 286 states and 868 transitions. [2025-04-13 18:52:11,658 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:52:11,658 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:11,659 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:52:11,665 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 18:52:11,859 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 18:52:11,859 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:52:11,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash -431489380, now seen corresponding path program 12 times [2025-04-13 18:52:11,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:11,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192417987] [2025-04-13 18:52:11,860 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:52:11,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:11,865 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-04-13 18:52:11,870 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:52:11,871 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:52:11,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:52:11,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:11,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192417987] [2025-04-13 18:52:11,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192417987] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:52:11,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458737431] [2025-04-13 18:52:11,975 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:52:11,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:52:11,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:52:11,977 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 18:52:11,978 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 18:52:12,017 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-04-13 18:52:12,030 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:52:12,030 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:52:12,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:12,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:52:12,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:52:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:52:12,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:52:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:52:12,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458737431] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:52:12,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:52:12,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-13 18:52:12,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119246385] [2025-04-13 18:52:12,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:52:12,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:52:12,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:12,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:52:12,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:52:12,151 INFO L87 Difference]: Start difference. First operand 286 states and 868 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:15,910 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:52:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:16,032 INFO L93 Difference]: Finished difference Result 536 states and 1479 transitions. [2025-04-13 18:52:16,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:52:16,033 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 18:52:16,033 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:16,035 INFO L225 Difference]: With dead ends: 536 [2025-04-13 18:52:16,035 INFO L226 Difference]: Without dead ends: 525 [2025-04-13 18:52:16,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=445, Invalid=1277, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:52:16,036 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 159 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:16,036 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 0 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-04-13 18:52:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-04-13 18:52:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 288. [2025-04-13 18:52:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.0209059233449476) internal successors, (867), 287 states have internal predecessors, (867), 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 18:52:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 867 transitions. [2025-04-13 18:52:16,123 INFO L79 Accepts]: Start accepts. Automaton has 288 states and 867 transitions. Word has length 19 [2025-04-13 18:52:16,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:16,123 INFO L485 AbstractCegarLoop]: Abstraction has 288 states and 867 transitions. [2025-04-13 18:52:16,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:16,123 INFO L278 IsEmpty]: Start isEmpty. Operand 288 states and 867 transitions. [2025-04-13 18:52:16,124 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:52:16,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:16,124 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:52:16,131 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 18:52:16,324 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 18:52:16,325 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:52:16,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:16,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2134430582, now seen corresponding path program 13 times [2025-04-13 18:52:16,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:16,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040175254] [2025-04-13 18:52:16,325 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:52:16,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:16,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 18:52:16,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:52:16,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:52:16,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:52:16,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:16,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040175254] [2025-04-13 18:52:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040175254] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:52:16,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821628304] [2025-04-13 18:52:16,442 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:52:16,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:52:16,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:52:16,444 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 18:52:16,447 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 18:52:16,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 18:52:16,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:52:16,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:52:16,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:16,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:52:16,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:52:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:52:16,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:52:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:52:16,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821628304] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:52:16,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:52:16,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-13 18:52:16,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000053723] [2025-04-13 18:52:16,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:52:16,664 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:52:16,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:16,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:52:16,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:52:16,665 INFO L87 Difference]: Start difference. First operand 288 states and 867 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:19,562 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:52:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:20,843 INFO L93 Difference]: Finished difference Result 516 states and 1422 transitions. [2025-04-13 18:52:20,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 18:52:20,846 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 18:52:20,846 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:20,848 INFO L225 Difference]: With dead ends: 516 [2025-04-13 18:52:20,848 INFO L226 Difference]: Without dead ends: 505 [2025-04-13 18:52:20,849 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=444, Invalid=1626, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:52:20,850 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:20,850 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-04-13 18:52:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-04-13 18:52:20,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 340. [2025-04-13 18:52:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 3.112094395280236) internal successors, (1055), 339 states have internal predecessors, (1055), 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 18:52:20,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1055 transitions. [2025-04-13 18:52:20,962 INFO L79 Accepts]: Start accepts. Automaton has 340 states and 1055 transitions. Word has length 19 [2025-04-13 18:52:20,962 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:20,962 INFO L485 AbstractCegarLoop]: Abstraction has 340 states and 1055 transitions. [2025-04-13 18:52:20,962 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:20,962 INFO L278 IsEmpty]: Start isEmpty. Operand 340 states and 1055 transitions. [2025-04-13 18:52:20,963 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:52:20,963 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:20,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:52:20,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 18:52:21,163 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 18:52:21,164 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:52:21,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1454511556, now seen corresponding path program 14 times [2025-04-13 18:52:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:21,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514708061] [2025-04-13 18:52:21,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:52:21,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:21,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:52:21,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:52:21,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:52:21,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:52:21,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:21,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514708061] [2025-04-13 18:52:21,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514708061] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:52:21,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793109814] [2025-04-13 18:52:21,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:52:21,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:52:21,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:52:21,282 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:52:21,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 18:52:21,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:52:21,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:52:21,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:52:21,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:21,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:52:21,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:52:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:52:21,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:52:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:52:21,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793109814] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:52:21,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:52:21,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-13 18:52:21,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763027756] [2025-04-13 18:52:21,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:52:21,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:52:21,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:21,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:52:21,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:52:21,485 INFO L87 Difference]: Start difference. First operand 340 states and 1055 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 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 18:52:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:25,749 INFO L93 Difference]: Finished difference Result 876 states and 2436 transitions. [2025-04-13 18:52:25,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 18:52:25,750 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 18:52:25,750 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:25,753 INFO L225 Difference]: With dead ends: 876 [2025-04-13 18:52:25,753 INFO L226 Difference]: Without dead ends: 838 [2025-04-13 18:52:25,754 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=733, Invalid=2237, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 18:52:25,754 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 265 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:25,754 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 0 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:25,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-04-13 18:52:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 366. [2025-04-13 18:52:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 3.117808219178082) internal successors, (1138), 365 states have internal predecessors, (1138), 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 18:52:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1138 transitions. [2025-04-13 18:52:25,878 INFO L79 Accepts]: Start accepts. Automaton has 366 states and 1138 transitions. Word has length 19 [2025-04-13 18:52:25,878 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:25,878 INFO L485 AbstractCegarLoop]: Abstraction has 366 states and 1138 transitions. [2025-04-13 18:52:25,878 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 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 18:52:25,878 INFO L278 IsEmpty]: Start isEmpty. Operand 366 states and 1138 transitions. [2025-04-13 18:52:25,879 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:52:25,879 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:25,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:52:25,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 18:52:26,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:52:26,079 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:52:26,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash 595042380, now seen corresponding path program 15 times [2025-04-13 18:52:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:26,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990771007] [2025-04-13 18:52:26,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:52:26,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:26,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-13 18:52:26,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:52:26,091 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:52:26,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:52:26,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:26,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990771007] [2025-04-13 18:52:26,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990771007] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:52:26,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775488833] [2025-04-13 18:52:26,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:52:26,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:52:26,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:52:26,280 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:52:26,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 18:52:26,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-13 18:52:26,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:52:26,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:52:26,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:26,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:52:26,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:52:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:52:26,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:52:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:52:26,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775488833] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:52:26,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:52:26,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2025-04-13 18:52:26,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950131000] [2025-04-13 18:52:26,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:52:26,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:52:26,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:26,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:52:26,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:52:26,553 INFO L87 Difference]: Start difference. First operand 366 states and 1138 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:35,487 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:52:49,632 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:52:54,086 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:52:58,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:58,777 INFO L93 Difference]: Finished difference Result 928 states and 2544 transitions. [2025-04-13 18:52:58,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-13 18:52:58,777 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 18:52:58,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:58,781 INFO L225 Difference]: With dead ends: 928 [2025-04-13 18:52:58,781 INFO L226 Difference]: Without dead ends: 913 [2025-04-13 18:52:58,782 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2130 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=1253, Invalid=5067, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 18:52:58,782 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 262 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 110 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:58,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 0 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1151 Invalid, 2 Unknown, 0 Unchecked, 11.9s Time] [2025-04-13 18:52:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-04-13 18:52:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 364. [2025-04-13 18:52:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 3.09366391184573) internal successors, (1123), 363 states have internal predecessors, (1123), 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 18:52:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 1123 transitions. [2025-04-13 18:52:58,922 INFO L79 Accepts]: Start accepts. Automaton has 364 states and 1123 transitions. Word has length 19 [2025-04-13 18:52:58,922 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:58,922 INFO L485 AbstractCegarLoop]: Abstraction has 364 states and 1123 transitions. [2025-04-13 18:52:58,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:58,922 INFO L278 IsEmpty]: Start isEmpty. Operand 364 states and 1123 transitions. [2025-04-13 18:52:58,923 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:52:58,923 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:58,923 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:52:58,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 18:52:59,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-13 18:52:59,127 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:52:59,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:59,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2106152016, now seen corresponding path program 16 times [2025-04-13 18:52:59,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:59,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241926340] [2025-04-13 18:52:59,128 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:52:59,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:59,133 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:52:59,142 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:52:59,142 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:52:59,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:52:59,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:59,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241926340] [2025-04-13 18:52:59,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241926340] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:52:59,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331943024] [2025-04-13 18:52:59,239 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:52:59,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:52:59,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:52:59,241 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:52:59,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 18:52:59,290 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:52:59,304 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:52:59,305 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:52:59,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:59,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:52:59,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:52:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:52:59,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:52:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:52:59,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331943024] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:52:59,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:52:59,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-13 18:52:59,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130761079] [2025-04-13 18:52:59,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:52:59,437 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:52:59,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:59,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:52:59,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:52:59,438 INFO L87 Difference]: Start difference. First operand 364 states and 1123 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:05,389 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:53:09,601 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:53:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:10,103 INFO L93 Difference]: Finished difference Result 599 states and 1692 transitions. [2025-04-13 18:53:10,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 18:53:10,104 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 18:53:10,104 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:10,106 INFO L225 Difference]: With dead ends: 599 [2025-04-13 18:53:10,106 INFO L226 Difference]: Without dead ends: 588 [2025-04-13 18:53:10,107 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=570, Invalid=2186, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 18:53:10,107 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:10,107 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 576 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2025-04-13 18:53:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-04-13 18:53:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 384. [2025-04-13 18:53:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.10443864229765) internal successors, (1189), 383 states have internal predecessors, (1189), 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 18:53:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1189 transitions. [2025-04-13 18:53:10,262 INFO L79 Accepts]: Start accepts. Automaton has 384 states and 1189 transitions. Word has length 20 [2025-04-13 18:53:10,262 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:10,263 INFO L485 AbstractCegarLoop]: Abstraction has 384 states and 1189 transitions. [2025-04-13 18:53:10,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:10,263 INFO L278 IsEmpty]: Start isEmpty. Operand 384 states and 1189 transitions. [2025-04-13 18:53:10,263 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:53:10,263 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:10,263 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:10,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 18:53:10,464 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-13 18:53:10,464 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:10,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1162283520, now seen corresponding path program 17 times [2025-04-13 18:53:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:10,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421890097] [2025-04-13 18:53:10,464 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:53:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:10,468 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 18:53:10,474 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:53:10,475 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:53:10,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:53:10,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:10,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421890097] [2025-04-13 18:53:10,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421890097] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:10,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869685397] [2025-04-13 18:53:10,613 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:53:10,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:10,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:10,615 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:53:10,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 18:53:10,657 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 18:53:10,680 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:53:10,680 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:53:10,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:10,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:53:10,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:53:10,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:53:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:53:10,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869685397] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:53:10,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:53:10,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-04-13 18:53:10,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468357982] [2025-04-13 18:53:10,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:53:10,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:53:10,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:10,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:53:10,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:53:10,829 INFO L87 Difference]: Start difference. First operand 384 states and 1189 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:21,695 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:53:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:23,839 INFO L93 Difference]: Finished difference Result 735 states and 2149 transitions. [2025-04-13 18:53:23,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:53:23,839 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 18:53:23,839 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:23,842 INFO L225 Difference]: With dead ends: 735 [2025-04-13 18:53:23,842 INFO L226 Difference]: Without dead ends: 724 [2025-04-13 18:53:23,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=433, Invalid=1636, Unknown=1, NotChecked=0, Total=2070 [2025-04-13 18:53:23,843 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:23,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-04-13 18:53:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-04-13 18:53:24,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 394. [2025-04-13 18:53:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 3.114503816793893) internal successors, (1224), 393 states have internal predecessors, (1224), 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 18:53:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1224 transitions. [2025-04-13 18:53:24,007 INFO L79 Accepts]: Start accepts. Automaton has 394 states and 1224 transitions. Word has length 20 [2025-04-13 18:53:24,007 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:24,007 INFO L485 AbstractCegarLoop]: Abstraction has 394 states and 1224 transitions. [2025-04-13 18:53:24,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:24,007 INFO L278 IsEmpty]: Start isEmpty. Operand 394 states and 1224 transitions. [2025-04-13 18:53:24,008 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:53:24,008 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:24,008 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:24,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 18:53:24,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 18:53:24,209 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:24,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:24,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1697513322, now seen corresponding path program 18 times [2025-04-13 18:53:24,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:24,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348945938] [2025-04-13 18:53:24,209 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:53:24,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:24,213 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 18:53:24,222 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:53:24,223 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:53:24,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:53:24,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:24,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348945938] [2025-04-13 18:53:24,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348945938] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:24,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116219307] [2025-04-13 18:53:24,369 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:53:24,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:24,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:24,371 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:53:24,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 18:53:24,410 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 18:53:24,423 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:53:24,424 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:53:24,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:24,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:53:24,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:53:24,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:53:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:53:24,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116219307] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:53:24,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:53:24,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-04-13 18:53:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610760153] [2025-04-13 18:53:24,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:53:24,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:53:24,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:24,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:53:24,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:53:24,561 INFO L87 Difference]: Start difference. First operand 394 states and 1224 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:26,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:26,345 INFO L93 Difference]: Finished difference Result 887 states and 2728 transitions. [2025-04-13 18:53:26,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 18:53:26,345 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 18:53:26,345 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:26,350 INFO L225 Difference]: With dead ends: 887 [2025-04-13 18:53:26,350 INFO L226 Difference]: Without dead ends: 879 [2025-04-13 18:53:26,351 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=513, Invalid=1937, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:53:26,351 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:26,352 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:53:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-04-13 18:53:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 382. [2025-04-13 18:53:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 3.1128608923884515) internal successors, (1186), 381 states have internal predecessors, (1186), 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 18:53:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1186 transitions. [2025-04-13 18:53:26,539 INFO L79 Accepts]: Start accepts. Automaton has 382 states and 1186 transitions. Word has length 20 [2025-04-13 18:53:26,539 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:26,539 INFO L485 AbstractCegarLoop]: Abstraction has 382 states and 1186 transitions. [2025-04-13 18:53:26,539 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:26,539 INFO L278 IsEmpty]: Start isEmpty. Operand 382 states and 1186 transitions. [2025-04-13 18:53:26,540 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:53:26,540 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:26,540 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:26,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-13 18:53:26,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:26,741 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:26,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:26,741 INFO L85 PathProgramCache]: Analyzing trace with hash 811536285, now seen corresponding path program 19 times [2025-04-13 18:53:26,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:26,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639874874] [2025-04-13 18:53:26,741 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:53:26,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:26,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:53:26,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:53:26,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:26,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:53:26,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:26,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639874874] [2025-04-13 18:53:26,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639874874] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:26,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838348983] [2025-04-13 18:53:26,852 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:53:26,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:26,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:26,854 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:53:26,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 18:53:26,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:53:26,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:53:26,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:26,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:26,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:53:26,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:53:26,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:53:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:53:27,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838348983] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:53:27,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:53:27,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-13 18:53:27,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216043813] [2025-04-13 18:53:27,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:53:27,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:53:27,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:27,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:53:27,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:53:27,027 INFO L87 Difference]: Start difference. First operand 382 states and 1186 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 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 18:53:43,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:43,647 INFO L93 Difference]: Finished difference Result 465 states and 1404 transitions. [2025-04-13 18:53:43,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:43,648 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 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 18:53:43,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:43,650 INFO L225 Difference]: With dead ends: 465 [2025-04-13 18:53:43,650 INFO L226 Difference]: Without dead ends: 456 [2025-04-13 18:53:43,650 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:53:43,650 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:43,650 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:53:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-04-13 18:53:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 384. [2025-04-13 18:53:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.1096605744125325) internal successors, (1191), 383 states have internal predecessors, (1191), 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 18:53:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1191 transitions. [2025-04-13 18:53:43,842 INFO L79 Accepts]: Start accepts. Automaton has 384 states and 1191 transitions. Word has length 20 [2025-04-13 18:53:43,842 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:43,843 INFO L485 AbstractCegarLoop]: Abstraction has 384 states and 1191 transitions. [2025-04-13 18:53:43,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 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 18:53:43,843 INFO L278 IsEmpty]: Start isEmpty. Operand 384 states and 1191 transitions. [2025-04-13 18:53:43,843 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:53:43,843 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:43,843 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:43,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 18:53:44,044 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 18:53:44,044 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:44,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:44,044 INFO L85 PathProgramCache]: Analyzing trace with hash 457127269, now seen corresponding path program 20 times [2025-04-13 18:53:44,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:44,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934253209] [2025-04-13 18:53:44,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:53:44,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:44,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:53:44,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:53:44,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:53:44,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:53:44,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:44,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934253209] [2025-04-13 18:53:44,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934253209] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:44,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370776975] [2025-04-13 18:53:44,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:53:44,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:44,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:44,150 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:53:44,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 18:53:44,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:53:44,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:53:44,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:53:44,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:44,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:53:44,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:53:44,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:53:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:53:44,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370776975] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:53:44,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:53:44,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-04-13 18:53:44,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454103311] [2025-04-13 18:53:44,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:53:44,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:53:44,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:44,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:53:44,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:53:44,333 INFO L87 Difference]: Start difference. First operand 384 states and 1191 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 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 18:54:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:06,112 INFO L93 Difference]: Finished difference Result 532 states and 1569 transitions. [2025-04-13 18:54:06,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:54:06,112 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 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 18:54:06,112 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:06,115 INFO L225 Difference]: With dead ends: 532 [2025-04-13 18:54:06,115 INFO L226 Difference]: Without dead ends: 523 [2025-04-13 18:54:06,115 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=243, Invalid=811, Unknown=2, NotChecked=0, Total=1056 [2025-04-13 18:54:06,115 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 144 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:06,115 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 0 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:54:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-04-13 18:54:06,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 406. [2025-04-13 18:54:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 3.1259259259259258) internal successors, (1266), 405 states have internal predecessors, (1266), 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 18:54:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1266 transitions. [2025-04-13 18:54:06,318 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 1266 transitions. Word has length 20 [2025-04-13 18:54:06,318 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:06,318 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 1266 transitions. [2025-04-13 18:54:06,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 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 18:54:06,318 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 1266 transitions. [2025-04-13 18:54:06,319 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:54:06,319 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:06,319 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:54:06,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-13 18:54:06,519 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 18:54:06,520 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:54:06,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1850753683, now seen corresponding path program 21 times [2025-04-13 18:54:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:06,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770277549] [2025-04-13 18:54:06,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:54:06,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:06,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 18:54:06,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:54:06,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:54:06,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:54:06,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:06,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770277549] [2025-04-13 18:54:06,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770277549] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:54:06,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512774265] [2025-04-13 18:54:06,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:54:06,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:54:06,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:54:06,655 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:54:06,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 18:54:06,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 18:54:06,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:54:06,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:54:06,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:06,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:54:06,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:54:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:54:06,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:54:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:54:06,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512774265] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:54:06,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:54:06,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-04-13 18:54:06,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307188860] [2025-04-13 18:54:06,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:54:06,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:54:06,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:06,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:54:06,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:54:06,874 INFO L87 Difference]: Start difference. First operand 406 states and 1266 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 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 18:54:07,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:07,957 INFO L93 Difference]: Finished difference Result 497 states and 1491 transitions. [2025-04-13 18:54:07,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:54:07,957 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 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 18:54:07,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:07,959 INFO L225 Difference]: With dead ends: 497 [2025-04-13 18:54:07,959 INFO L226 Difference]: Without dead ends: 488 [2025-04-13 18:54:07,959 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:54:07,960 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:07,960 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:54:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-04-13 18:54:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 416. [2025-04-13 18:54:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 3.125301204819277) internal successors, (1297), 415 states have internal predecessors, (1297), 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 18:54:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1297 transitions. [2025-04-13 18:54:08,172 INFO L79 Accepts]: Start accepts. Automaton has 416 states and 1297 transitions. Word has length 20 [2025-04-13 18:54:08,172 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:08,172 INFO L485 AbstractCegarLoop]: Abstraction has 416 states and 1297 transitions. [2025-04-13 18:54:08,172 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 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 18:54:08,172 INFO L278 IsEmpty]: Start isEmpty. Operand 416 states and 1297 transitions. [2025-04-13 18:54:08,173 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:54:08,173 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:08,173 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:54:08,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-04-13 18:54:08,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:54:08,374 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:54:08,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:08,374 INFO L85 PathProgramCache]: Analyzing trace with hash -293245347, now seen corresponding path program 22 times [2025-04-13 18:54:08,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:08,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716141254] [2025-04-13 18:54:08,374 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:54:08,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:08,378 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:54:08,381 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:54:08,381 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:54:08,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:54:08,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:08,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716141254] [2025-04-13 18:54:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716141254] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:54:08,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346347722] [2025-04-13 18:54:08,478 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:54:08,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:54:08,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:54:08,480 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:54:08,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 18:54:08,529 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:54:08,543 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:54:08,543 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:54:08,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:08,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:54:08,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:54:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:54:08,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:54:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:54:08,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346347722] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:54:08,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:54:08,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-13 18:54:08,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415879380] [2025-04-13 18:54:08,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:54:08,727 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:54:08,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:08,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:54:08,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:54:08,728 INFO L87 Difference]: Start difference. First operand 416 states and 1297 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 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 18:54:16,974 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 42 DAG size of output: 37 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:54:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:18,177 INFO L93 Difference]: Finished difference Result 552 states and 1600 transitions. [2025-04-13 18:54:18,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:54:18,177 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 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 18:54:18,177 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:18,179 INFO L225 Difference]: With dead ends: 552 [2025-04-13 18:54:18,179 INFO L226 Difference]: Without dead ends: 543 [2025-04-13 18:54:18,180 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:54:18,180 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:18,180 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:54:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-04-13 18:54:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 420. [2025-04-13 18:54:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 3.119331742243437) internal successors, (1307), 419 states have internal predecessors, (1307), 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 18:54:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1307 transitions. [2025-04-13 18:54:18,394 INFO L79 Accepts]: Start accepts. Automaton has 420 states and 1307 transitions. Word has length 20 [2025-04-13 18:54:18,394 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:18,394 INFO L485 AbstractCegarLoop]: Abstraction has 420 states and 1307 transitions. [2025-04-13 18:54:18,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 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 18:54:18,394 INFO L278 IsEmpty]: Start isEmpty. Operand 420 states and 1307 transitions. [2025-04-13 18:54:18,395 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:54:18,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:18,395 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:54:18,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 18:54:18,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:54:18,595 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:54:18,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:18,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1431142401, now seen corresponding path program 23 times [2025-04-13 18:54:18,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:18,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175901301] [2025-04-13 18:54:18,596 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:54:18,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:18,600 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 18:54:18,605 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:54:18,605 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:54:18,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:54:18,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:18,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175901301] [2025-04-13 18:54:18,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175901301] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:54:18,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471301574] [2025-04-13 18:54:18,727 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:54:18,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:54:18,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:54:18,728 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:54:18,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 18:54:18,769 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 18:54:18,820 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:54:18,820 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:54:18,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:18,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:54:18,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:54:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:54:18,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:54:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:54:19,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471301574] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:54:19,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:54:19,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-04-13 18:54:19,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345205298] [2025-04-13 18:54:19,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:54:19,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:54:19,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:19,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:54:19,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:54:19,006 INFO L87 Difference]: Start difference. First operand 420 states and 1307 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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 18:54:25,352 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:54:29,357 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:54:41,389 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:54:43,225 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:54:47,232 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:54:51,805 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:54:55,808 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:55:13,613 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:55:17,620 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:55:36,744 WARN L286 SmtUtils]: Spent 7.04s on a formula simplification. DAG size of input: 41 DAG size of output: 36 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:55:40,858 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:55:44,866 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:55:48,880 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:55:49,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:49,063 INFO L93 Difference]: Finished difference Result 569 states and 1663 transitions. [2025-04-13 18:55:49,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:55:49,063 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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 20 [2025-04-13 18:55:49,063 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:49,066 INFO L225 Difference]: With dead ends: 569 [2025-04-13 18:55:49,066 INFO L226 Difference]: Without dead ends: 556 [2025-04-13 18:55:49,066 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 42.1s TimeCoverageRelationStatistics Valid=257, Invalid=997, Unknown=6, NotChecked=0, Total=1260 [2025-04-13 18:55:49,066 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 29 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:49,066 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 747 Invalid, 10 Unknown, 0 Unchecked, 47.7s Time] [2025-04-13 18:55:49,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-04-13 18:55:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 456. [2025-04-13 18:55:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 3.1538461538461537) internal successors, (1435), 455 states have internal predecessors, (1435), 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 18:55:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1435 transitions. [2025-04-13 18:55:49,303 INFO L79 Accepts]: Start accepts. Automaton has 456 states and 1435 transitions. Word has length 20 [2025-04-13 18:55:49,303 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:49,303 INFO L485 AbstractCegarLoop]: Abstraction has 456 states and 1435 transitions. [2025-04-13 18:55:49,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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 18:55:49,303 INFO L278 IsEmpty]: Start isEmpty. Operand 456 states and 1435 transitions. [2025-04-13 18:55:49,303 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:55:49,303 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:49,304 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:55:49,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 18:55:49,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:55:49,504 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:55:49,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:49,504 INFO L85 PathProgramCache]: Analyzing trace with hash -109798785, now seen corresponding path program 24 times [2025-04-13 18:55:49,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:49,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879580703] [2025-04-13 18:55:49,505 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:55:49,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:49,509 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 4 equivalence classes. [2025-04-13 18:55:49,516 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:55:49,517 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 18:55:49,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:55:49,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:49,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879580703] [2025-04-13 18:55:49,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879580703] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:55:49,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676532143] [2025-04-13 18:55:49,592 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:55:49,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:55:49,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:55:49,594 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:55:49,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 18:55:49,637 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 4 equivalence classes. [2025-04-13 18:55:49,681 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:55:49,681 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 18:55:49,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:49,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:55:49,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:55:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:55:49,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:55:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:55:49,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676532143] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:55:49,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:55:49,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-13 18:55:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126635688] [2025-04-13 18:55:49,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:55:49,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:55:49,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:49,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:55:49,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:55:49,851 INFO L87 Difference]: Start difference. First operand 456 states and 1435 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 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 18:55:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:51,112 INFO L93 Difference]: Finished difference Result 613 states and 1822 transitions. [2025-04-13 18:55:51,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:55:51,112 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 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 18:55:51,112 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:51,115 INFO L225 Difference]: With dead ends: 613 [2025-04-13 18:55:51,115 INFO L226 Difference]: Without dead ends: 599 [2025-04-13 18:55:51,115 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:51,118 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:51,118 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:55:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-04-13 18:55:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 494. [2025-04-13 18:55:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.18052738336714) internal successors, (1568), 493 states have internal predecessors, (1568), 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 18:55:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1568 transitions. [2025-04-13 18:55:51,378 INFO L79 Accepts]: Start accepts. Automaton has 494 states and 1568 transitions. Word has length 20 [2025-04-13 18:55:51,378 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:51,378 INFO L485 AbstractCegarLoop]: Abstraction has 494 states and 1568 transitions. [2025-04-13 18:55:51,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 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 18:55:51,378 INFO L278 IsEmpty]: Start isEmpty. Operand 494 states and 1568 transitions. [2025-04-13 18:55:51,379 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:55:51,379 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:51,379 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:55:51,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-04-13 18:55:51,579 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:55:51,579 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:55:51,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:51,580 INFO L85 PathProgramCache]: Analyzing trace with hash -893286823, now seen corresponding path program 25 times [2025-04-13 18:55:51,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:51,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287087213] [2025-04-13 18:55:51,580 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:55:51,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:51,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:55:51,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:55:51,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:55:51,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:55:51,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:51,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287087213] [2025-04-13 18:55:51,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287087213] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:55:51,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016718781] [2025-04-13 18:55:51,690 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:55:51,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:55:51,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:55:51,692 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:55:51,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 18:55:51,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:55:51,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:55:51,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:55:51,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:51,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:55:51,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:55:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:55:51,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:55:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:55:51,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016718781] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:55:51,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:55:51,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-04-13 18:55:51,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089699188] [2025-04-13 18:55:51,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:55:51,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:55:51,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:51,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:55:51,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:55:51,941 INFO L87 Difference]: Start difference. First operand 494 states and 1568 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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 18:55:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:53,660 INFO L93 Difference]: Finished difference Result 598 states and 1754 transitions. [2025-04-13 18:55:53,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:55:53,661 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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 18:55:53,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:53,663 INFO L225 Difference]: With dead ends: 598 [2025-04-13 18:55:53,663 INFO L226 Difference]: Without dead ends: 585 [2025-04-13 18:55:53,664 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:55:53,664 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:53,664 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:55:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-04-13 18:55:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 494. [2025-04-13 18:55:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.1724137931034484) internal successors, (1564), 493 states have internal predecessors, (1564), 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 18:55:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1564 transitions. [2025-04-13 18:55:53,918 INFO L79 Accepts]: Start accepts. Automaton has 494 states and 1564 transitions. Word has length 20 [2025-04-13 18:55:53,918 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:53,918 INFO L485 AbstractCegarLoop]: Abstraction has 494 states and 1564 transitions. [2025-04-13 18:55:53,918 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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 18:55:53,918 INFO L278 IsEmpty]: Start isEmpty. Operand 494 states and 1564 transitions. [2025-04-13 18:55:53,919 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:55:53,919 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:53,919 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:55:53,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 18:55:54,119 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-04-13 18:55:54,120 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:55:54,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:54,120 INFO L85 PathProgramCache]: Analyzing trace with hash 596118173, now seen corresponding path program 26 times [2025-04-13 18:55:54,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:54,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93571275] [2025-04-13 18:55:54,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:55:54,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:54,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:55:54,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:55:54,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:55:54,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:55:54,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:54,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93571275] [2025-04-13 18:55:54,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93571275] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:55:54,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513156813] [2025-04-13 18:55:54,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:55:54,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:55:54,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:55:54,218 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:55:54,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 18:55:54,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:55:54,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:55:54,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:55:54,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:54,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:55:54,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:55:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:55:54,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:55:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:55:54,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513156813] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:55:54,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:55:54,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-04-13 18:55:54,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697736018] [2025-04-13 18:55:54,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:55:54,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:55:54,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:54,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:55:54,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:55:54,454 INFO L87 Difference]: Start difference. First operand 494 states and 1564 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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 18:55:59,568 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:55:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:59,735 INFO L93 Difference]: Finished difference Result 582 states and 1757 transitions. [2025-04-13 18:55:59,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:55:59,737 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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 18:55:59,737 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:59,742 INFO L225 Difference]: With dead ends: 582 [2025-04-13 18:55:59,743 INFO L226 Difference]: Without dead ends: 565 [2025-04-13 18:55:59,743 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:55:59,743 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:59,743 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 531 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-04-13 18:55:59,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-04-13 18:56:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 500. [2025-04-13 18:56:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 499 states have (on average 3.1683366733466936) internal successors, (1581), 499 states have internal predecessors, (1581), 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 18:56:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1581 transitions. [2025-04-13 18:56:00,012 INFO L79 Accepts]: Start accepts. Automaton has 500 states and 1581 transitions. Word has length 20 [2025-04-13 18:56:00,012 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:00,012 INFO L485 AbstractCegarLoop]: Abstraction has 500 states and 1581 transitions. [2025-04-13 18:56:00,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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 18:56:00,012 INFO L278 IsEmpty]: Start isEmpty. Operand 500 states and 1581 transitions. [2025-04-13 18:56:00,013 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:56:00,013 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:00,013 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:56:00,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 18:56:00,213 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:00,213 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:56:00,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:00,214 INFO L85 PathProgramCache]: Analyzing trace with hash -616145051, now seen corresponding path program 27 times [2025-04-13 18:56:00,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:00,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548388738] [2025-04-13 18:56:00,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:56:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:00,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-04-13 18:56:00,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:56:00,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 18:56:00,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:56:00,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:00,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548388738] [2025-04-13 18:56:00,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548388738] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:56:00,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784507171] [2025-04-13 18:56:00,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:56:00,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:00,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:56:00,347 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:56:00,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 18:56:00,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-04-13 18:56:00,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:56:00,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 18:56:00,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:00,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:56:00,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:56:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:00,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:56:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:00,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784507171] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:56:00,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:56:00,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-04-13 18:56:00,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362239328] [2025-04-13 18:56:00,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:56:00,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:56:00,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:00,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:56:00,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:56:00,583 INFO L87 Difference]: Start difference. First operand 500 states and 1581 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 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 18:56:08,766 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:56:09,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:09,418 INFO L93 Difference]: Finished difference Result 639 states and 1912 transitions. [2025-04-13 18:56:09,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:56:09,418 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 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 18:56:09,418 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:09,421 INFO L225 Difference]: With dead ends: 639 [2025-04-13 18:56:09,421 INFO L226 Difference]: Without dead ends: 627 [2025-04-13 18:56:09,421 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:56:09,421 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:09,421 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 606 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-04-13 18:56:09,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-04-13 18:56:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 516. [2025-04-13 18:56:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 3.1864077669902913) internal successors, (1641), 515 states have internal predecessors, (1641), 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 18:56:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1641 transitions. [2025-04-13 18:56:09,695 INFO L79 Accepts]: Start accepts. Automaton has 516 states and 1641 transitions. Word has length 20 [2025-04-13 18:56:09,695 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:09,696 INFO L485 AbstractCegarLoop]: Abstraction has 516 states and 1641 transitions. [2025-04-13 18:56:09,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 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 18:56:09,696 INFO L278 IsEmpty]: Start isEmpty. Operand 516 states and 1641 transitions. [2025-04-13 18:56:09,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:56:09,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:09,696 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:56:09,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-04-13 18:56:09,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:09,897 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:56:09,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:09,897 INFO L85 PathProgramCache]: Analyzing trace with hash 424232343, now seen corresponding path program 28 times [2025-04-13 18:56:09,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:09,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828812853] [2025-04-13 18:56:09,897 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:56:09,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:09,901 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:56:09,904 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:56:09,904 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:56:09,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:10,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:10,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828812853] [2025-04-13 18:56:10,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828812853] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:56:10,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226277516] [2025-04-13 18:56:10,008 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:56:10,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:10,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:56:10,010 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:56:10,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 18:56:10,060 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:56:10,075 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:56:10,075 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:56:10,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:10,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:56:10,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:56:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:10,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:56:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:10,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226277516] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:56:10,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:56:10,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-13 18:56:10,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501798324] [2025-04-13 18:56:10,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:56:10,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:56:10,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:10,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:56:10,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:56:10,317 INFO L87 Difference]: Start difference. First operand 516 states and 1641 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 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 18:56:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:20,890 INFO L93 Difference]: Finished difference Result 644 states and 1950 transitions. [2025-04-13 18:56:20,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:56:20,891 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 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 20 [2025-04-13 18:56:20,891 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:20,893 INFO L225 Difference]: With dead ends: 644 [2025-04-13 18:56:20,893 INFO L226 Difference]: Without dead ends: 635 [2025-04-13 18:56:20,894 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=249, Invalid=940, Unknown=1, NotChecked=0, Total=1190 [2025-04-13 18:56:20,894 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:20,894 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:56:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-04-13 18:56:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 530. [2025-04-13 18:56:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 3.1947069943289224) internal successors, (1690), 529 states have internal predecessors, (1690), 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 18:56:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2025-04-13 18:56:21,185 INFO L79 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 20 [2025-04-13 18:56:21,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:21,185 INFO L485 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2025-04-13 18:56:21,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 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 18:56:21,185 INFO L278 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2025-04-13 18:56:21,186 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:56:21,186 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:21,186 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:56:21,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-04-13 18:56:21,386 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 18:56:21,386 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:56:21,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:21,387 INFO L85 PathProgramCache]: Analyzing trace with hash 69823327, now seen corresponding path program 29 times [2025-04-13 18:56:21,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:21,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212627147] [2025-04-13 18:56:21,387 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:56:21,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:21,391 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 4 equivalence classes. [2025-04-13 18:56:21,396 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:56:21,396 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 18:56:21,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:56:21,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:21,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212627147] [2025-04-13 18:56:21,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212627147] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:56:21,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973337476] [2025-04-13 18:56:21,493 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:56:21,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:21,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:56:21,494 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:56:21,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 18:56:21,538 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 4 equivalence classes. [2025-04-13 18:56:21,565 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:56:21,565 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 18:56:21,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:21,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:56:21,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:56:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:21,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:56:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:21,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973337476] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:56:21,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:56:21,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-04-13 18:56:21,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828809115] [2025-04-13 18:56:21,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:56:21,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:56:21,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:21,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:56:21,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:56:21,747 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 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 18:56:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:23,570 INFO L93 Difference]: Finished difference Result 648 states and 1957 transitions. [2025-04-13 18:56:23,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:56:23,570 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 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 18:56:23,570 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:23,572 INFO L225 Difference]: With dead ends: 648 [2025-04-13 18:56:23,572 INFO L226 Difference]: Without dead ends: 637 [2025-04-13 18:56:23,573 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=606, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:56:23,573 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:23,573 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:56:23,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-04-13 18:56:23,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 536. [2025-04-13 18:56:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 3.1869158878504673) internal successors, (1705), 535 states have internal predecessors, (1705), 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 18:56:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1705 transitions. [2025-04-13 18:56:23,869 INFO L79 Accepts]: Start accepts. Automaton has 536 states and 1705 transitions. Word has length 20 [2025-04-13 18:56:23,869 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:23,869 INFO L485 AbstractCegarLoop]: Abstraction has 536 states and 1705 transitions. [2025-04-13 18:56:23,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 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 18:56:23,869 INFO L278 IsEmpty]: Start isEmpty. Operand 536 states and 1705 transitions. [2025-04-13 18:56:23,870 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:56:23,870 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:23,870 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:56:23,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 18:56:24,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 18:56:24,071 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:56:24,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash -713664711, now seen corresponding path program 30 times [2025-04-13 18:56:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:24,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899998109] [2025-04-13 18:56:24,071 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:56:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:24,074 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 18:56:24,079 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:56:24,079 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:56:24,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:56:24,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:24,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899998109] [2025-04-13 18:56:24,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899998109] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:56:24,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224843645] [2025-04-13 18:56:24,158 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:56:24,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:24,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:56:24,160 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:56:24,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 18:56:24,206 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 18:56:24,219 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:56:24,220 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:56:24,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:24,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:56:24,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:56:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:24,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:56:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:24,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224843645] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:56:24,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:56:24,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-04-13 18:56:24,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877511741] [2025-04-13 18:56:24,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:56:24,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:56:24,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:24,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:56:24,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:56:24,378 INFO L87 Difference]: Start difference. First operand 536 states and 1705 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 18:56:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:29,657 INFO L93 Difference]: Finished difference Result 586 states and 1792 transitions. [2025-04-13 18:56:29,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:56:29,658 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 20 [2025-04-13 18:56:29,658 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:29,660 INFO L225 Difference]: With dead ends: 586 [2025-04-13 18:56:29,660 INFO L226 Difference]: Without dead ends: 573 [2025-04-13 18:56:29,660 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=194, Invalid=736, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:56:29,661 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:29,661 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:56:29,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-04-13 18:56:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 504. [2025-04-13 18:56:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 3.1749502982107356) internal successors, (1597), 503 states have internal predecessors, (1597), 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 18:56:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1597 transitions. [2025-04-13 18:56:29,937 INFO L79 Accepts]: Start accepts. Automaton has 504 states and 1597 transitions. Word has length 20 [2025-04-13 18:56:29,937 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:29,937 INFO L485 AbstractCegarLoop]: Abstraction has 504 states and 1597 transitions. [2025-04-13 18:56:29,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 18:56:29,938 INFO L278 IsEmpty]: Start isEmpty. Operand 504 states and 1597 transitions. [2025-04-13 18:56:29,938 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:56:29,938 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:29,938 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:56:29,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 18:56:30,139 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 18:56:30,139 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:56:30,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:30,139 INFO L85 PathProgramCache]: Analyzing trace with hash 607678905, now seen corresponding path program 31 times [2025-04-13 18:56:30,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:30,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454015531] [2025-04-13 18:56:30,139 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:56:30,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:30,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:56:30,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:56:30,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:56:30,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:30,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:30,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454015531] [2025-04-13 18:56:30,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454015531] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:56:30,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56039154] [2025-04-13 18:56:30,268 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:56:30,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:30,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:56:30,270 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:56:30,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 18:56:30,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:56:30,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:56:30,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:56:30,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:30,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:56:30,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:56:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:30,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:56:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:30,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56039154] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:56:30,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:56:30,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-13 18:56:30,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207843993] [2025-04-13 18:56:30,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:56:30,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:56:30,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:30,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:56:30,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:56:30,487 INFO L87 Difference]: Start difference. First operand 504 states and 1597 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 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 18:56:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:40,518 INFO L93 Difference]: Finished difference Result 651 states and 1880 transitions. [2025-04-13 18:56:40,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:56:40,518 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 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 20 [2025-04-13 18:56:40,518 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:40,521 INFO L225 Difference]: With dead ends: 651 [2025-04-13 18:56:40,521 INFO L226 Difference]: Without dead ends: 639 [2025-04-13 18:56:40,521 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:56:40,521 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:40,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:56:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-04-13 18:56:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 514. [2025-04-13 18:56:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 3.185185185185185) internal successors, (1634), 513 states have internal predecessors, (1634), 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 18:56:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1634 transitions. [2025-04-13 18:56:40,812 INFO L79 Accepts]: Start accepts. Automaton has 514 states and 1634 transitions. Word has length 20 [2025-04-13 18:56:40,812 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:40,812 INFO L485 AbstractCegarLoop]: Abstraction has 514 states and 1634 transitions. [2025-04-13 18:56:40,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 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 18:56:40,812 INFO L278 IsEmpty]: Start isEmpty. Operand 514 states and 1634 transitions. [2025-04-13 18:56:40,813 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:56:40,813 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:40,813 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:56:40,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2025-04-13 18:56:41,013 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 18:56:41,013 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:56:41,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash -175809133, now seen corresponding path program 32 times [2025-04-13 18:56:41,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:41,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834741718] [2025-04-13 18:56:41,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:56:41,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:41,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:56:41,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:56:41,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:56:41,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:56:41,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:41,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834741718] [2025-04-13 18:56:41,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834741718] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:56:41,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683923341] [2025-04-13 18:56:41,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:56:41,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:41,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:56:41,106 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:56:41,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 18:56:41,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:56:41,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:56:41,163 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:56:41,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:41,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:56:41,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:56:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:41,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:56:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:41,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683923341] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:56:41,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:56:41,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-04-13 18:56:41,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785891963] [2025-04-13 18:56:41,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:56:41,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:56:41,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:41,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:56:41,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:56:41,346 INFO L87 Difference]: Start difference. First operand 514 states and 1634 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:42,551 INFO L93 Difference]: Finished difference Result 609 states and 1793 transitions. [2025-04-13 18:56:42,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:56:42,551 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 18:56:42,551 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:42,553 INFO L225 Difference]: With dead ends: 609 [2025-04-13 18:56:42,554 INFO L226 Difference]: Without dead ends: 596 [2025-04-13 18:56:42,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:56:42,554 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:42,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:56:42,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-04-13 18:56:42,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 502. [2025-04-13 18:56:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 3.1696606786427144) internal successors, (1588), 501 states have internal predecessors, (1588), 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 18:56:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1588 transitions. [2025-04-13 18:56:42,829 INFO L79 Accepts]: Start accepts. Automaton has 502 states and 1588 transitions. Word has length 20 [2025-04-13 18:56:42,829 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:42,829 INFO L485 AbstractCegarLoop]: Abstraction has 502 states and 1588 transitions. [2025-04-13 18:56:42,829 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:42,829 INFO L278 IsEmpty]: Start isEmpty. Operand 502 states and 1588 transitions. [2025-04-13 18:56:42,829 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:56:42,829 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:42,830 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:56:42,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 18:56:43,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:43,030 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:56:43,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:43,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1313595863, now seen corresponding path program 33 times [2025-04-13 18:56:43,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:43,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125268043] [2025-04-13 18:56:43,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:56:43,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:43,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 18:56:43,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:56:43,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:56:43,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:43,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:43,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125268043] [2025-04-13 18:56:43,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125268043] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:56:43,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753048445] [2025-04-13 18:56:43,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:56:43,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:43,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:56:43,143 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:56:43,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 18:56:43,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 18:56:43,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:56:43,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:56:43,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:43,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:56:43,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:56:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:43,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:56:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:56:43,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753048445] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:56:43,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:56:43,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-13 18:56:43,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870570637] [2025-04-13 18:56:43,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:56:43,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:56:43,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:43,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:56:43,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:56:43,392 INFO L87 Difference]: Start difference. First operand 502 states and 1588 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 18:56:48,570 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:56:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:48,773 INFO L93 Difference]: Finished difference Result 631 states and 1881 transitions. [2025-04-13 18:56:48,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:56:48,774 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 20 [2025-04-13 18:56:48,774 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:48,776 INFO L225 Difference]: With dead ends: 631 [2025-04-13 18:56:48,776 INFO L226 Difference]: Without dead ends: 614 [2025-04-13 18:56:48,776 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:56:48,776 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:48,777 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 582 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-04-13 18:56:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-04-13 18:56:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 506. [2025-04-13 18:56:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 3.1603960396039605) internal successors, (1596), 505 states have internal predecessors, (1596), 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 18:56:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1596 transitions. [2025-04-13 18:56:49,059 INFO L79 Accepts]: Start accepts. Automaton has 506 states and 1596 transitions. Word has length 20 [2025-04-13 18:56:49,059 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:49,059 INFO L485 AbstractCegarLoop]: Abstraction has 506 states and 1596 transitions. [2025-04-13 18:56:49,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 18:56:49,060 INFO L278 IsEmpty]: Start isEmpty. Operand 506 states and 1596 transitions. [2025-04-13 18:56:49,060 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:56:49,060 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:49,060 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:56:49,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 18:56:49,260 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-04-13 18:56:49,261 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:56:49,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:49,261 INFO L85 PathProgramCache]: Analyzing trace with hash 83776708, now seen corresponding path program 34 times [2025-04-13 18:56:49,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:49,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890945613] [2025-04-13 18:56:49,261 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:56:49,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:49,265 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 18:56:49,272 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:56:49,272 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:56:49,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:50,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:56:50,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:50,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890945613] [2025-04-13 18:56:50,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890945613] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:56:50,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851300112] [2025-04-13 18:56:50,461 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:56:50,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:50,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:56:50,463 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:56:50,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-13 18:56:50,511 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 18:56:50,530 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:56:50,530 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:56:50,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:50,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 18:56:50,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:56:50,584 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:56:50,930 INFO L325 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2025-04-13 18:56:50,930 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 48 [2025-04-13 18:56:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:56:50,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:56:51,622 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 396 treesize of output 348 [2025-04-13 18:56:53,551 INFO L325 Elim1Store]: treesize reduction 5, result has 99.1 percent of original size [2025-04-13 18:56:53,552 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 19 new quantified variables, introduced 55 case distinctions, treesize of input 4609 treesize of output 2492 [2025-04-13 19:02:19,637 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 19:02:19,637 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 101 [2025-04-13 19:02:19,638 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 19:02:19,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-04-13 19:02:19,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-04-13 19:02:19,840 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2025-04-13 19:02:19,845 INFO L158 Benchmark]: Toolchain (without parser) took 654976.86ms. Allocated memory was 125.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 86.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 739.4MB. Max. memory is 8.0GB. [2025-04-13 19:02:19,846 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:02:19,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.98ms. Allocated memory is still 125.8MB. Free memory was 86.6MB in the beginning and 71.8MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 19:02:19,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.10ms. Allocated memory is still 125.8MB. Free memory was 71.8MB in the beginning and 69.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:02:19,846 INFO L158 Benchmark]: Boogie Preprocessor took 55.87ms. Allocated memory is still 125.8MB. Free memory was 69.7MB in the beginning and 68.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:02:19,846 INFO L158 Benchmark]: RCFGBuilder took 456.16ms. Allocated memory is still 125.8MB. Free memory was 67.6MB in the beginning and 24.2MB in the end (delta: 43.4MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-13 19:02:19,846 INFO L158 Benchmark]: TraceAbstraction took 654168.96ms. Allocated memory was 125.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 23.5MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 676.4MB. Max. memory is 8.0GB. [2025-04-13 19:02:19,846 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.18ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.98ms. Allocated memory is still 125.8MB. Free memory was 86.6MB in the beginning and 71.8MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.10ms. Allocated memory is still 125.8MB. Free memory was 71.8MB in the beginning and 69.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.87ms. Allocated memory is still 125.8MB. Free memory was 69.7MB in the beginning and 68.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 456.16ms. Allocated memory is still 125.8MB. Free memory was 67.6MB in the beginning and 24.2MB in the end (delta: 43.4MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 654168.96ms. Allocated memory was 125.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 23.5MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 676.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...