/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/parallel-min-max-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:03:09,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:03:09,958 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:03:09,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:03:09,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:03:09,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:03:09,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:03:09,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:03:09,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:03:09,986 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:03:09,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:03:09,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:03:09,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:03:09,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:03:09,987 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:03:09,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:03:09,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:03:09,987 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:03:09,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:03:09,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:03:09,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:03:09,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:03:09,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:03:09,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:03:09,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:03:09,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:03:09,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:03:09,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:03:09,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:03:09,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:03:09,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:03:09,989 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:03:10,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:03:10,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:03:10,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:03:10,224 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:03:10,224 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:03:10,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2025-04-13 18:03:11,496 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/257900ba2/42fc8c13bbac4f6791a6d717a43e97bf/FLAG58b21ca96 [2025-04-13 18:03:11,756 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:03:11,756 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2025-04-13 18:03:11,764 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/257900ba2/42fc8c13bbac4f6791a6d717a43e97bf/FLAG58b21ca96 [2025-04-13 18:03:12,546 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/257900ba2/42fc8c13bbac4f6791a6d717a43e97bf [2025-04-13 18:03:12,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:03:12,549 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:03:12,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:03:12,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:03:12,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:03:12,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:03:12" (1/1) ... [2025-04-13 18:03:12,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758df91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:12, skipping insertion in model container [2025-04-13 18:03:12,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:03:12" (1/1) ... [2025-04-13 18:03:12,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:03:12,754 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/parallel-min-max-1.wvr.c[2642,2655] [2025-04-13 18:03:12,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:03:12,777 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:03:12,819 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/parallel-min-max-1.wvr.c[2642,2655] [2025-04-13 18:03:12,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:03:12,840 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:03:12,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:12 WrapperNode [2025-04-13 18:03:12,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:03:12,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:03:12,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:03:12,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:03:12,850 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:03:12" (1/1) ... [2025-04-13 18:03:12,865 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:03:12" (1/1) ... [2025-04-13 18:03:12,892 INFO L138 Inliner]: procedures = 22, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-04-13 18:03:12,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:03:12,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:03:12,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:03:12,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:03:12,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:12" (1/1) ... [2025-04-13 18:03:12,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:12" (1/1) ... [2025-04-13 18:03:12,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:12" (1/1) ... [2025-04-13 18:03:12,913 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 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:03:12,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:12" (1/1) ... [2025-04-13 18:03:12,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:12" (1/1) ... [2025-04-13 18:03:12,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:12" (1/1) ... [2025-04-13 18:03:12,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:12" (1/1) ... [2025-04-13 18:03:12,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:12" (1/1) ... [2025-04-13 18:03:12,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:12" (1/1) ... [2025-04-13 18:03:12,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:12" (1/1) ... [2025-04-13 18:03:12,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:03:12,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:03:12,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:03:12,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:03:12,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:12" (1/1) ... [2025-04-13 18:03:12,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:03:12,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:12,968 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:03:12,975 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:03:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:03:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:03:12,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:03:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:03:12,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:03:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:03:12,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:03:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:03:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:03:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:03:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:03:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:03:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:03:12,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:03:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:03:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:03:12,992 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:03:13,069 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:03:13,071 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:03:13,275 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:03:13,276 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:03:13,276 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:03:13,430 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:03:13,436 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:03:13,440 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:03:13,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:03:13 BoogieIcfgContainer [2025-04-13 18:03:13,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:03:13,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:03:13,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:03:13,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:03:13,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:03:12" (1/3) ... [2025-04-13 18:03:13,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5154b92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:03:13, skipping insertion in model container [2025-04-13 18:03:13,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:12" (2/3) ... [2025-04-13 18:03:13,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5154b92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:03:13, skipping insertion in model container [2025-04-13 18:03:13,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:03:13" (3/3) ... [2025-04-13 18:03:13,450 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2025-04-13 18:03:13,461 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:03:13,463 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-min-max-1.wvr.c that has 4 procedures, 46 locations, 51 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 18:03:13,463 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:03:13,521 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 18:03:13,548 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 54 transitions, 129 flow [2025-04-13 18:03:13,626 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 709 states, 708 states have (on average 3.8008474576271185) internal successors, (2691), 708 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have 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:03:13,647 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:03:13,657 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;@d3d6d53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:03:13,657 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 18:03:13,660 INFO L278 IsEmpty]: Start isEmpty. Operand has 709 states, 708 states have (on average 3.8008474576271185) internal successors, (2691), 708 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have 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:03:13,671 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 18:03:13,671 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:13,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:13,672 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:13,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash 602956536, now seen corresponding path program 1 times [2025-04-13 18:03:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:13,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88864810] [2025-04-13 18:03:13,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:13,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 18:03:13,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:03:13,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:13,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:13,919 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:03:13,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:13,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88864810] [2025-04-13 18:03:13,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88864810] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:13,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:13,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:03:13,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149021363] [2025-04-13 18:03:13,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:13,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:03:13,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:13,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:03:13,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:03:13,944 INFO L87 Difference]: Start difference. First operand has 709 states, 708 states have (on average 3.8008474576271185) internal successors, (2691), 708 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:03:14,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:14,044 INFO L93 Difference]: Finished difference Result 899 states and 3202 transitions. [2025-04-13 18:03:14,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:03:14,046 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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 37 [2025-04-13 18:03:14,047 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:14,065 INFO L225 Difference]: With dead ends: 899 [2025-04-13 18:03:14,065 INFO L226 Difference]: Without dead ends: 709 [2025-04-13 18:03:14,069 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:03:14,073 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:14,074 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 18 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-04-13 18:03:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2025-04-13 18:03:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 3.5663841807909606) internal successors, (2525), 708 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have 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:03:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 2525 transitions. [2025-04-13 18:03:14,151 INFO L79 Accepts]: Start accepts. Automaton has 709 states and 2525 transitions. Word has length 37 [2025-04-13 18:03:14,152 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:14,152 INFO L485 AbstractCegarLoop]: Abstraction has 709 states and 2525 transitions. [2025-04-13 18:03:14,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:03:14,152 INFO L278 IsEmpty]: Start isEmpty. Operand 709 states and 2525 transitions. [2025-04-13 18:03:14,155 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 18:03:14,155 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:14,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:14,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:03:14,156 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:14,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:14,156 INFO L85 PathProgramCache]: Analyzing trace with hash -326509571, now seen corresponding path program 1 times [2025-04-13 18:03:14,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:14,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839803221] [2025-04-13 18:03:14,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:14,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:14,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 18:03:14,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 18:03:14,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:14,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:14,404 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:03:14,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:14,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839803221] [2025-04-13 18:03:14,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839803221] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:14,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:14,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:03:14,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850157108] [2025-04-13 18:03:14,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:14,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:03:14,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:14,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:03:14,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:03:14,408 INFO L87 Difference]: Start difference. First operand 709 states and 2525 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have 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:03:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:14,503 INFO L93 Difference]: Finished difference Result 1405 states and 5037 transitions. [2025-04-13 18:03:14,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:03:14,503 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-04-13 18:03:14,503 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:14,509 INFO L225 Difference]: With dead ends: 1405 [2025-04-13 18:03:14,510 INFO L226 Difference]: Without dead ends: 710 [2025-04-13 18:03:14,513 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:03:14,514 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:14,515 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 34 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-04-13 18:03:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2025-04-13 18:03:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 3.562764456981664) internal successors, (2526), 709 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have 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:03:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 2526 transitions. [2025-04-13 18:03:14,541 INFO L79 Accepts]: Start accepts. Automaton has 710 states and 2526 transitions. Word has length 39 [2025-04-13 18:03:14,542 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:14,542 INFO L485 AbstractCegarLoop]: Abstraction has 710 states and 2526 transitions. [2025-04-13 18:03:14,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have 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:03:14,542 INFO L278 IsEmpty]: Start isEmpty. Operand 710 states and 2526 transitions. [2025-04-13 18:03:14,545 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:03:14,545 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:14,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:14,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:03:14,546 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:14,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1495235206, now seen corresponding path program 1 times [2025-04-13 18:03:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:14,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076418749] [2025-04-13 18:03:14,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:14,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:14,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:03:14,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:03:14,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:14,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:14,884 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:03:14,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:14,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076418749] [2025-04-13 18:03:14,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076418749] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:14,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:14,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:03:14,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172235259] [2025-04-13 18:03:14,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:14,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:03:14,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:14,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:03:14,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:03:14,885 INFO L87 Difference]: Start difference. First operand 710 states and 2526 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 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:03:15,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:15,067 INFO L93 Difference]: Finished difference Result 850 states and 3035 transitions. [2025-04-13 18:03:15,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:03:15,068 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 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 40 [2025-04-13 18:03:15,068 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:15,072 INFO L225 Difference]: With dead ends: 850 [2025-04-13 18:03:15,073 INFO L226 Difference]: Without dead ends: 574 [2025-04-13 18:03:15,074 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:03:15,074 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 55 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:15,074 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 53 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:15,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-04-13 18:03:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2025-04-13 18:03:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 3.5287958115183247) internal successors, (2022), 573 states have internal predecessors, (2022), 0 states have call successors, (0), 0 states have 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:03:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 2022 transitions. [2025-04-13 18:03:15,093 INFO L79 Accepts]: Start accepts. Automaton has 574 states and 2022 transitions. Word has length 40 [2025-04-13 18:03:15,094 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:15,094 INFO L485 AbstractCegarLoop]: Abstraction has 574 states and 2022 transitions. [2025-04-13 18:03:15,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 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:03:15,094 INFO L278 IsEmpty]: Start isEmpty. Operand 574 states and 2022 transitions. [2025-04-13 18:03:15,096 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:03:15,096 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:15,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:15,096 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:03:15,096 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:15,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:15,097 INFO L85 PathProgramCache]: Analyzing trace with hash 223535958, now seen corresponding path program 2 times [2025-04-13 18:03:15,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:15,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694537210] [2025-04-13 18:03:15,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:15,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:03:15,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 40 statements. [2025-04-13 18:03:15,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:15,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:15,342 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:03:15,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:15,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694537210] [2025-04-13 18:03:15,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694537210] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:15,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:15,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:03:15,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629709168] [2025-04-13 18:03:15,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:15,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:03:15,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:15,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:03:15,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:03:15,344 INFO L87 Difference]: Start difference. First operand 574 states and 2022 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 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:03:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:15,749 INFO L93 Difference]: Finished difference Result 1209 states and 4292 transitions. [2025-04-13 18:03:15,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:03:15,750 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 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 40 [2025-04-13 18:03:15,750 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:15,755 INFO L225 Difference]: With dead ends: 1209 [2025-04-13 18:03:15,755 INFO L226 Difference]: Without dead ends: 652 [2025-04-13 18:03:15,756 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:03:15,757 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 103 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:15,757 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 115 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-04-13 18:03:15,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 622. [2025-04-13 18:03:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 3.281803542673108) internal successors, (2038), 621 states have internal predecessors, (2038), 0 states have call successors, (0), 0 states have 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:03:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 2038 transitions. [2025-04-13 18:03:15,779 INFO L79 Accepts]: Start accepts. Automaton has 622 states and 2038 transitions. Word has length 40 [2025-04-13 18:03:15,779 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:15,779 INFO L485 AbstractCegarLoop]: Abstraction has 622 states and 2038 transitions. [2025-04-13 18:03:15,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 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:03:15,779 INFO L278 IsEmpty]: Start isEmpty. Operand 622 states and 2038 transitions. [2025-04-13 18:03:15,781 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 18:03:15,781 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:15,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:15,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:03:15,781 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:15,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:15,782 INFO L85 PathProgramCache]: Analyzing trace with hash -472076523, now seen corresponding path program 1 times [2025-04-13 18:03:15,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:15,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613837045] [2025-04-13 18:03:15,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:15,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:15,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 18:03:15,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:03:15,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:15,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:16,133 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:03:16,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:16,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613837045] [2025-04-13 18:03:16,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613837045] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:16,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:16,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:16,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693407725] [2025-04-13 18:03:16,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:16,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:16,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:16,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:16,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:16,135 INFO L87 Difference]: Start difference. First operand 622 states and 2038 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 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:03:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:17,499 INFO L93 Difference]: Finished difference Result 1659 states and 6242 transitions. [2025-04-13 18:03:17,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 18:03:17,500 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 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 41 [2025-04-13 18:03:17,500 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:17,516 INFO L225 Difference]: With dead ends: 1659 [2025-04-13 18:03:17,517 INFO L226 Difference]: Without dead ends: 1356 [2025-04-13 18:03:17,524 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=410, Invalid=1570, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 18:03:17,525 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 535 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:17,525 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 166 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:03:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-04-13 18:03:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 854. [2025-04-13 18:03:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 853 states have (on average 3.4279015240328254) internal successors, (2924), 853 states have internal predecessors, (2924), 0 states have call successors, (0), 0 states have 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:03:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 2924 transitions. [2025-04-13 18:03:17,601 INFO L79 Accepts]: Start accepts. Automaton has 854 states and 2924 transitions. Word has length 41 [2025-04-13 18:03:17,601 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:17,602 INFO L485 AbstractCegarLoop]: Abstraction has 854 states and 2924 transitions. [2025-04-13 18:03:17,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 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:03:17,602 INFO L278 IsEmpty]: Start isEmpty. Operand 854 states and 2924 transitions. [2025-04-13 18:03:17,605 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 18:03:17,606 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:17,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:17,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:03:17,606 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:17,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:17,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1768059699, now seen corresponding path program 1 times [2025-04-13 18:03:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:17,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281455340] [2025-04-13 18:03:17,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:17,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:17,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 18:03:17,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 18:03:17,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:17,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:18,162 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:03:18,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:18,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281455340] [2025-04-13 18:03:18,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281455340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:18,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:18,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:18,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749528596] [2025-04-13 18:03:18,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:18,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:03:18,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:18,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:03:18,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:18,164 INFO L87 Difference]: Start difference. First operand 854 states and 2924 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:20,175 INFO L93 Difference]: Finished difference Result 1634 states and 6083 transitions. [2025-04-13 18:03:20,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 18:03:20,176 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-13 18:03:20,176 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:20,184 INFO L225 Difference]: With dead ends: 1634 [2025-04-13 18:03:20,184 INFO L226 Difference]: Without dead ends: 1204 [2025-04-13 18:03:20,186 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=525, Invalid=2025, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:03:20,186 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 571 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:20,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 188 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:03:20,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2025-04-13 18:03:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 738. [2025-04-13 18:03:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 3.360922659430122) internal successors, (2477), 737 states have internal predecessors, (2477), 0 states have call successors, (0), 0 states have 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:03:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2477 transitions. [2025-04-13 18:03:20,225 INFO L79 Accepts]: Start accepts. Automaton has 738 states and 2477 transitions. Word has length 42 [2025-04-13 18:03:20,225 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:20,225 INFO L485 AbstractCegarLoop]: Abstraction has 738 states and 2477 transitions. [2025-04-13 18:03:20,226 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:20,226 INFO L278 IsEmpty]: Start isEmpty. Operand 738 states and 2477 transitions. [2025-04-13 18:03:20,229 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:03:20,229 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:20,229 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:20,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:03:20,230 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:20,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:20,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1658326277, now seen corresponding path program 1 times [2025-04-13 18:03:20,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:20,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357095334] [2025-04-13 18:03:20,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:20,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:20,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:03:20,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:03:20,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:20,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:20,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357095334] [2025-04-13 18:03:20,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357095334] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:20,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610222285] [2025-04-13 18:03:20,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:20,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:20,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:20,458 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:03:20,466 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:03:20,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:03:20,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:03:20,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:20,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:20,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:03:20,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:20,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:20,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610222285] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:20,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:20,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-04-13 18:03:20,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762508956] [2025-04-13 18:03:20,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:20,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:03:20,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:20,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:03:20,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:20,882 INFO L87 Difference]: Start difference. First operand 738 states and 2477 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:03:21,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:21,065 INFO L93 Difference]: Finished difference Result 1512 states and 5150 transitions. [2025-04-13 18:03:21,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:03:21,065 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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 45 [2025-04-13 18:03:21,065 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:21,071 INFO L225 Difference]: With dead ends: 1512 [2025-04-13 18:03:21,071 INFO L226 Difference]: Without dead ends: 739 [2025-04-13 18:03:21,073 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:21,074 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:21,074 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 117 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-04-13 18:03:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2025-04-13 18:03:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 3.3577235772357725) internal successors, (2478), 738 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have 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:03:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 2478 transitions. [2025-04-13 18:03:21,096 INFO L79 Accepts]: Start accepts. Automaton has 739 states and 2478 transitions. Word has length 45 [2025-04-13 18:03:21,097 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:21,097 INFO L485 AbstractCegarLoop]: Abstraction has 739 states and 2478 transitions. [2025-04-13 18:03:21,097 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:03:21,097 INFO L278 IsEmpty]: Start isEmpty. Operand 739 states and 2478 transitions. [2025-04-13 18:03:21,099 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-13 18:03:21,099 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:21,099 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:21,108 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:03:21,303 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:21,303 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:21,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:21,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1973841738, now seen corresponding path program 2 times [2025-04-13 18:03:21,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:21,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886307431] [2025-04-13 18:03:21,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:21,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:21,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-13 18:03:21,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 46 statements. [2025-04-13 18:03:21,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:21,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:03:21,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:21,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886307431] [2025-04-13 18:03:21,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886307431] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:21,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:21,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:03:21,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640252534] [2025-04-13 18:03:21,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:21,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:03:21,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:21,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:03:21,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:03:21,528 INFO L87 Difference]: Start difference. First operand 739 states and 2478 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:03:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:21,779 INFO L93 Difference]: Finished difference Result 1013 states and 3457 transitions. [2025-04-13 18:03:21,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:03:21,780 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 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 46 [2025-04-13 18:03:21,780 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:21,788 INFO L225 Difference]: With dead ends: 1013 [2025-04-13 18:03:21,788 INFO L226 Difference]: Without dead ends: 833 [2025-04-13 18:03:21,789 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:03:21,790 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 124 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:21,791 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 94 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-04-13 18:03:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 739. [2025-04-13 18:03:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 3.289972899728997) internal successors, (2428), 738 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have 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:03:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 2428 transitions. [2025-04-13 18:03:21,815 INFO L79 Accepts]: Start accepts. Automaton has 739 states and 2428 transitions. Word has length 46 [2025-04-13 18:03:21,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:21,815 INFO L485 AbstractCegarLoop]: Abstraction has 739 states and 2428 transitions. [2025-04-13 18:03:21,816 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:03:21,816 INFO L278 IsEmpty]: Start isEmpty. Operand 739 states and 2428 transitions. [2025-04-13 18:03:21,818 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:03:21,818 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:21,818 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:21,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:03:21,819 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:21,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1297873156, now seen corresponding path program 1 times [2025-04-13 18:03:21,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:21,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440586122] [2025-04-13 18:03:21,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:21,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:21,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 18:03:21,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:03:21,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:21,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:03:21,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:21,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440586122] [2025-04-13 18:03:21,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440586122] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:21,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047311616] [2025-04-13 18:03:21,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:21,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:21,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:21,962 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:03:21,965 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:03:22,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 18:03:22,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:03:22,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:22,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:22,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:03:22,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:22,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:22,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047311616] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:22,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:22,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2025-04-13 18:03:22,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46778734] [2025-04-13 18:03:22,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:22,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:03:22,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:22,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:03:22,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:03:22,574 INFO L87 Difference]: Start difference. First operand 739 states and 2428 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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:03:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:23,307 INFO L93 Difference]: Finished difference Result 2007 states and 7001 transitions. [2025-04-13 18:03:23,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:03:23,307 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 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 47 [2025-04-13 18:03:23,307 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:23,314 INFO L225 Difference]: With dead ends: 2007 [2025-04-13 18:03:23,314 INFO L226 Difference]: Without dead ends: 928 [2025-04-13 18:03:23,316 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:03:23,316 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 126 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:23,317 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 349 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:03:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-04-13 18:03:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2025-04-13 18:03:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 3.3883495145631066) internal successors, (3141), 927 states have internal predecessors, (3141), 0 states have call successors, (0), 0 states have 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:03:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 3141 transitions. [2025-04-13 18:03:23,353 INFO L79 Accepts]: Start accepts. Automaton has 928 states and 3141 transitions. Word has length 47 [2025-04-13 18:03:23,354 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:23,354 INFO L485 AbstractCegarLoop]: Abstraction has 928 states and 3141 transitions. [2025-04-13 18:03:23,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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:03:23,354 INFO L278 IsEmpty]: Start isEmpty. Operand 928 states and 3141 transitions. [2025-04-13 18:03:23,360 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-13 18:03:23,360 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:23,360 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:23,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 18:03:23,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-13 18:03:23,561 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:23,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:23,561 INFO L85 PathProgramCache]: Analyzing trace with hash 551390004, now seen corresponding path program 1 times [2025-04-13 18:03:23,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:23,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108518370] [2025-04-13 18:03:23,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:23,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:23,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-13 18:03:23,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-13 18:03:23,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:23,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:03:23,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:23,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108518370] [2025-04-13 18:03:23,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108518370] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:23,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250266776] [2025-04-13 18:03:23,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:23,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:23,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:23,824 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:03:23,826 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:03:23,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-13 18:03:23,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-13 18:03:23,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:23,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:23,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:03:23,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:03:24,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:03:24,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250266776] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:24,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:24,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-04-13 18:03:24,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730231597] [2025-04-13 18:03:24,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:24,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:03:24,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:24,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:03:24,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:03:24,302 INFO L87 Difference]: Start difference. First operand 928 states and 3141 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:03:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:24,485 INFO L93 Difference]: Finished difference Result 1216 states and 4171 transitions. [2025-04-13 18:03:24,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:03:24,486 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 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 49 [2025-04-13 18:03:24,486 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:24,495 INFO L225 Difference]: With dead ends: 1216 [2025-04-13 18:03:24,495 INFO L226 Difference]: Without dead ends: 1116 [2025-04-13 18:03:24,496 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:03:24,496 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 114 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:24,497 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 152 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-04-13 18:03:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2025-04-13 18:03:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 3.455605381165919) internal successors, (3853), 1115 states have internal predecessors, (3853), 0 states have call successors, (0), 0 states have 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:03:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 3853 transitions. [2025-04-13 18:03:24,531 INFO L79 Accepts]: Start accepts. Automaton has 1116 states and 3853 transitions. Word has length 49 [2025-04-13 18:03:24,531 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:24,531 INFO L485 AbstractCegarLoop]: Abstraction has 1116 states and 3853 transitions. [2025-04-13 18:03:24,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:03:24,532 INFO L278 IsEmpty]: Start isEmpty. Operand 1116 states and 3853 transitions. [2025-04-13 18:03:24,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 18:03:24,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:24,535 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:24,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 18:03:24,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:24,739 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:24,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:24,739 INFO L85 PathProgramCache]: Analyzing trace with hash 118276179, now seen corresponding path program 2 times [2025-04-13 18:03:24,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:24,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183079469] [2025-04-13 18:03:24,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:24,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:24,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-04-13 18:03:24,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:03:24,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:24,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:03:25,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:25,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183079469] [2025-04-13 18:03:25,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183079469] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:25,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444605678] [2025-04-13 18:03:25,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:25,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:25,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:25,355 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:03:25,363 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:03:25,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-04-13 18:03:25,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:03:25,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:25,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:25,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:03:25,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:26,048 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:03:26,049 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 37 [2025-04-13 18:03:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 18:03:26,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:03:26,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444605678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:26,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:03:26,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 19 [2025-04-13 18:03:26,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479196644] [2025-04-13 18:03:26,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:26,236 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:26,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:26,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:26,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:03:26,237 INFO L87 Difference]: Start difference. First operand 1116 states and 3853 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:03:27,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:27,532 INFO L93 Difference]: Finished difference Result 2825 states and 10207 transitions. [2025-04-13 18:03:27,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:03:27,533 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 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 50 [2025-04-13 18:03:27,533 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:27,550 INFO L225 Difference]: With dead ends: 2825 [2025-04-13 18:03:27,550 INFO L226 Difference]: Without dead ends: 2324 [2025-04-13 18:03:27,553 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=1173, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:03:27,554 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 282 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:27,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 155 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:03:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2025-04-13 18:03:27,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 1582. [2025-04-13 18:03:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 3.478810879190386) internal successors, (5500), 1581 states have internal predecessors, (5500), 0 states have call successors, (0), 0 states have 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:03:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 5500 transitions. [2025-04-13 18:03:27,621 INFO L79 Accepts]: Start accepts. Automaton has 1582 states and 5500 transitions. Word has length 50 [2025-04-13 18:03:27,622 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:27,622 INFO L485 AbstractCegarLoop]: Abstraction has 1582 states and 5500 transitions. [2025-04-13 18:03:27,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:03:27,622 INFO L278 IsEmpty]: Start isEmpty. Operand 1582 states and 5500 transitions. [2025-04-13 18:03:27,627 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 18:03:27,627 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:27,627 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:27,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 18:03:27,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:27,831 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:27,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:27,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2056080815, now seen corresponding path program 3 times [2025-04-13 18:03:27,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:27,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543329903] [2025-04-13 18:03:27,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:27,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:27,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 3 equivalence classes. [2025-04-13 18:03:27,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 47 of 50 statements. [2025-04-13 18:03:27,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:03:27,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:03:28,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:28,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543329903] [2025-04-13 18:03:28,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543329903] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:28,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027380016] [2025-04-13 18:03:28,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:28,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:28,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:28,368 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:03:28,374 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:03:28,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 3 equivalence classes. [2025-04-13 18:03:28,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 47 of 50 statements. [2025-04-13 18:03:28,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:03:28,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:28,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 18:03:28,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:28,726 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:03:28,726 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2025-04-13 18:03:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 18:03:28,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 18:03:29,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027380016] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:29,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:29,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 23 [2025-04-13 18:03:29,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275898783] [2025-04-13 18:03:29,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:29,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 18:03:29,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:29,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 18:03:29,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:03:29,295 INFO L87 Difference]: Start difference. First operand 1582 states and 5500 transitions. Second operand has 24 states, 23 states have (on average 4.217391304347826) internal successors, (97), 24 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:03:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:33,166 INFO L93 Difference]: Finished difference Result 5592 states and 22461 transitions. [2025-04-13 18:03:33,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 18:03:33,166 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.217391304347826) internal successors, (97), 24 states have internal predecessors, (97), 0 states have call successors, (0), 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 50 [2025-04-13 18:03:33,166 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:33,226 INFO L225 Difference]: With dead ends: 5592 [2025-04-13 18:03:33,226 INFO L226 Difference]: Without dead ends: 5458 [2025-04-13 18:03:33,230 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1804 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1055, Invalid=5107, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 18:03:33,230 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 706 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:33,230 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 382 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:03:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5458 states. [2025-04-13 18:03:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5458 to 2190. [2025-04-13 18:03:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2190 states, 2189 states have (on average 3.8318867062585658) internal successors, (8388), 2189 states have internal predecessors, (8388), 0 states have call successors, (0), 0 states have 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:03:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 8388 transitions. [2025-04-13 18:03:33,349 INFO L79 Accepts]: Start accepts. Automaton has 2190 states and 8388 transitions. Word has length 50 [2025-04-13 18:03:33,349 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:33,349 INFO L485 AbstractCegarLoop]: Abstraction has 2190 states and 8388 transitions. [2025-04-13 18:03:33,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.217391304347826) internal successors, (97), 24 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:03:33,350 INFO L278 IsEmpty]: Start isEmpty. Operand 2190 states and 8388 transitions. [2025-04-13 18:03:33,357 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 18:03:33,357 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:33,357 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:33,365 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:03:33,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 18:03:33,558 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:33,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:33,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1350442823, now seen corresponding path program 4 times [2025-04-13 18:03:33,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:33,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797686544] [2025-04-13 18:03:33,560 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:33,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:33,578 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-13 18:03:33,596 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:03:33,596 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:33,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:03:34,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:34,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797686544] [2025-04-13 18:03:34,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797686544] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:34,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213482841] [2025-04-13 18:03:34,079 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:34,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:34,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:34,086 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:03:34,092 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:03:34,208 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-13 18:03:34,238 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:03:34,238 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:34,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:34,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 18:03:34,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:38,857 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:03:38,858 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2025-04-13 18:03:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:03:38,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:39,441 INFO L325 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size [2025-04-13 18:03:39,442 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 25 [2025-04-13 18:03:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:03:39,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213482841] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:39,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:39,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 29 [2025-04-13 18:03:39,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170978529] [2025-04-13 18:03:39,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:39,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 18:03:39,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:39,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 18:03:39,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=766, Unknown=1, NotChecked=0, Total=870 [2025-04-13 18:03:39,513 INFO L87 Difference]: Start difference. First operand 2190 states and 8388 transitions. Second operand has 30 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 30 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:03:45,152 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 [0] [2025-04-13 18:03:49,582 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 [0] [2025-04-13 18:04:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:05,731 INFO L93 Difference]: Finished difference Result 8077 states and 32796 transitions. [2025-04-13 18:04:05,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-04-13 18:04:05,735 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 30 states have internal predecessors, (105), 0 states have call successors, (0), 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 50 [2025-04-13 18:04:05,736 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:05,766 INFO L225 Difference]: With dead ends: 8077 [2025-04-13 18:04:05,766 INFO L226 Difference]: Without dead ends: 7507 [2025-04-13 18:04:05,771 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5003 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=2707, Invalid=13292, Unknown=3, NotChecked=0, Total=16002 [2025-04-13 18:04:05,772 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 1056 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 3560 mSolverCounterSat, 80 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 3642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3560 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:05,772 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 921 Invalid, 3642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3560 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2025-04-13 18:04:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7507 states. [2025-04-13 18:04:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7507 to 3204. [2025-04-13 18:04:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3204 states, 3203 states have (on average 3.9865750858570093) internal successors, (12769), 3203 states have internal predecessors, (12769), 0 states have call successors, (0), 0 states have 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:04:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 12769 transitions. [2025-04-13 18:04:05,895 INFO L79 Accepts]: Start accepts. Automaton has 3204 states and 12769 transitions. Word has length 50 [2025-04-13 18:04:05,895 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:05,896 INFO L485 AbstractCegarLoop]: Abstraction has 3204 states and 12769 transitions. [2025-04-13 18:04:05,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 30 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:04:05,896 INFO L278 IsEmpty]: Start isEmpty. Operand 3204 states and 12769 transitions. [2025-04-13 18:04:05,903 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 18:04:05,903 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:05,904 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:05,910 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:04:06,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:06,108 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:06,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:06,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1732674179, now seen corresponding path program 5 times [2025-04-13 18:04:06,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:06,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895309246] [2025-04-13 18:04:06,109 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:06,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:06,123 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 3 equivalence classes. [2025-04-13 18:04:06,134 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:04:06,135 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:04:06,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:04:06,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:06,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895309246] [2025-04-13 18:04:06,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895309246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:06,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:06,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:04:06,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241235990] [2025-04-13 18:04:06,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:06,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:04:06,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:06,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:04:06,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:04:06,456 INFO L87 Difference]: Start difference. First operand 3204 states and 12769 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:04:08,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:08,054 INFO L93 Difference]: Finished difference Result 6065 states and 24628 transitions. [2025-04-13 18:04:08,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 18:04:08,054 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 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 50 [2025-04-13 18:04:08,054 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:08,083 INFO L225 Difference]: With dead ends: 6065 [2025-04-13 18:04:08,083 INFO L226 Difference]: Without dead ends: 5768 [2025-04-13 18:04:08,088 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=840, Invalid=3716, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 18:04:08,088 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 626 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:08,089 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 240 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:04:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5768 states. [2025-04-13 18:04:08,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5768 to 3754. [2025-04-13 18:04:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3754 states, 3753 states have (on average 4.042366107114309) internal successors, (15171), 3753 states have internal predecessors, (15171), 0 states have call successors, (0), 0 states have 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:04:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 15171 transitions. [2025-04-13 18:04:08,250 INFO L79 Accepts]: Start accepts. Automaton has 3754 states and 15171 transitions. Word has length 50 [2025-04-13 18:04:08,250 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:08,250 INFO L485 AbstractCegarLoop]: Abstraction has 3754 states and 15171 transitions. [2025-04-13 18:04:08,250 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:04:08,250 INFO L278 IsEmpty]: Start isEmpty. Operand 3754 states and 15171 transitions. [2025-04-13 18:04:08,262 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 18:04:08,262 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:08,262 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:08,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 18:04:08,263 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:08,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:08,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1854549727, now seen corresponding path program 6 times [2025-04-13 18:04:08,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:08,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111543236] [2025-04-13 18:04:08,264 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:04:08,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:08,272 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 3 equivalence classes. [2025-04-13 18:04:08,288 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:04:08,288 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:04:08,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:04:08,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:08,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111543236] [2025-04-13 18:04:08,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111543236] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:08,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219823653] [2025-04-13 18:04:08,730 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:04:08,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:08,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:08,732 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:04:08,732 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:04:08,783 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 3 equivalence classes. [2025-04-13 18:04:08,807 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:04:08,807 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:04:08,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:08,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:04:08,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:09,043 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:09,044 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 37 [2025-04-13 18:04:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 18:04:09,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:04:09,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219823653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:09,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:04:09,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 27 [2025-04-13 18:04:09,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215582700] [2025-04-13 18:04:09,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:09,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:09,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:09,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:09,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:04:09,153 INFO L87 Difference]: Start difference. First operand 3754 states and 15171 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:04:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:10,435 INFO L93 Difference]: Finished difference Result 7640 states and 32185 transitions. [2025-04-13 18:04:10,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:04:10,435 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 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 50 [2025-04-13 18:04:10,435 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:10,469 INFO L225 Difference]: With dead ends: 7640 [2025-04-13 18:04:10,469 INFO L226 Difference]: Without dead ends: 6962 [2025-04-13 18:04:10,476 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=282, Invalid=1974, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 18:04:10,477 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 289 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:10,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 230 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:04:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6962 states. [2025-04-13 18:04:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6962 to 4166. [2025-04-13 18:04:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4166 states, 4165 states have (on average 4.031452581032413) internal successors, (16791), 4165 states have internal predecessors, (16791), 0 states have call successors, (0), 0 states have 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:04:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 16791 transitions. [2025-04-13 18:04:10,650 INFO L79 Accepts]: Start accepts. Automaton has 4166 states and 16791 transitions. Word has length 50 [2025-04-13 18:04:10,650 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:10,650 INFO L485 AbstractCegarLoop]: Abstraction has 4166 states and 16791 transitions. [2025-04-13 18:04:10,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:04:10,651 INFO L278 IsEmpty]: Start isEmpty. Operand 4166 states and 16791 transitions. [2025-04-13 18:04:10,663 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 18:04:10,663 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:10,663 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:10,672 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:04:10,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:10,865 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:10,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:10,865 INFO L85 PathProgramCache]: Analyzing trace with hash 397404407, now seen corresponding path program 7 times [2025-04-13 18:04:10,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:10,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365608323] [2025-04-13 18:04:10,865 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:10,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:10,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-13 18:04:10,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:04:10,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:10,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:04:11,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:11,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365608323] [2025-04-13 18:04:11,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365608323] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:11,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800528779] [2025-04-13 18:04:11,311 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:11,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:11,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:11,313 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:04:11,316 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:04:11,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-13 18:04:11,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:04:11,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:11,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:11,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 18:04:11,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:11,712 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:11,712 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2025-04-13 18:04:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:04:11,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:12,239 INFO L325 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2025-04-13 18:04:12,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 27 [2025-04-13 18:04:12,282 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:04:12,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800528779] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:04:12,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:04:12,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2025-04-13 18:04:12,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752723219] [2025-04-13 18:04:12,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:04:12,282 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 18:04:12,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:12,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 18:04:12,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:04:12,283 INFO L87 Difference]: Start difference. First operand 4166 states and 16791 transitions. Second operand has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 28 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:04:17,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:17,763 INFO L93 Difference]: Finished difference Result 9545 states and 40935 transitions. [2025-04-13 18:04:17,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 18:04:17,764 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 28 states have internal predecessors, (96), 0 states have call successors, (0), 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 50 [2025-04-13 18:04:17,764 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:17,777 INFO L225 Difference]: With dead ends: 9545 [2025-04-13 18:04:17,777 INFO L226 Difference]: Without dead ends: 2170 [2025-04-13 18:04:17,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4539 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2149, Invalid=12613, Unknown=0, NotChecked=0, Total=14762 [2025-04-13 18:04:17,793 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 1052 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 3761 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 3905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 3761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:17,793 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 625 Invalid, 3905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 3761 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 18:04:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2025-04-13 18:04:17,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2130. [2025-04-13 18:04:17,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 2129 states have (on average 4.160169093471113) internal successors, (8857), 2129 states have internal predecessors, (8857), 0 states have call successors, (0), 0 states have 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:04:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 8857 transitions. [2025-04-13 18:04:17,853 INFO L79 Accepts]: Start accepts. Automaton has 2130 states and 8857 transitions. Word has length 50 [2025-04-13 18:04:17,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:17,854 INFO L485 AbstractCegarLoop]: Abstraction has 2130 states and 8857 transitions. [2025-04-13 18:04:17,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 28 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:04:17,854 INFO L278 IsEmpty]: Start isEmpty. Operand 2130 states and 8857 transitions. [2025-04-13 18:04:17,861 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 18:04:17,861 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:17,861 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:17,870 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:04:18,062 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,SelfDestructingSolverStorable15 [2025-04-13 18:04:18,062 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:18,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:18,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2077797653, now seen corresponding path program 8 times [2025-04-13 18:04:18,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:18,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504966630] [2025-04-13 18:04:18,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:04:18,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:18,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-04-13 18:04:18,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:04:18,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:18,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 18:04:18,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:18,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504966630] [2025-04-13 18:04:18,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504966630] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:18,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:18,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:04:18,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397470009] [2025-04-13 18:04:18,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:18,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:04:18,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:18,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:04:18,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:04:18,523 INFO L87 Difference]: Start difference. First operand 2130 states and 8857 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 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:04:19,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:19,284 INFO L93 Difference]: Finished difference Result 2380 states and 9768 transitions. [2025-04-13 18:04:19,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:04:19,284 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 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 50 [2025-04-13 18:04:19,284 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:19,305 INFO L225 Difference]: With dead ends: 2380 [2025-04-13 18:04:19,305 INFO L226 Difference]: Without dead ends: 2248 [2025-04-13 18:04:19,307 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:04:19,309 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 109 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:19,309 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 179 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:04:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2025-04-13 18:04:19,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2226. [2025-04-13 18:04:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2226 states, 2225 states have (on average 4.139775280898877) internal successors, (9211), 2225 states have internal predecessors, (9211), 0 states have call successors, (0), 0 states have 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:04:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 9211 transitions. [2025-04-13 18:04:19,367 INFO L79 Accepts]: Start accepts. Automaton has 2226 states and 9211 transitions. Word has length 50 [2025-04-13 18:04:19,368 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:19,368 INFO L485 AbstractCegarLoop]: Abstraction has 2226 states and 9211 transitions. [2025-04-13 18:04:19,368 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 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:04:19,368 INFO L278 IsEmpty]: Start isEmpty. Operand 2226 states and 9211 transitions. [2025-04-13 18:04:19,373 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 18:04:19,373 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:19,373 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:19,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:04:19,373 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:19,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:19,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2028421317, now seen corresponding path program 9 times [2025-04-13 18:04:19,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:19,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344303629] [2025-04-13 18:04:19,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:04:19,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:19,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 3 equivalence classes. [2025-04-13 18:04:19,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 49 of 50 statements. [2025-04-13 18:04:19,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:04:19,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:19,617 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 18:04:19,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:19,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344303629] [2025-04-13 18:04:19,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344303629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:19,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:19,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:19,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285681082] [2025-04-13 18:04:19,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:19,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:19,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:19,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:19,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:19,618 INFO L87 Difference]: Start difference. First operand 2226 states and 9211 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 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:04:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:20,443 INFO L93 Difference]: Finished difference Result 2908 states and 11670 transitions. [2025-04-13 18:04:20,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:04:20,444 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 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 50 [2025-04-13 18:04:20,444 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:20,469 INFO L225 Difference]: With dead ends: 2908 [2025-04-13 18:04:20,469 INFO L226 Difference]: Without dead ends: 2752 [2025-04-13 18:04:20,471 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:04:20,474 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 189 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:20,474 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 187 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:04:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2025-04-13 18:04:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2142. [2025-04-13 18:04:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 2141 states have (on average 4.14992993928071) internal successors, (8885), 2141 states have internal predecessors, (8885), 0 states have call successors, (0), 0 states have 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:04:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 8885 transitions. [2025-04-13 18:04:20,560 INFO L79 Accepts]: Start accepts. Automaton has 2142 states and 8885 transitions. Word has length 50 [2025-04-13 18:04:20,560 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:20,560 INFO L485 AbstractCegarLoop]: Abstraction has 2142 states and 8885 transitions. [2025-04-13 18:04:20,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 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:04:20,560 INFO L278 IsEmpty]: Start isEmpty. Operand 2142 states and 8885 transitions. [2025-04-13 18:04:20,578 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 18:04:20,578 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:20,578 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:20,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 18:04:20,584 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:20,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:20,586 INFO L85 PathProgramCache]: Analyzing trace with hash 522217865, now seen corresponding path program 10 times [2025-04-13 18:04:20,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:20,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044364802] [2025-04-13 18:04:20,586 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:04:20,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:20,612 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-13 18:04:20,620 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:04:20,621 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:04:20,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:04:21,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:21,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044364802] [2025-04-13 18:04:21,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044364802] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:21,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609011854] [2025-04-13 18:04:21,187 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:04:21,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:21,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:21,200 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:04:21,209 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:04:21,267 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-13 18:04:21,292 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:04:21,293 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:04:21,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:21,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:04:21,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:21,741 INFO L325 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-04-13 18:04:21,741 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 31 [2025-04-13 18:04:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:04:21,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:04:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609011854] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:04:22,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:04:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 44 [2025-04-13 18:04:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690949250] [2025-04-13 18:04:22,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:04:22,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 18:04:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:22,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 18:04:22,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1794, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 18:04:22,369 INFO L87 Difference]: Start difference. First operand 2142 states and 8885 transitions. Second operand has 45 states, 44 states have (on average 2.477272727272727) internal successors, (109), 45 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have 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:04:26,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:26,607 INFO L93 Difference]: Finished difference Result 2763 states and 10656 transitions. [2025-04-13 18:04:26,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-04-13 18:04:26,607 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.477272727272727) internal successors, (109), 45 states have internal predecessors, (109), 0 states have call successors, (0), 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 50 [2025-04-13 18:04:26,607 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:26,615 INFO L225 Difference]: With dead ends: 2763 [2025-04-13 18:04:26,615 INFO L226 Difference]: Without dead ends: 2726 [2025-04-13 18:04:26,617 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3778 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1360, Invalid=12446, Unknown=0, NotChecked=0, Total=13806 [2025-04-13 18:04:26,617 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 763 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 3782 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 3862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:26,618 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 764 Invalid, 3862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3782 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 18:04:26,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2025-04-13 18:04:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2362. [2025-04-13 18:04:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 4.005082592121982) internal successors, (9456), 2361 states have internal predecessors, (9456), 0 states have call successors, (0), 0 states have 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:04:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 9456 transitions. [2025-04-13 18:04:26,658 INFO L79 Accepts]: Start accepts. Automaton has 2362 states and 9456 transitions. Word has length 50 [2025-04-13 18:04:26,658 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:26,658 INFO L485 AbstractCegarLoop]: Abstraction has 2362 states and 9456 transitions. [2025-04-13 18:04:26,658 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.477272727272727) internal successors, (109), 45 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have 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:04:26,658 INFO L278 IsEmpty]: Start isEmpty. Operand 2362 states and 9456 transitions. [2025-04-13 18:04:26,662 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-13 18:04:26,662 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:26,663 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:26,671 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:04:26,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:26,863 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:26,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:26,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1339429867, now seen corresponding path program 1 times [2025-04-13 18:04:26,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:26,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001907237] [2025-04-13 18:04:26,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:04:26,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:26,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-13 18:04:26,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 18:04:26,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:26,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:26,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:26,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001907237] [2025-04-13 18:04:26,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001907237] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:26,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028981451] [2025-04-13 18:04:26,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:04:26,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:26,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:26,970 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:04:26,972 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:04:27,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-13 18:04:27,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 18:04:27,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:27,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:27,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:04:27,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:27,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028981451] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:04:27,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:04:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2025-04-13 18:04:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959096547] [2025-04-13 18:04:27,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:04:27,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 18:04:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:27,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 18:04:27,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:04:27,280 INFO L87 Difference]: Start difference. First operand 2362 states and 9456 transitions. Second operand has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:04:27,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:27,421 INFO L93 Difference]: Finished difference Result 5372 states and 21375 transitions. [2025-04-13 18:04:27,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:04:27,421 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 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 51 [2025-04-13 18:04:27,421 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:27,431 INFO L225 Difference]: With dead ends: 5372 [2025-04-13 18:04:27,431 INFO L226 Difference]: Without dead ends: 2962 [2025-04-13 18:04:27,434 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:04:27,434 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 149 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:27,434 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 160 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:04:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2025-04-13 18:04:27,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 2660. [2025-04-13 18:04:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2660 states, 2659 states have (on average 3.8537044001504324) internal successors, (10247), 2659 states have internal predecessors, (10247), 0 states have call successors, (0), 0 states have 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:04:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 10247 transitions. [2025-04-13 18:04:27,493 INFO L79 Accepts]: Start accepts. Automaton has 2660 states and 10247 transitions. Word has length 51 [2025-04-13 18:04:27,493 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:27,493 INFO L485 AbstractCegarLoop]: Abstraction has 2660 states and 10247 transitions. [2025-04-13 18:04:27,493 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:04:27,493 INFO L278 IsEmpty]: Start isEmpty. Operand 2660 states and 10247 transitions. [2025-04-13 18:04:27,497 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-13 18:04:27,497 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:27,498 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:27,504 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:04:27,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:27,698 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:27,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:27,699 INFO L85 PathProgramCache]: Analyzing trace with hash -64086451, now seen corresponding path program 1 times [2025-04-13 18:04:27,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:27,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152784999] [2025-04-13 18:04:27,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:04:27,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:27,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-13 18:04:27,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 18:04:27,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:27,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:04:28,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:28,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152784999] [2025-04-13 18:04:28,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152784999] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:28,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509474355] [2025-04-13 18:04:28,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:04:28,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:28,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:28,006 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:04:28,008 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:04:28,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-13 18:04:28,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 18:04:28,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:28,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:28,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 18:04:28,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:04:28,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:28,332 INFO L325 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2025-04-13 18:04:28,333 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 30 [2025-04-13 18:04:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:04:28,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509474355] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:04:28,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:04:28,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 24 [2025-04-13 18:04:28,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33608963] [2025-04-13 18:04:28,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:04:28,354 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 18:04:28,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:28,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 18:04:28,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:04:28,355 INFO L87 Difference]: Start difference. First operand 2660 states and 10247 transitions. Second operand has 24 states, 24 states have (on average 3.625) internal successors, (87), 24 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:04:34,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:34,205 INFO L93 Difference]: Finished difference Result 11624 states and 47836 transitions. [2025-04-13 18:04:34,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-04-13 18:04:34,205 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 24 states have internal predecessors, (87), 0 states have call successors, (0), 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 51 [2025-04-13 18:04:34,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:34,247 INFO L225 Difference]: With dead ends: 11624 [2025-04-13 18:04:34,247 INFO L226 Difference]: Without dead ends: 10416 [2025-04-13 18:04:34,255 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6439 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2282, Invalid=16350, Unknown=0, NotChecked=0, Total=18632 [2025-04-13 18:04:34,255 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 883 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 4599 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 4664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:34,255 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 809 Invalid, 4664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4599 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-04-13 18:04:34,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10416 states. [2025-04-13 18:04:34,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10416 to 4664. [2025-04-13 18:04:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4664 states, 4663 states have (on average 3.911001501179498) internal successors, (18237), 4663 states have internal predecessors, (18237), 0 states have call successors, (0), 0 states have 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:04:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 18237 transitions. [2025-04-13 18:04:34,472 INFO L79 Accepts]: Start accepts. Automaton has 4664 states and 18237 transitions. Word has length 51 [2025-04-13 18:04:34,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:34,473 INFO L485 AbstractCegarLoop]: Abstraction has 4664 states and 18237 transitions. [2025-04-13 18:04:34,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 24 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:04:34,473 INFO L278 IsEmpty]: Start isEmpty. Operand 4664 states and 18237 transitions. [2025-04-13 18:04:34,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-13 18:04:34,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:34,485 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:34,494 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:04:34,687 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,SelfDestructingSolverStorable20 [2025-04-13 18:04:34,688 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:34,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:34,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2138930293, now seen corresponding path program 2 times [2025-04-13 18:04:34,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:34,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916803763] [2025-04-13 18:04:34,689 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:04:34,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:34,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-04-13 18:04:34,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 18:04:34,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:34,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 18:04:35,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:35,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916803763] [2025-04-13 18:04:35,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916803763] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:35,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940475798] [2025-04-13 18:04:35,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:04:35,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:35,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:35,390 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:04:35,391 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:04:35,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-04-13 18:04:35,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 18:04:35,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:35,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:35,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 18:04:35,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:35,979 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:35,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 37 [2025-04-13 18:04:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 18:04:36,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:04:37,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940475798] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:37,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:04:37,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14, 11] total 32 [2025-04-13 18:04:37,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541907296] [2025-04-13 18:04:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:37,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:04:37,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:37,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:04:37,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:04:37,324 INFO L87 Difference]: Start difference. First operand 4664 states and 18237 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:04:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:40,118 INFO L93 Difference]: Finished difference Result 10346 states and 42591 transitions. [2025-04-13 18:04:40,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:04:40,119 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 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 51 [2025-04-13 18:04:40,119 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:40,169 INFO L225 Difference]: With dead ends: 10346 [2025-04-13 18:04:40,169 INFO L226 Difference]: Without dead ends: 9900 [2025-04-13 18:04:40,178 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 80 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=354, Invalid=2402, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 18:04:40,181 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 303 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:40,181 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 176 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:04:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9900 states. [2025-04-13 18:04:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9900 to 5550. [2025-04-13 18:04:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5550 states, 5549 states have (on average 3.9064696341683187) internal successors, (21677), 5549 states have internal predecessors, (21677), 0 states have call successors, (0), 0 states have 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:04:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5550 states to 5550 states and 21677 transitions. [2025-04-13 18:04:40,389 INFO L79 Accepts]: Start accepts. Automaton has 5550 states and 21677 transitions. Word has length 51 [2025-04-13 18:04:40,389 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:40,389 INFO L485 AbstractCegarLoop]: Abstraction has 5550 states and 21677 transitions. [2025-04-13 18:04:40,389 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:04:40,389 INFO L278 IsEmpty]: Start isEmpty. Operand 5550 states and 21677 transitions. [2025-04-13 18:04:40,402 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-13 18:04:40,402 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:40,402 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:40,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 18:04:40,602 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,SelfDestructingSolverStorable21 [2025-04-13 18:04:40,604 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:40,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:40,604 INFO L85 PathProgramCache]: Analyzing trace with hash 963670447, now seen corresponding path program 3 times [2025-04-13 18:04:40,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:40,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75273810] [2025-04-13 18:04:40,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:04:40,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:40,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 3 equivalence classes. [2025-04-13 18:04:40,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 51 statements. [2025-04-13 18:04:40,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:04:40,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:04:41,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:41,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75273810] [2025-04-13 18:04:41,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75273810] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:41,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119324406] [2025-04-13 18:04:41,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:04:41,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:41,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:41,222 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:04:41,224 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:04:41,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 3 equivalence classes. [2025-04-13 18:04:41,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 51 statements. [2025-04-13 18:04:41,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:04:41,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:41,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 18:04:41,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:41,720 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:41,720 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2025-04-13 18:04:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 18:04:41,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:04:42,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119324406] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:42,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:04:42,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13, 11] total 30 [2025-04-13 18:04:42,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899649994] [2025-04-13 18:04:42,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:42,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:04:42,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:42,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:04:42,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:04:42,586 INFO L87 Difference]: Start difference. First operand 5550 states and 21677 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:04:53,523 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:04:58,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:58,218 INFO L93 Difference]: Finished difference Result 11850 states and 46826 transitions. [2025-04-13 18:04:58,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:04:58,218 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 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 51 [2025-04-13 18:04:58,218 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:58,275 INFO L225 Difference]: With dead ends: 11850 [2025-04-13 18:04:58,275 INFO L226 Difference]: Without dead ends: 11494 [2025-04-13 18:04:58,284 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 81 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=375, Invalid=2703, Unknown=2, NotChecked=0, Total=3080 [2025-04-13 18:04:58,284 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 305 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:58,284 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 210 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-04-13 18:04:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11494 states. [2025-04-13 18:04:58,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11494 to 6258. [2025-04-13 18:04:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6258 states, 6257 states have (on average 4.004315167012946) internal successors, (25055), 6257 states have internal predecessors, (25055), 0 states have call successors, (0), 0 states have 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:04:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6258 states to 6258 states and 25055 transitions. [2025-04-13 18:04:58,542 INFO L79 Accepts]: Start accepts. Automaton has 6258 states and 25055 transitions. Word has length 51 [2025-04-13 18:04:58,542 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:58,543 INFO L485 AbstractCegarLoop]: Abstraction has 6258 states and 25055 transitions. [2025-04-13 18:04:58,543 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:04:58,543 INFO L278 IsEmpty]: Start isEmpty. Operand 6258 states and 25055 transitions. [2025-04-13 18:04:58,566 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-13 18:04:58,566 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:58,567 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:58,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 18:04:58,771 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,SelfDestructingSolverStorable22 [2025-04-13 18:04:58,771 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:58,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1909838815, now seen corresponding path program 4 times [2025-04-13 18:04:58,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:58,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897252195] [2025-04-13 18:04:58,772 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:04:58,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:58,778 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-04-13 18:04:58,782 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 51 statements. [2025-04-13 18:04:58,786 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:04:58,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:04:58,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:58,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897252195] [2025-04-13 18:04:58,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897252195] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:58,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270608860] [2025-04-13 18:04:58,956 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:04:58,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:58,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:58,967 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:04:58,969 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:04:59,032 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-04-13 18:04:59,048 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 51 statements. [2025-04-13 18:04:59,048 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:04:59,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:59,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 18:04:59,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:04:59,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:59,371 INFO L325 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2025-04-13 18:04:59,372 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 30 [2025-04-13 18:04:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:04:59,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270608860] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:04:59,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:04:59,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-04-13 18:04:59,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459507868] [2025-04-13 18:04:59,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:04:59,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:04:59,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:59,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:04:59,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:04:59,394 INFO L87 Difference]: Start difference. First operand 6258 states and 25055 transitions. Second operand has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:05:03,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:03,349 INFO L93 Difference]: Finished difference Result 12740 states and 54127 transitions. [2025-04-13 18:05:03,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-04-13 18:05:03,351 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 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 51 [2025-04-13 18:05:03,351 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:03,409 INFO L225 Difference]: With dead ends: 12740 [2025-04-13 18:05:03,409 INFO L226 Difference]: Without dead ends: 11974 [2025-04-13 18:05:03,418 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2456 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1079, Invalid=6577, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 18:05:03,419 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 593 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:03,420 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 491 Invalid, 2468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2428 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 18:05:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11974 states. [2025-04-13 18:05:03,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11974 to 7102. [2025-04-13 18:05:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7102 states, 7101 states have (on average 4.0685818898746655) internal successors, (28891), 7101 states have internal predecessors, (28891), 0 states have call successors, (0), 0 states have 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:05:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7102 states to 7102 states and 28891 transitions. [2025-04-13 18:05:03,672 INFO L79 Accepts]: Start accepts. Automaton has 7102 states and 28891 transitions. Word has length 51 [2025-04-13 18:05:03,672 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:03,673 INFO L485 AbstractCegarLoop]: Abstraction has 7102 states and 28891 transitions. [2025-04-13 18:05:03,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:05:03,673 INFO L278 IsEmpty]: Start isEmpty. Operand 7102 states and 28891 transitions. [2025-04-13 18:05:03,692 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-13 18:05:03,692 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:03,695 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:03,719 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:05:03,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:03,896 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:05:03,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:03,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1327178899, now seen corresponding path program 5 times [2025-04-13 18:05:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:03,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272744710] [2025-04-13 18:05:03,897 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:03,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:03,906 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 3 equivalence classes. [2025-04-13 18:05:03,917 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 18:05:03,917 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:05:03,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:05:04,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:04,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272744710] [2025-04-13 18:05:04,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272744710] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:04,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780952339] [2025-04-13 18:05:04,593 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:04,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:04,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:04,595 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:05:04,597 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:05:04,688 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 3 equivalence classes. [2025-04-13 18:05:04,893 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 18:05:04,894 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:05:04,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:04,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 18:05:04,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:05,091 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 21 treesize of output 9 [2025-04-13 18:05:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:05:05,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:05,296 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 18:05:05,297 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2025-04-13 18:05:05,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:05:05,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780952339] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:05:05,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:05:05,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 29 [2025-04-13 18:05:05,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757326663] [2025-04-13 18:05:05,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:05:05,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 18:05:05,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:05,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 18:05:05,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:05:05,341 INFO L87 Difference]: Start difference. First operand 7102 states and 28891 transitions. Second operand has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:05:13,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:13,299 INFO L93 Difference]: Finished difference Result 16092 states and 68094 transitions. [2025-04-13 18:05:13,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2025-04-13 18:05:13,299 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 0 states have call successors, (0), 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 51 [2025-04-13 18:05:13,299 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:13,382 INFO L225 Difference]: With dead ends: 16092 [2025-04-13 18:05:13,382 INFO L226 Difference]: Without dead ends: 14498 [2025-04-13 18:05:13,396 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8401 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2713, Invalid=22409, Unknown=0, NotChecked=0, Total=25122 [2025-04-13 18:05:13,400 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 1016 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 6548 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 6653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 6548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:13,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 831 Invalid, 6653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 6548 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-04-13 18:05:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2025-04-13 18:05:13,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 8138. [2025-04-13 18:05:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8138 states, 8137 states have (on average 4.0861496866166895) internal successors, (33249), 8137 states have internal predecessors, (33249), 0 states have call successors, (0), 0 states have 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:05:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8138 states to 8138 states and 33249 transitions. [2025-04-13 18:05:13,764 INFO L79 Accepts]: Start accepts. Automaton has 8138 states and 33249 transitions. Word has length 51 [2025-04-13 18:05:13,764 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:13,764 INFO L485 AbstractCegarLoop]: Abstraction has 8138 states and 33249 transitions. [2025-04-13 18:05:13,764 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:05:13,765 INFO L278 IsEmpty]: Start isEmpty. Operand 8138 states and 33249 transitions. [2025-04-13 18:05:13,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-13 18:05:13,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:13,785 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:13,794 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:05:13,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:13,986 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:05:13,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:13,987 INFO L85 PathProgramCache]: Analyzing trace with hash 542191015, now seen corresponding path program 6 times [2025-04-13 18:05:13,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:13,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142605425] [2025-04-13 18:05:13,987 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:05:13,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:13,996 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 3 equivalence classes. [2025-04-13 18:05:14,014 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 18:05:14,014 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:05:14,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:14,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:14,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142605425] [2025-04-13 18:05:14,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142605425] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:14,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282125535] [2025-04-13 18:05:14,324 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:05:14,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:14,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:14,326 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:05:14,334 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:05:14,480 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 3 equivalence classes. [2025-04-13 18:05:14,506 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 18:05:14,506 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:05:14,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:14,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 18:05:14,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:14,934 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:14,934 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2025-04-13 18:05:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 18:05:15,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 18:05:15,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282125535] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:15,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:05:15,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 9] total 26 [2025-04-13 18:05:15,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284012582] [2025-04-13 18:05:15,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:15,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:05:15,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:15,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:05:15,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:05:15,516 INFO L87 Difference]: Start difference. First operand 8138 states and 33249 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:05:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:16,490 INFO L93 Difference]: Finished difference Result 11507 states and 45751 transitions. [2025-04-13 18:05:16,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:05:16,490 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 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 51 [2025-04-13 18:05:16,491 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:16,537 INFO L225 Difference]: With dead ends: 11507 [2025-04-13 18:05:16,538 INFO L226 Difference]: Without dead ends: 10530 [2025-04-13 18:05:16,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 85 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:05:16,548 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 118 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:16,549 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 183 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:05:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10530 states. [2025-04-13 18:05:16,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10530 to 8414. [2025-04-13 18:05:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8414 states, 8413 states have (on average 4.055509330797575) internal successors, (34119), 8413 states have internal predecessors, (34119), 0 states have call successors, (0), 0 states have 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:05:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8414 states to 8414 states and 34119 transitions. [2025-04-13 18:05:16,741 INFO L79 Accepts]: Start accepts. Automaton has 8414 states and 34119 transitions. Word has length 51 [2025-04-13 18:05:16,742 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:16,742 INFO L485 AbstractCegarLoop]: Abstraction has 8414 states and 34119 transitions. [2025-04-13 18:05:16,742 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:05:16,742 INFO L278 IsEmpty]: Start isEmpty. Operand 8414 states and 34119 transitions. [2025-04-13 18:05:16,756 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-13 18:05:16,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:16,757 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:16,766 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:05:16,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 18:05:16,957 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:05:16,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:16,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1060848375, now seen corresponding path program 7 times [2025-04-13 18:05:16,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:16,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845999259] [2025-04-13 18:05:16,959 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:16,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:16,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-13 18:05:16,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 18:05:16,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:16,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 18:05:17,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:17,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845999259] [2025-04-13 18:05:17,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845999259] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:17,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:17,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:05:17,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298052583] [2025-04-13 18:05:17,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:17,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:05:17,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:17,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:05:17,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:05:17,313 INFO L87 Difference]: Start difference. First operand 8414 states and 34119 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:05:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:17,910 INFO L93 Difference]: Finished difference Result 10560 states and 41689 transitions. [2025-04-13 18:05:17,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:05:17,910 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 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 51 [2025-04-13 18:05:17,910 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:17,957 INFO L225 Difference]: With dead ends: 10560 [2025-04-13 18:05:17,957 INFO L226 Difference]: Without dead ends: 9816 [2025-04-13 18:05:17,965 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:05:17,965 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 104 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:17,965 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 158 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9816 states. [2025-04-13 18:05:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9816 to 8426. [2025-04-13 18:05:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8426 states, 8425 states have (on average 4.052581602373888) internal successors, (34143), 8425 states have internal predecessors, (34143), 0 states have call successors, (0), 0 states have 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:05:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8426 states to 8426 states and 34143 transitions. [2025-04-13 18:05:18,232 INFO L79 Accepts]: Start accepts. Automaton has 8426 states and 34143 transitions. Word has length 51 [2025-04-13 18:05:18,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:18,233 INFO L485 AbstractCegarLoop]: Abstraction has 8426 states and 34143 transitions. [2025-04-13 18:05:18,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:05:18,233 INFO L278 IsEmpty]: Start isEmpty. Operand 8426 states and 34143 transitions. [2025-04-13 18:05:18,247 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-13 18:05:18,248 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:18,248 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:18,248 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 18:05:18,248 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:05:18,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:18,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1655505003, now seen corresponding path program 8 times [2025-04-13 18:05:18,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:18,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893102290] [2025-04-13 18:05:18,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:05:18,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:18,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-04-13 18:05:18,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 18:05:18,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:18,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 18:05:18,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:18,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893102290] [2025-04-13 18:05:18,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893102290] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:18,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:18,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:05:18,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700003501] [2025-04-13 18:05:18,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:18,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:05:18,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:18,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:05:18,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:05:18,463 INFO L87 Difference]: Start difference. First operand 8426 states and 34143 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:05:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:19,037 INFO L93 Difference]: Finished difference Result 9742 states and 39094 transitions. [2025-04-13 18:05:19,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:05:19,038 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 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 51 [2025-04-13 18:05:19,038 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:19,132 INFO L225 Difference]: With dead ends: 9742 [2025-04-13 18:05:19,132 INFO L226 Difference]: Without dead ends: 8998 [2025-04-13 18:05:19,135 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:05:19,135 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 114 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:19,136 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 186 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8998 states. [2025-04-13 18:05:19,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8998 to 7822. [2025-04-13 18:05:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7822 states, 7821 states have (on average 4.143204193837105) internal successors, (32404), 7821 states have internal predecessors, (32404), 0 states have call successors, (0), 0 states have 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:05:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7822 states to 7822 states and 32404 transitions. [2025-04-13 18:05:19,278 INFO L79 Accepts]: Start accepts. Automaton has 7822 states and 32404 transitions. Word has length 51 [2025-04-13 18:05:19,278 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:19,278 INFO L485 AbstractCegarLoop]: Abstraction has 7822 states and 32404 transitions. [2025-04-13 18:05:19,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:05:19,278 INFO L278 IsEmpty]: Start isEmpty. Operand 7822 states and 32404 transitions. [2025-04-13 18:05:19,291 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-13 18:05:19,291 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:19,291 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:19,291 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 18:05:19,291 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:05:19,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:19,292 INFO L85 PathProgramCache]: Analyzing trace with hash 469385974, now seen corresponding path program 2 times [2025-04-13 18:05:19,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:19,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540803819] [2025-04-13 18:05:19,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:05:19,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:19,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-04-13 18:05:19,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 18:05:19,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:19,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:19,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:19,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540803819] [2025-04-13 18:05:19,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540803819] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:19,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922149440] [2025-04-13 18:05:19,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:05:19,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:19,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:19,385 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:05:19,387 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:05:19,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-04-13 18:05:19,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 18:05:19,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:19,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:19,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:05:19,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:19,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:19,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922149440] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:05:19,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:05:19,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-04-13 18:05:19,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647284216] [2025-04-13 18:05:19,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:05:19,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:05:19,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:19,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:05:19,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:05:19,584 INFO L87 Difference]: Start difference. First operand 7822 states and 32404 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:05:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:20,102 INFO L93 Difference]: Finished difference Result 18116 states and 80670 transitions. [2025-04-13 18:05:20,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:05:20,103 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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 52 [2025-04-13 18:05:20,103 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:20,169 INFO L225 Difference]: With dead ends: 18116 [2025-04-13 18:05:20,170 INFO L226 Difference]: Without dead ends: 17972 [2025-04-13 18:05:20,176 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:05:20,177 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 164 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:20,177 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 225 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:05:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17972 states. [2025-04-13 18:05:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17972 to 12910. [2025-04-13 18:05:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12910 states, 12909 states have (on average 4.2960725075528705) internal successors, (55458), 12909 states have internal predecessors, (55458), 0 states have call successors, (0), 0 states have 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:05:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12910 states to 12910 states and 55458 transitions. [2025-04-13 18:05:20,597 INFO L79 Accepts]: Start accepts. Automaton has 12910 states and 55458 transitions. Word has length 52 [2025-04-13 18:05:20,597 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:20,597 INFO L485 AbstractCegarLoop]: Abstraction has 12910 states and 55458 transitions. [2025-04-13 18:05:20,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:05:20,597 INFO L278 IsEmpty]: Start isEmpty. Operand 12910 states and 55458 transitions. [2025-04-13 18:05:20,625 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-13 18:05:20,625 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:20,625 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:20,632 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:05:20,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 18:05:20,826 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:05:20,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:20,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1840122542, now seen corresponding path program 3 times [2025-04-13 18:05:20,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:20,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791945410] [2025-04-13 18:05:20,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:05:20,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:20,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 3 equivalence classes. [2025-04-13 18:05:20,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 52 statements. [2025-04-13 18:05:20,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:05:20,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:20,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:20,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791945410] [2025-04-13 18:05:20,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791945410] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:20,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428994003] [2025-04-13 18:05:20,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:05:20,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:20,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:20,896 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:05:20,897 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:05:20,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 3 equivalence classes. [2025-04-13 18:05:20,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 52 statements. [2025-04-13 18:05:20,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:05:20,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:20,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:05:20,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:21,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:21,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428994003] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:05:21,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:05:21,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-04-13 18:05:21,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622479468] [2025-04-13 18:05:21,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:05:21,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:05:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:21,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:05:21,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:05:21,051 INFO L87 Difference]: Start difference. First operand 12910 states and 55458 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:05:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:21,547 INFO L93 Difference]: Finished difference Result 20180 states and 87524 transitions. [2025-04-13 18:05:21,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:05:21,547 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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 52 [2025-04-13 18:05:21,547 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:21,612 INFO L225 Difference]: With dead ends: 20180 [2025-04-13 18:05:21,613 INFO L226 Difference]: Without dead ends: 20122 [2025-04-13 18:05:21,618 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 93 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:05:21,619 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 193 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:21,619 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 287 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:05:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20122 states. [2025-04-13 18:05:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20122 to 14534. [2025-04-13 18:05:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14534 states, 14533 states have (on average 4.283355122823918) internal successors, (62250), 14533 states have internal predecessors, (62250), 0 states have call successors, (0), 0 states have 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:05:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14534 states to 14534 states and 62250 transitions. [2025-04-13 18:05:22,003 INFO L79 Accepts]: Start accepts. Automaton has 14534 states and 62250 transitions. Word has length 52 [2025-04-13 18:05:22,003 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:22,004 INFO L485 AbstractCegarLoop]: Abstraction has 14534 states and 62250 transitions. [2025-04-13 18:05:22,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:05:22,004 INFO L278 IsEmpty]: Start isEmpty. Operand 14534 states and 62250 transitions. [2025-04-13 18:05:22,033 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-13 18:05:22,033 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:22,033 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:22,040 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:05:22,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:22,234 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:05:22,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:22,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1204754900, now seen corresponding path program 4 times [2025-04-13 18:05:22,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:22,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144259503] [2025-04-13 18:05:22,234 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:05:22,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:22,240 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-04-13 18:05:22,242 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 52 statements. [2025-04-13 18:05:22,242 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:05:22,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:22,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:22,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144259503] [2025-04-13 18:05:22,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144259503] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:22,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458197687] [2025-04-13 18:05:22,287 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:05:22,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:22,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:22,290 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:05:22,291 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:05:22,344 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-04-13 18:05:22,354 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 52 statements. [2025-04-13 18:05:22,354 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:05:22,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:22,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:05:22,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:22,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:22,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458197687] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:05:22,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:05:22,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-04-13 18:05:22,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469737206] [2025-04-13 18:05:22,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:05:22,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:05:22,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:22,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:05:22,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:05:22,501 INFO L87 Difference]: Start difference. First operand 14534 states and 62250 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:05:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:22,884 INFO L93 Difference]: Finished difference Result 21354 states and 91081 transitions. [2025-04-13 18:05:22,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:05:22,884 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 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 52 [2025-04-13 18:05:22,884 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:22,963 INFO L225 Difference]: With dead ends: 21354 [2025-04-13 18:05:22,963 INFO L226 Difference]: Without dead ends: 21296 [2025-04-13 18:05:22,970 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:05:22,971 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 204 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:22,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 290 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:05:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21296 states. [2025-04-13 18:05:23,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21296 to 16744. [2025-04-13 18:05:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16744 states, 16743 states have (on average 4.283879830376874) internal successors, (71725), 16743 states have internal predecessors, (71725), 0 states have call successors, (0), 0 states have 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:05:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16744 states to 16744 states and 71725 transitions. [2025-04-13 18:05:23,442 INFO L79 Accepts]: Start accepts. Automaton has 16744 states and 71725 transitions. Word has length 52 [2025-04-13 18:05:23,442 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:23,442 INFO L485 AbstractCegarLoop]: Abstraction has 16744 states and 71725 transitions. [2025-04-13 18:05:23,442 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:05:23,442 INFO L278 IsEmpty]: Start isEmpty. Operand 16744 states and 71725 transitions. [2025-04-13 18:05:23,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-13 18:05:23,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:23,484 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:23,490 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:05:23,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:23,686 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:05:23,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:23,686 INFO L85 PathProgramCache]: Analyzing trace with hash 785860568, now seen corresponding path program 5 times [2025-04-13 18:05:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:23,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561403799] [2025-04-13 18:05:23,687 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:23,696 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 3 equivalence classes. [2025-04-13 18:05:23,702 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 18:05:23,702 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:05:23,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:23,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:23,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561403799] [2025-04-13 18:05:23,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561403799] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:23,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180354241] [2025-04-13 18:05:23,773 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:23,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:23,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:23,775 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:05:23,777 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:05:23,836 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 3 equivalence classes. [2025-04-13 18:05:23,862 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 18:05:23,862 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:05:23,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:23,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:05:23,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:23,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:23,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180354241] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:05:23,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:05:23,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-04-13 18:05:23,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360573308] [2025-04-13 18:05:23,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:05:23,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:05:23,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:23,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:05:23,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:05:23,984 INFO L87 Difference]: Start difference. First operand 16744 states and 71725 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:05:24,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:24,448 INFO L93 Difference]: Finished difference Result 30138 states and 128813 transitions. [2025-04-13 18:05:24,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:05:24,448 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 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 52 [2025-04-13 18:05:24,449 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:24,556 INFO L225 Difference]: With dead ends: 30138 [2025-04-13 18:05:24,556 INFO L226 Difference]: Without dead ends: 30080 [2025-04-13 18:05:24,566 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:05:24,567 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 168 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:24,567 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 272 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:05:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30080 states. [2025-04-13 18:05:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30080 to 19918. [2025-04-13 18:05:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19918 states, 19917 states have (on average 4.281217050760657) internal successors, (85269), 19917 states have internal predecessors, (85269), 0 states have call successors, (0), 0 states have 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:05:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19918 states to 19918 states and 85269 transitions. [2025-04-13 18:05:25,237 INFO L79 Accepts]: Start accepts. Automaton has 19918 states and 85269 transitions. Word has length 52 [2025-04-13 18:05:25,238 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:25,238 INFO L485 AbstractCegarLoop]: Abstraction has 19918 states and 85269 transitions. [2025-04-13 18:05:25,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:05:25,238 INFO L278 IsEmpty]: Start isEmpty. Operand 19918 states and 85269 transitions. [2025-04-13 18:05:25,274 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-13 18:05:25,275 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:25,275 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:25,281 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:05:25,475 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,SelfDestructingSolverStorable31 [2025-04-13 18:05:25,475 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:05:25,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 694377146, now seen corresponding path program 6 times [2025-04-13 18:05:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:25,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509507984] [2025-04-13 18:05:25,476 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:05:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:25,482 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 3 equivalence classes. [2025-04-13 18:05:25,498 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 18:05:25,498 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:05:25,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:25,567 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:05:25,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:25,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509507984] [2025-04-13 18:05:25,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509507984] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:25,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608848840] [2025-04-13 18:05:25,568 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:05:25,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:25,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:25,570 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:05:25,572 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:05:25,630 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 3 equivalence classes. [2025-04-13 18:05:25,650 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 18:05:25,651 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:05:25,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:25,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:05:25,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:25,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:05:25,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608848840] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:05:25,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:05:25,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2025-04-13 18:05:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810968636] [2025-04-13 18:05:25,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:05:25,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 18:05:25,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:25,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 18:05:25,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:05:25,780 INFO L87 Difference]: Start difference. First operand 19918 states and 85269 transitions. Second operand has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:05:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:26,774 INFO L93 Difference]: Finished difference Result 38838 states and 170972 transitions. [2025-04-13 18:05:26,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 18:05:26,775 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 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 52 [2025-04-13 18:05:26,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:26,997 INFO L225 Difference]: With dead ends: 38838 [2025-04-13 18:05:26,997 INFO L226 Difference]: Without dead ends: 38638 [2025-04-13 18:05:27,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=419, Invalid=1743, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:05:27,005 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 259 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:27,005 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 558 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:05:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38638 states. [2025-04-13 18:05:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38638 to 24454. [2025-04-13 18:05:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24454 states, 24453 states have (on average 4.358320042530569) internal successors, (106574), 24453 states have internal predecessors, (106574), 0 states have call successors, (0), 0 states have 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:05:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24454 states to 24454 states and 106574 transitions. [2025-04-13 18:05:27,613 INFO L79 Accepts]: Start accepts. Automaton has 24454 states and 106574 transitions. Word has length 52 [2025-04-13 18:05:27,613 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:27,614 INFO L485 AbstractCegarLoop]: Abstraction has 24454 states and 106574 transitions. [2025-04-13 18:05:27,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:05:27,614 INFO L278 IsEmpty]: Start isEmpty. Operand 24454 states and 106574 transitions. [2025-04-13 18:05:27,779 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-13 18:05:27,779 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:27,779 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:27,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-13 18:05:27,980 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,SelfDestructingSolverStorable32 [2025-04-13 18:05:27,980 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:05:27,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1035805152, now seen corresponding path program 9 times [2025-04-13 18:05:27,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:27,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087216264] [2025-04-13 18:05:27,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:05:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:27,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 3 equivalence classes. [2025-04-13 18:05:28,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 51 of 52 statements. [2025-04-13 18:05:28,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:05:28,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:05:28,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:28,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087216264] [2025-04-13 18:05:28,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087216264] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:28,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743280464] [2025-04-13 18:05:28,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:05:28,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:28,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:28,071 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:05:28,072 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:05:28,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 3 equivalence classes. [2025-04-13 18:05:28,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 51 of 52 statements. [2025-04-13 18:05:28,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:05:28,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:28,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:05:28,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:05:28,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:05:28,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743280464] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:05:28,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:05:28,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 13 [2025-04-13 18:05:28,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840781202] [2025-04-13 18:05:28,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:05:28,252 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:05:28,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:28,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:05:28,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:05:28,253 INFO L87 Difference]: Start difference. First operand 24454 states and 106574 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:05:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:28,705 INFO L93 Difference]: Finished difference Result 32304 states and 143329 transitions. [2025-04-13 18:05:28,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:05:28,705 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 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 52 [2025-04-13 18:05:28,706 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:28,845 INFO L225 Difference]: With dead ends: 32304 [2025-04-13 18:05:28,845 INFO L226 Difference]: Without dead ends: 32118 [2025-04-13 18:05:28,858 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:05:28,858 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 82 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:28,858 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 256 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:05:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32118 states. [2025-04-13 18:05:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32118 to 31432. [2025-04-13 18:05:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31432 states, 31431 states have (on average 4.440615952403678) internal successors, (139573), 31431 states have internal predecessors, (139573), 0 states have call successors, (0), 0 states have 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:05:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31432 states to 31432 states and 139573 transitions. [2025-04-13 18:05:29,667 INFO L79 Accepts]: Start accepts. Automaton has 31432 states and 139573 transitions. Word has length 52 [2025-04-13 18:05:29,668 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:29,668 INFO L485 AbstractCegarLoop]: Abstraction has 31432 states and 139573 transitions. [2025-04-13 18:05:29,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:05:29,668 INFO L278 IsEmpty]: Start isEmpty. Operand 31432 states and 139573 transitions. [2025-04-13 18:05:29,739 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 18:05:29,739 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:29,740 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:29,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-13 18:05:29,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:29,941 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:05:29,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:29,941 INFO L85 PathProgramCache]: Analyzing trace with hash -646386509, now seen corresponding path program 7 times [2025-04-13 18:05:29,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:29,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082608998] [2025-04-13 18:05:29,942 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:29,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:29,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-13 18:05:29,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 18:05:29,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:29,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 18:05:30,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:30,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082608998] [2025-04-13 18:05:30,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082608998] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:30,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334846178] [2025-04-13 18:05:30,545 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:30,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:30,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:30,551 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:05:30,553 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:05:30,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-13 18:05:30,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 18:05:30,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:30,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:30,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 18:05:30,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:30,847 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:05:30,848 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 18 [2025-04-13 18:05:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 18:05:30,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:31,309 INFO L325 Elim1Store]: treesize reduction 15, result has 44.4 percent of original size [2025-04-13 18:05:31,309 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 22 [2025-04-13 18:05:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 18:05:31,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334846178] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:05:31,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:05:31,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2025-04-13 18:05:31,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498035828] [2025-04-13 18:05:31,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:05:31,318 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 18:05:31,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:31,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 18:05:31,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:05:31,319 INFO L87 Difference]: Start difference. First operand 31432 states and 139573 transitions. Second operand has 28 states, 27 states have (on average 3.888888888888889) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:05:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:40,576 INFO L93 Difference]: Finished difference Result 70509 states and 309472 transitions. [2025-04-13 18:05:40,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2025-04-13 18:05:40,576 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.888888888888889) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 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 53 [2025-04-13 18:05:40,576 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:41,036 INFO L225 Difference]: With dead ends: 70509 [2025-04-13 18:05:41,036 INFO L226 Difference]: Without dead ends: 63036 [2025-04-13 18:05:41,069 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10218 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3412, Invalid=25318, Unknown=0, NotChecked=0, Total=28730 [2025-04-13 18:05:41,069 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 1299 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 5272 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 5337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 5272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:41,069 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 860 Invalid, 5337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 5272 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-04-13 18:05:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63036 states. [2025-04-13 18:05:43,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63036 to 34038. [2025-04-13 18:05:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34038 states, 34037 states have (on average 4.2948262185268975) internal successors, (146183), 34037 states have internal predecessors, (146183), 0 states have call successors, (0), 0 states have 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:05:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34038 states to 34038 states and 146183 transitions. [2025-04-13 18:05:43,552 INFO L79 Accepts]: Start accepts. Automaton has 34038 states and 146183 transitions. Word has length 53 [2025-04-13 18:05:43,552 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:43,552 INFO L485 AbstractCegarLoop]: Abstraction has 34038 states and 146183 transitions. [2025-04-13 18:05:43,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.888888888888889) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:05:43,553 INFO L278 IsEmpty]: Start isEmpty. Operand 34038 states and 146183 transitions. [2025-04-13 18:05:43,679 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 18:05:43,679 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:43,679 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:43,688 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:05:43,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:43,880 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:05:43,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:43,882 INFO L85 PathProgramCache]: Analyzing trace with hash 893641619, now seen corresponding path program 8 times [2025-04-13 18:05:43,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:43,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495753278] [2025-04-13 18:05:43,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:05:43,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:43,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-04-13 18:05:43,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 18:05:43,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:43,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 18:05:44,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:44,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495753278] [2025-04-13 18:05:44,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495753278] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:44,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653890373] [2025-04-13 18:05:44,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:05:44,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:44,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:44,568 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:05:44,583 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:05:44,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-04-13 18:05:44,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 18:05:44,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:44,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:44,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:05:44,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:45,066 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:45,067 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 37 [2025-04-13 18:05:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-13 18:05:45,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:05:45,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653890373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:45,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:05:45,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 23 [2025-04-13 18:05:45,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029674970] [2025-04-13 18:05:45,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:45,141 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:45,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:45,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:45,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:05:45,141 INFO L87 Difference]: Start difference. First operand 34038 states and 146183 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:05:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:46,124 INFO L93 Difference]: Finished difference Result 34038 states and 146183 transitions. [2025-04-13 18:05:46,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:05:46,124 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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 53 [2025-04-13 18:05:46,124 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:46,204 INFO L225 Difference]: With dead ends: 34038 [2025-04-13 18:05:46,204 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 18:05:46,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:05:46,279 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 151 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:46,279 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 135 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:46,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 18:05:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 18:05:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 18:05:46,349 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2025-04-13 18:05:46,349 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:46,349 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 18:05:46,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:05:46,353 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 18:05:46,353 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 18:05:46,366 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 18:05:46,367 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 18:05:46,367 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 18:05:46,367 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 18:05:46,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-13 18:05:46,569 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,SelfDestructingSolverStorable35 [2025-04-13 18:05:46,583 INFO L422 BasicCegarLoop]: Path program histogram: [10, 9, 8, 2, 2, 1, 1, 1, 1, 1] [2025-04-13 18:05:46,594 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:05:46,594 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:05:46,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:05:46 BasicIcfg [2025-04-13 18:05:46,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:05:46,623 INFO L158 Benchmark]: Toolchain (without parser) took 154073.66ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 101.8MB in the beginning and 565.3MB in the end (delta: -463.6MB). Peak memory consumption was 569.3MB. Max. memory is 8.0GB. [2025-04-13 18:05:46,623 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:05:46,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.43ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 86.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 18:05:46,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.98ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 84.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:05:46,631 INFO L158 Benchmark]: Boogie Preprocessor took 36.18ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:05:46,631 INFO L158 Benchmark]: RCFGBuilder took 510.79ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 40.8MB in the end (delta: 41.9MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 18:05:46,631 INFO L158 Benchmark]: TraceAbstraction took 153180.58ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 39.9MB in the beginning and 565.3MB in the end (delta: -525.4MB). Peak memory consumption was 510.6MB. Max. memory is 8.0GB. [2025-04-13 18:05:46,632 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.17ms. Allocated memory is still 155.2MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 291.43ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 86.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.98ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 84.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 36.18ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 510.79ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 40.8MB in the end (delta: 41.9MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 153180.58ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 39.9MB in the beginning and 565.3MB in the end (delta: -525.4MB). Peak memory consumption was 510.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 101]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 69 locations, 85 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 153.0s, OverallIterations: 36, TraceHistogramMax: 4, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.8s, AutomataDifference: 105.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 12903 SdHoareTripleChecker+Valid, 43.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12903 mSDsluCounter, 11056 SdHoareTripleChecker+Invalid, 38.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9947 mSDsCounter, 1106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48717 IncrementalHoareTripleChecker+Invalid, 49825 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1106 mSolverCounterUnsat, 1109 mSDtfsCounter, 48717 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4168 GetRequests, 2353 SyntacticMatches, 84 SemanticMatches, 1731 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 49817 ImplicationChecksByTransitivity, 69.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34038occurred in iteration=35, InterpolantAutomatonStates: 1376, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 116037 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 28.4s InterpolantComputationTime, 2969 NumberOfCodeBlocks, 2905 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 3951 ConstructedInterpolants, 156 QuantifiedInterpolants, 25132 SizeOfPredicates, 273 NumberOfNonLiveVariables, 6148 ConjunctsInSsa, 373 ConjunctsInUnsatCore, 81 InterpolantComputations, 18 PerfectInterpolantSequences, 783/1037 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 18:05:46,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...