/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:31:47,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:31:47,952 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 22:31:47,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:31:47,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:31:47,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:31:47,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:31:47,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:31:47,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:31:47,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:31:47,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:31:47,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:31:47,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:31:47,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:31:47,970 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:31:47,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:31:47,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:31:47,970 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:31:47,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:31:47,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:31:47,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:31:47,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:31:47,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:31:47,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:31:47,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:31:47,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:31:47,971 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:31:47,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:31:47,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:31:47,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:31:47,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:31:47,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:31:47,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:31:47,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:31:47,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:31:47,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:31:47,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:31:47,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:31:47,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:31:47,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:31:47,971 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:31:47,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:31:47,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:31:47,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:31:47,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:31:47,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:31:47,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:31:47,972 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:31:48,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:31:48,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:31:48,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:31:48,195 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:31:48,196 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:31:48,196 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 22:31:49,515 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091002cd1/9c8aeffd936649819a87dccfba53abcf/FLAG3f423cf3c [2025-04-13 22:31:49,703 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:31:49,715 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2025-04-13 22:31:49,730 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091002cd1/9c8aeffd936649819a87dccfba53abcf/FLAG3f423cf3c [2025-04-13 22:31:50,566 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091002cd1/9c8aeffd936649819a87dccfba53abcf [2025-04-13 22:31:50,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:31:50,569 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:31:50,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:31:50,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:31:50,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:31:50,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:31:50" (1/1) ... [2025-04-13 22:31:50,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c5a0d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50, skipping insertion in model container [2025-04-13 22:31:50,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:31:50" (1/1) ... [2025-04-13 22:31:50,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:31:50,767 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 22:31:50,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:31:50,785 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:31:50,817 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 22:31:50,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:31:50,835 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:31:50,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50 WrapperNode [2025-04-13 22:31:50,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:31:50,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:31:50,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:31:50,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:31:50,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50" (1/1) ... [2025-04-13 22:31:50,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50" (1/1) ... [2025-04-13 22:31:50,870 INFO L138 Inliner]: procedures = 22, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-04-13 22:31:50,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:31:50,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:31:50,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:31:50,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:31:50,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50" (1/1) ... [2025-04-13 22:31:50,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50" (1/1) ... [2025-04-13 22:31:50,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50" (1/1) ... [2025-04-13 22:31:50,887 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 22:31:50,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50" (1/1) ... [2025-04-13 22:31:50,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50" (1/1) ... [2025-04-13 22:31:50,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50" (1/1) ... [2025-04-13 22:31:50,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50" (1/1) ... [2025-04-13 22:31:50,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50" (1/1) ... [2025-04-13 22:31:50,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50" (1/1) ... [2025-04-13 22:31:50,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:31:50,901 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:31:50,901 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:31:50,901 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:31:50,902 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50" (1/1) ... [2025-04-13 22:31:50,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:31:50,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:31:50,929 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 22:31:50,931 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 22:31:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:31:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:31:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:31:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:31:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:31:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:31:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:31:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:31:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:31:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:31:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:31:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:31:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:31:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:31:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:31:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:31:50,950 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:31:51,026 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:31:51,028 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:31:51,209 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:31:51,209 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:31:51,209 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:31:51,345 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:31:51,348 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:31:51,354 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:31:51,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:31:51 BoogieIcfgContainer [2025-04-13 22:31:51,354 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:31:51,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:31:51,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:31:51,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:31:51,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:31:50" (1/3) ... [2025-04-13 22:31:51,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cff7f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:31:51, skipping insertion in model container [2025-04-13 22:31:51,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:50" (2/3) ... [2025-04-13 22:31:51,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cff7f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:31:51, skipping insertion in model container [2025-04-13 22:31:51,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:31:51" (3/3) ... [2025-04-13 22:31:51,361 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2025-04-13 22:31:51,370 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:31:51,372 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 22:31:51,372 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:31:51,424 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 22:31:51,443 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 54 transitions, 129 flow [2025-04-13 22:31:51,507 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 22:31:51,530 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:31:51,537 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;@253b54e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:31:51,537 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 22:31:51,540 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 22:31:51,574 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:31:51,574 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:51,575 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 22:31:51,575 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 22:31:51,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:51,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1442634431, now seen corresponding path program 1 times [2025-04-13 22:31:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:51,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057111505] [2025-04-13 22:31:51,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:51,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:51,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 22:31:51,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:31:51,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:51,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:51,836 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 22:31:51,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:51,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057111505] [2025-04-13 22:31:51,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057111505] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:51,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:51,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:31:51,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587664388] [2025-04-13 22:31:51,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:51,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:31:51,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:51,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:31:51,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:31:51,864 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 22:31:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:51,972 INFO L93 Difference]: Finished difference Result 899 states and 3202 transitions. [2025-04-13 22:31:51,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:31:51,974 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 22:31:51,974 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:51,992 INFO L225 Difference]: With dead ends: 899 [2025-04-13 22:31:51,993 INFO L226 Difference]: Without dead ends: 709 [2025-04-13 22:31:51,995 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 22:31:51,997 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:51,997 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:31:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-04-13 22:31:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2025-04-13 22:31:52,049 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 22:31:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 2525 transitions. [2025-04-13 22:31:52,058 INFO L79 Accepts]: Start accepts. Automaton has 709 states and 2525 transitions. Word has length 37 [2025-04-13 22:31:52,058 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:52,058 INFO L485 AbstractCegarLoop]: Abstraction has 709 states and 2525 transitions. [2025-04-13 22:31:52,059 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 22:31:52,059 INFO L278 IsEmpty]: Start isEmpty. Operand 709 states and 2525 transitions. [2025-04-13 22:31:52,062 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 22:31:52,062 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:52,062 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 22:31:52,062 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:31:52,062 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 22:31:52,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:52,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1298639792, now seen corresponding path program 1 times [2025-04-13 22:31:52,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:52,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559220902] [2025-04-13 22:31:52,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:52,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:52,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 22:31:52,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 22:31:52,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:52,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:52,220 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 22:31:52,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:52,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559220902] [2025-04-13 22:31:52,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559220902] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:52,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:52,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:31:52,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179143103] [2025-04-13 22:31:52,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:52,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:31:52,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:52,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:31:52,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:31:52,222 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 22:31:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:52,339 INFO L93 Difference]: Finished difference Result 1405 states and 5037 transitions. [2025-04-13 22:31:52,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:31:52,340 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 22:31:52,340 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:52,364 INFO L225 Difference]: With dead ends: 1405 [2025-04-13 22:31:52,364 INFO L226 Difference]: Without dead ends: 710 [2025-04-13 22:31:52,367 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 22:31:52,368 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 37 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:52,368 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 6 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:31:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-04-13 22:31:52,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2025-04-13 22:31:52,391 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 22:31:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 2526 transitions. [2025-04-13 22:31:52,395 INFO L79 Accepts]: Start accepts. Automaton has 710 states and 2526 transitions. Word has length 39 [2025-04-13 22:31:52,395 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:52,395 INFO L485 AbstractCegarLoop]: Abstraction has 710 states and 2526 transitions. [2025-04-13 22:31:52,396 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 22:31:52,396 INFO L278 IsEmpty]: Start isEmpty. Operand 710 states and 2526 transitions. [2025-04-13 22:31:52,398 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:31:52,398 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:52,398 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 22:31:52,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:31:52,399 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 22:31:52,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1039937553, now seen corresponding path program 1 times [2025-04-13 22:31:52,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:52,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350417464] [2025-04-13 22:31:52,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:52,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:52,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:31:52,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:31:52,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:52,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:52,723 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 22:31:52,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:52,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350417464] [2025-04-13 22:31:52,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350417464] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:52,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:52,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:31:52,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307908628] [2025-04-13 22:31:52,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:52,724 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:31:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:52,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:31:52,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:31:52,725 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 22:31:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:52,923 INFO L93 Difference]: Finished difference Result 858 states and 3055 transitions. [2025-04-13 22:31:52,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:31:52,923 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 22:31:52,924 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:52,927 INFO L225 Difference]: With dead ends: 858 [2025-04-13 22:31:52,927 INFO L226 Difference]: Without dead ends: 582 [2025-04-13 22:31:52,928 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 22:31:52,928 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 42 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:52,929 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 14 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-04-13 22:31:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2025-04-13 22:31:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 3.521514629948365) internal successors, (2046), 581 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:31:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 2046 transitions. [2025-04-13 22:31:52,946 INFO L79 Accepts]: Start accepts. Automaton has 582 states and 2046 transitions. Word has length 40 [2025-04-13 22:31:52,946 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:52,946 INFO L485 AbstractCegarLoop]: Abstraction has 582 states and 2046 transitions. [2025-04-13 22:31:52,946 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 22:31:52,947 INFO L278 IsEmpty]: Start isEmpty. Operand 582 states and 2046 transitions. [2025-04-13 22:31:52,948 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:31:52,948 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:52,948 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 22:31:52,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:31:52,948 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 22:31:52,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1924583693, now seen corresponding path program 2 times [2025-04-13 22:31:52,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:52,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709800154] [2025-04-13 22:31:52,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:52,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:52,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:31:52,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 40 statements. [2025-04-13 22:31:52,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:52,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:53,156 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 22:31:53,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:53,156 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709800154] [2025-04-13 22:31:53,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709800154] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:53,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:53,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:31:53,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467604326] [2025-04-13 22:31:53,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:53,157 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:31:53,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:53,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:31:53,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:31:53,157 INFO L87 Difference]: Start difference. First operand 582 states and 2046 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 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 22:31:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:53,521 INFO L93 Difference]: Finished difference Result 1239 states and 4376 transitions. [2025-04-13 22:31:53,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:31:53,522 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 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 22:31:53,522 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:53,527 INFO L225 Difference]: With dead ends: 1239 [2025-04-13 22:31:53,527 INFO L226 Difference]: Without dead ends: 664 [2025-04-13 22:31:53,528 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:31:53,528 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 109 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:53,528 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 32 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:31:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-04-13 22:31:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 630. [2025-04-13 22:31:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 629 states have (on average 3.271860095389507) internal successors, (2058), 629 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:31:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 2058 transitions. [2025-04-13 22:31:53,546 INFO L79 Accepts]: Start accepts. Automaton has 630 states and 2058 transitions. Word has length 40 [2025-04-13 22:31:53,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:53,547 INFO L485 AbstractCegarLoop]: Abstraction has 630 states and 2058 transitions. [2025-04-13 22:31:53,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 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 22:31:53,547 INFO L278 IsEmpty]: Start isEmpty. Operand 630 states and 2058 transitions. [2025-04-13 22:31:53,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:31:53,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:53,549 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 22:31:53,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:31:53,549 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 22:31:53,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1462832332, now seen corresponding path program 1 times [2025-04-13 22:31:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:53,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903953987] [2025-04-13 22:31:53,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:53,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:53,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:31:53,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:31:53,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:53,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:53,814 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 22:31:53,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:53,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903953987] [2025-04-13 22:31:53,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903953987] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:53,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:53,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:53,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217724725] [2025-04-13 22:31:53,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:53,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:53,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:53,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:53,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:53,815 INFO L87 Difference]: Start difference. First operand 630 states and 2058 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 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 22:31:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:54,750 INFO L93 Difference]: Finished difference Result 1647 states and 6242 transitions. [2025-04-13 22:31:54,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 22:31:54,751 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 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 22:31:54,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:54,760 INFO L225 Difference]: With dead ends: 1647 [2025-04-13 22:31:54,760 INFO L226 Difference]: Without dead ends: 1342 [2025-04-13 22:31:54,761 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=387, Invalid=1505, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:31:54,762 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 551 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:54,762 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 61 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:31:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-04-13 22:31:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 854. [2025-04-13 22:31:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 853 states have (on average 3.425556858147714) internal successors, (2922), 853 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:31:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 2922 transitions. [2025-04-13 22:31:54,794 INFO L79 Accepts]: Start accepts. Automaton has 854 states and 2922 transitions. Word has length 41 [2025-04-13 22:31:54,794 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:54,794 INFO L485 AbstractCegarLoop]: Abstraction has 854 states and 2922 transitions. [2025-04-13 22:31:54,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 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 22:31:54,795 INFO L278 IsEmpty]: Start isEmpty. Operand 854 states and 2922 transitions. [2025-04-13 22:31:54,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:31:54,797 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:54,797 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 22:31:54,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:31:54,797 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 22:31:54,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:54,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1093472686, now seen corresponding path program 1 times [2025-04-13 22:31:54,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:54,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184594382] [2025-04-13 22:31:54,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:54,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:54,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 22:31:54,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:31:54,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:54,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:55,043 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 22:31:55,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:55,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184594382] [2025-04-13 22:31:55,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184594382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:55,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:55,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:55,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260598344] [2025-04-13 22:31:55,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:55,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:31:55,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:55,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:31:55,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:31:55,044 INFO L87 Difference]: Start difference. First operand 854 states and 2922 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 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 22:31:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:56,113 INFO L93 Difference]: Finished difference Result 1626 states and 6095 transitions. [2025-04-13 22:31:56,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 22:31:56,114 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 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 22:31:56,114 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:56,122 INFO L225 Difference]: With dead ends: 1626 [2025-04-13 22:31:56,122 INFO L226 Difference]: Without dead ends: 1224 [2025-04-13 22:31:56,123 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=494, Invalid=1956, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:31:56,125 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 532 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:56,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 95 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:31:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2025-04-13 22:31:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 742. [2025-04-13 22:31:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.358974358974359) internal successors, (2489), 741 states have internal predecessors, (2489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:31:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2489 transitions. [2025-04-13 22:31:56,149 INFO L79 Accepts]: Start accepts. Automaton has 742 states and 2489 transitions. Word has length 42 [2025-04-13 22:31:56,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:56,150 INFO L485 AbstractCegarLoop]: Abstraction has 742 states and 2489 transitions. [2025-04-13 22:31:56,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 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 22:31:56,150 INFO L278 IsEmpty]: Start isEmpty. Operand 742 states and 2489 transitions. [2025-04-13 22:31:56,151 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:31:56,151 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:56,152 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 22:31:56,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:31:56,152 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 22:31:56,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1857557848, now seen corresponding path program 1 times [2025-04-13 22:31:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:56,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483800040] [2025-04-13 22:31:56,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:56,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:56,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:31:56,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:31:56,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:56,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:56,260 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 22:31:56,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:56,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483800040] [2025-04-13 22:31:56,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483800040] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:31:56,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294256448] [2025-04-13 22:31:56,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:56,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:31:56,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:31:56,264 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 22:31:56,265 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 22:31:56,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:31:56,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:31:56,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:56,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:56,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:31:56,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:31:56,404 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 22:31:56,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:31:56,464 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 22:31:56,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294256448] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:31:56,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:31:56,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-04-13 22:31:56,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810847213] [2025-04-13 22:31:56,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:31:56,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:31:56,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:56,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:31:56,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:31:56,465 INFO L87 Difference]: Start difference. First operand 742 states and 2489 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:31:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:56,662 INFO L93 Difference]: Finished difference Result 1520 states and 5175 transitions. [2025-04-13 22:31:56,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:31:56,662 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 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 22:31:56,662 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:56,667 INFO L225 Difference]: With dead ends: 1520 [2025-04-13 22:31:56,667 INFO L226 Difference]: Without dead ends: 743 [2025-04-13 22:31:56,668 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 22:31:56,668 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 34 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:56,669 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 35 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-04-13 22:31:56,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2025-04-13 22:31:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 3.3557951482479784) internal successors, (2490), 742 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:31:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 2490 transitions. [2025-04-13 22:31:56,685 INFO L79 Accepts]: Start accepts. Automaton has 743 states and 2490 transitions. Word has length 45 [2025-04-13 22:31:56,686 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:56,686 INFO L485 AbstractCegarLoop]: Abstraction has 743 states and 2490 transitions. [2025-04-13 22:31:56,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:31:56,686 INFO L278 IsEmpty]: Start isEmpty. Operand 743 states and 2490 transitions. [2025-04-13 22:31:56,687 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-13 22:31:56,688 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:56,688 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 22:31:56,695 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 22:31:56,888 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 22:31:56,888 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 22:31:56,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:56,889 INFO L85 PathProgramCache]: Analyzing trace with hash 777678123, now seen corresponding path program 2 times [2025-04-13 22:31:56,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:56,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420091728] [2025-04-13 22:31:56,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:56,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:56,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-13 22:31:56,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 46 statements. [2025-04-13 22:31:56,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:56,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:57,051 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 22:31:57,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:57,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420091728] [2025-04-13 22:31:57,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420091728] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:57,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:57,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:31:57,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758922819] [2025-04-13 22:31:57,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:57,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:31:57,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:57,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:31:57,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:31:57,053 INFO L87 Difference]: Start difference. First operand 743 states and 2490 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 22:31:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:57,276 INFO L93 Difference]: Finished difference Result 1023 states and 3486 transitions. [2025-04-13 22:31:57,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:31:57,277 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 22:31:57,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:57,282 INFO L225 Difference]: With dead ends: 1023 [2025-04-13 22:31:57,282 INFO L226 Difference]: Without dead ends: 835 [2025-04-13 22:31:57,283 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 22:31:57,283 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 130 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:57,283 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 28 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-04-13 22:31:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 743. [2025-04-13 22:31:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 3.2911051212938007) internal successors, (2442), 742 states have internal predecessors, (2442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:31:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 2442 transitions. [2025-04-13 22:31:57,300 INFO L79 Accepts]: Start accepts. Automaton has 743 states and 2442 transitions. Word has length 46 [2025-04-13 22:31:57,300 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:57,300 INFO L485 AbstractCegarLoop]: Abstraction has 743 states and 2442 transitions. [2025-04-13 22:31:57,301 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 22:31:57,301 INFO L278 IsEmpty]: Start isEmpty. Operand 743 states and 2442 transitions. [2025-04-13 22:31:57,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:31:57,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:57,302 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 22:31:57,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:31:57,302 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 22:31:57,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1834511481, now seen corresponding path program 1 times [2025-04-13 22:31:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:57,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958829908] [2025-04-13 22:31:57,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:57,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:57,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 22:31:57,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:31:57,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:57,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:57,386 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 22:31:57,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:57,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958829908] [2025-04-13 22:31:57,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958829908] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:31:57,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491726992] [2025-04-13 22:31:57,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:57,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:31:57,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:31:57,389 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 22:31:57,390 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 22:31:57,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 22:31:57,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:31:57,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:57,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:57,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 22:31:57,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:31:57,533 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 22:31:57,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:31:57,623 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 22:31:57,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491726992] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:31:57,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:31:57,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2025-04-13 22:31:57,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932961239] [2025-04-13 22:31:57,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:31:57,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:31:57,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:57,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:31:57,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:31:57,624 INFO L87 Difference]: Start difference. First operand 743 states and 2442 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 22:31:58,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:58,076 INFO L93 Difference]: Finished difference Result 2029 states and 7059 transitions. [2025-04-13 22:31:58,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:31:58,076 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 22:31:58,077 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:58,082 INFO L225 Difference]: With dead ends: 2029 [2025-04-13 22:31:58,082 INFO L226 Difference]: Without dead ends: 928 [2025-04-13 22:31:58,084 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:31:58,084 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 130 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:58,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 93 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:31:58,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-04-13 22:31:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2025-04-13 22:31:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 3.386192017259978) internal successors, (3139), 927 states have internal predecessors, (3139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:31:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 3139 transitions. [2025-04-13 22:31:58,104 INFO L79 Accepts]: Start accepts. Automaton has 928 states and 3139 transitions. Word has length 47 [2025-04-13 22:31:58,104 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:58,104 INFO L485 AbstractCegarLoop]: Abstraction has 928 states and 3139 transitions. [2025-04-13 22:31:58,105 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 22:31:58,105 INFO L278 IsEmpty]: Start isEmpty. Operand 928 states and 3139 transitions. [2025-04-13 22:31:58,106 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-13 22:31:58,107 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:58,107 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 22:31:58,113 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 22:31:58,311 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 22:31:58,311 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 22:31:58,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:58,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1587366943, now seen corresponding path program 1 times [2025-04-13 22:31:58,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:58,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19714152] [2025-04-13 22:31:58,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:58,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:58,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-13 22:31:58,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-13 22:31:58,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:58,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:58,426 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 22:31:58,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:58,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19714152] [2025-04-13 22:31:58,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19714152] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:31:58,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911914944] [2025-04-13 22:31:58,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:58,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:31:58,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:31:58,429 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 22:31:58,430 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 22:31:58,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-13 22:31:58,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-13 22:31:58,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:58,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:58,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:31:58,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:31:58,582 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 22:31:58,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:31:58,667 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 22:31:58,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911914944] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:31:58,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:31:58,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-04-13 22:31:58,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173546876] [2025-04-13 22:31:58,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:31:58,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:31:58,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:58,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:31:58,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:31:58,668 INFO L87 Difference]: Start difference. First operand 928 states and 3139 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:31:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:58,894 INFO L93 Difference]: Finished difference Result 1242 states and 4237 transitions. [2025-04-13 22:31:58,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:31:58,895 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 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 22:31:58,895 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:58,901 INFO L225 Difference]: With dead ends: 1242 [2025-04-13 22:31:58,901 INFO L226 Difference]: Without dead ends: 1112 [2025-04-13 22:31:58,902 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:31:58,903 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 94 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:58,903 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 38 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-04-13 22:31:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1112. [2025-04-13 22:31:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 1111 states have (on average 3.4518451845184517) internal successors, (3835), 1111 states have internal predecessors, (3835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:31:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 3835 transitions. [2025-04-13 22:31:58,926 INFO L79 Accepts]: Start accepts. Automaton has 1112 states and 3835 transitions. Word has length 49 [2025-04-13 22:31:58,926 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:58,926 INFO L485 AbstractCegarLoop]: Abstraction has 1112 states and 3835 transitions. [2025-04-13 22:31:58,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:31:58,927 INFO L278 IsEmpty]: Start isEmpty. Operand 1112 states and 3835 transitions. [2025-04-13 22:31:58,929 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 22:31:58,929 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:58,929 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 22:31:58,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 22:31:59,130 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 22:31:59,130 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 22:31:59,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:59,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1968385910, now seen corresponding path program 2 times [2025-04-13 22:31:59,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:59,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387180215] [2025-04-13 22:31:59,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:59,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:59,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-04-13 22:31:59,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 22:31:59,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:31:59,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:59,415 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 22:31:59,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:59,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387180215] [2025-04-13 22:31:59,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387180215] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:59,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:59,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:59,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129300346] [2025-04-13 22:31:59,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:59,416 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:31:59,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:59,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:31:59,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:31:59,416 INFO L87 Difference]: Start difference. First operand 1112 states and 3835 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 22:32:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:00,149 INFO L93 Difference]: Finished difference Result 2316 states and 8494 transitions. [2025-04-13 22:32:00,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:32:00,150 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 22:32:00,150 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:00,161 INFO L225 Difference]: With dead ends: 2316 [2025-04-13 22:32:00,161 INFO L226 Difference]: Without dead ends: 2110 [2025-04-13 22:32:00,162 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=270, Invalid=1136, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:32:00,163 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 381 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:00,163 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 74 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:00,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2025-04-13 22:32:00,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 1334. [2025-04-13 22:32:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1333 states have (on average 3.447111777944486) internal successors, (4595), 1333 states have internal predecessors, (4595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 4595 transitions. [2025-04-13 22:32:00,207 INFO L79 Accepts]: Start accepts. Automaton has 1334 states and 4595 transitions. Word has length 50 [2025-04-13 22:32:00,207 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:00,207 INFO L485 AbstractCegarLoop]: Abstraction has 1334 states and 4595 transitions. [2025-04-13 22:32:00,207 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 22:32:00,207 INFO L278 IsEmpty]: Start isEmpty. Operand 1334 states and 4595 transitions. [2025-04-13 22:32:00,210 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 22:32:00,210 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:00,210 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 22:32:00,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:32:00,210 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 22:32:00,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:00,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1069835694, now seen corresponding path program 3 times [2025-04-13 22:32:00,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:00,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467667440] [2025-04-13 22:32:00,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:00,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:00,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 3 equivalence classes. [2025-04-13 22:32:00,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 47 of 50 statements. [2025-04-13 22:32:00,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:32:00,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:00,404 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 22:32:00,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:00,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467667440] [2025-04-13 22:32:00,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467667440] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:00,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397022573] [2025-04-13 22:32:00,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:00,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:00,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:00,406 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 22:32:00,408 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 22:32:00,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 3 equivalence classes. [2025-04-13 22:32:00,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 47 of 50 statements. [2025-04-13 22:32:00,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:32:00,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:00,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 22:32:00,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:00,746 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:00,747 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 31 treesize of output 27 [2025-04-13 22:32:00,794 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 22:32:00,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:01,064 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 22:32:01,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397022573] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:32:01,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:32:01,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 25 [2025-04-13 22:32:01,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668308689] [2025-04-13 22:32:01,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:32:01,065 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:32:01,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:01,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:32:01,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:32:01,066 INFO L87 Difference]: Start difference. First operand 1334 states and 4595 transitions. Second operand has 26 states, 25 states have (on average 4.16) internal successors, (104), 26 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:03,114 INFO L93 Difference]: Finished difference Result 3492 states and 12441 transitions. [2025-04-13 22:32:03,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 22:32:03,115 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.16) internal successors, (104), 26 states have internal predecessors, (104), 0 states have call successors, (0), 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 22:32:03,116 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:03,136 INFO L225 Difference]: With dead ends: 3492 [2025-04-13 22:32:03,136 INFO L226 Difference]: Without dead ends: 3428 [2025-04-13 22:32:03,138 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=924, Invalid=4776, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 22:32:03,141 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 539 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:03,141 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 176 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:32:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2025-04-13 22:32:03,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 1900. [2025-04-13 22:32:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1899 states have (on average 3.6635071090047395) internal successors, (6957), 1899 states have internal predecessors, (6957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 6957 transitions. [2025-04-13 22:32:03,217 INFO L79 Accepts]: Start accepts. Automaton has 1900 states and 6957 transitions. Word has length 50 [2025-04-13 22:32:03,217 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:03,217 INFO L485 AbstractCegarLoop]: Abstraction has 1900 states and 6957 transitions. [2025-04-13 22:32:03,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.16) internal successors, (104), 26 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:03,217 INFO L278 IsEmpty]: Start isEmpty. Operand 1900 states and 6957 transitions. [2025-04-13 22:32:03,222 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 22:32:03,222 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:03,222 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 22:32:03,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 22:32:03,426 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:03,426 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 22:32:03,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:03,426 INFO L85 PathProgramCache]: Analyzing trace with hash 719454882, now seen corresponding path program 4 times [2025-04-13 22:32:03,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:03,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897479385] [2025-04-13 22:32:03,426 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:32:03,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:03,437 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-13 22:32:03,452 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 22:32:03,453 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:32:03,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:03,732 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 22:32:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:03,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897479385] [2025-04-13 22:32:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897479385] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:03,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949725397] [2025-04-13 22:32:03,732 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:32:03,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:03,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:03,734 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 22:32:03,735 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 22:32:03,779 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-13 22:32:03,802 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 22:32:03,802 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:32:03,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:03,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 22:32:03,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:03,918 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:03,919 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 17 [2025-04-13 22:32:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:32:03,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:04,176 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 22:32:04,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949725397] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:32:04,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:32:04,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 24 [2025-04-13 22:32:04,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599707448] [2025-04-13 22:32:04,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:32:04,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:32:04,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:04,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:32:04,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:32:04,177 INFO L87 Difference]: Start difference. First operand 1900 states and 6957 transitions. Second operand has 25 states, 24 states have (on average 4.041666666666667) internal successors, (97), 25 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 22:32:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:07,107 INFO L93 Difference]: Finished difference Result 5892 states and 21719 transitions. [2025-04-13 22:32:07,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-04-13 22:32:07,107 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.041666666666667) internal successors, (97), 25 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 22:32:07,107 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:07,129 INFO L225 Difference]: With dead ends: 5892 [2025-04-13 22:32:07,129 INFO L226 Difference]: Without dead ends: 5828 [2025-04-13 22:32:07,132 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3594 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1538, Invalid=10018, Unknown=0, NotChecked=0, Total=11556 [2025-04-13 22:32:07,133 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 1218 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 3249 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:07,133 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 430 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3249 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 22:32:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5828 states. [2025-04-13 22:32:07,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5828 to 2614. [2025-04-13 22:32:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2614 states, 2613 states have (on average 3.7370838117106775) internal successors, (9765), 2613 states have internal predecessors, (9765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 9765 transitions. [2025-04-13 22:32:07,220 INFO L79 Accepts]: Start accepts. Automaton has 2614 states and 9765 transitions. Word has length 50 [2025-04-13 22:32:07,221 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:07,221 INFO L485 AbstractCegarLoop]: Abstraction has 2614 states and 9765 transitions. [2025-04-13 22:32:07,221 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.041666666666667) internal successors, (97), 25 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 22:32:07,221 INFO L278 IsEmpty]: Start isEmpty. Operand 2614 states and 9765 transitions. [2025-04-13 22:32:07,227 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 22:32:07,227 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:07,227 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 22:32:07,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 22:32:07,428 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,SelfDestructingSolverStorable12 [2025-04-13 22:32:07,428 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 22:32:07,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:07,429 INFO L85 PathProgramCache]: Analyzing trace with hash 139420590, now seen corresponding path program 5 times [2025-04-13 22:32:07,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:07,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376248504] [2025-04-13 22:32:07,429 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:07,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:07,436 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 3 equivalence classes. [2025-04-13 22:32:07,446 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 22:32:07,446 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:32:07,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:32:07,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:07,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376248504] [2025-04-13 22:32:07,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376248504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:07,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:07,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 22:32:07,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241894507] [2025-04-13 22:32:07,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:07,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 22:32:07,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:07,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 22:32:07,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:32:07,727 INFO L87 Difference]: Start difference. First operand 2614 states and 9765 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 22:32:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:09,573 INFO L93 Difference]: Finished difference Result 6475 states and 25284 transitions. [2025-04-13 22:32:09,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-13 22:32:09,574 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 22:32:09,574 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:09,595 INFO L225 Difference]: With dead ends: 6475 [2025-04-13 22:32:09,595 INFO L226 Difference]: Without dead ends: 5934 [2025-04-13 22:32:09,599 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1031, Invalid=5775, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 22:32:09,599 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 747 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:09,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 168 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:32:09,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5934 states. [2025-04-13 22:32:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5934 to 3692. [2025-04-13 22:32:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 3691 states have (on average 3.782443782172853) internal successors, (13961), 3691 states have internal predecessors, (13961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 13961 transitions. [2025-04-13 22:32:09,700 INFO L79 Accepts]: Start accepts. Automaton has 3692 states and 13961 transitions. Word has length 50 [2025-04-13 22:32:09,701 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:09,701 INFO L485 AbstractCegarLoop]: Abstraction has 3692 states and 13961 transitions. [2025-04-13 22:32:09,701 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 22:32:09,701 INFO L278 IsEmpty]: Start isEmpty. Operand 3692 states and 13961 transitions. [2025-04-13 22:32:09,708 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 22:32:09,708 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:09,708 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 22:32:09,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 22:32:09,708 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 22:32:09,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:09,709 INFO L85 PathProgramCache]: Analyzing trace with hash -946771568, now seen corresponding path program 6 times [2025-04-13 22:32:09,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:09,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628055079] [2025-04-13 22:32:09,709 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:32:09,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:09,715 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 3 equivalence classes. [2025-04-13 22:32:09,730 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 22:32:09,730 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:32:09,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 22:32:10,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:10,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628055079] [2025-04-13 22:32:10,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628055079] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:10,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515131267] [2025-04-13 22:32:10,048 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:32:10,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:10,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:10,050 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 22:32:10,051 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 22:32:10,100 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 3 equivalence classes. [2025-04-13 22:32:10,127 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 22:32:10,128 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:32:10,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:10,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:32:10,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:10,258 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:10,258 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 22:32:10,312 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 22:32:10,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:32:10,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515131267] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:10,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:32:10,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 22 [2025-04-13 22:32:10,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186190328] [2025-04-13 22:32:10,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:10,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:32:10,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:10,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:32:10,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:32:10,313 INFO L87 Difference]: Start difference. First operand 3692 states and 13961 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 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 22:32:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:10,784 INFO L93 Difference]: Finished difference Result 4974 states and 18595 transitions. [2025-04-13 22:32:10,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:32:10,784 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 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 22:32:10,784 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:10,799 INFO L225 Difference]: With dead ends: 4974 [2025-04-13 22:32:10,799 INFO L226 Difference]: Without dead ends: 4814 [2025-04-13 22:32:10,801 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:32:10,801 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 172 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:10,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 66 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4814 states. [2025-04-13 22:32:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4814 to 3740. [2025-04-13 22:32:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3740 states, 3739 states have (on average 3.777748060978871) internal successors, (14125), 3739 states have internal predecessors, (14125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 14125 transitions. [2025-04-13 22:32:10,898 INFO L79 Accepts]: Start accepts. Automaton has 3740 states and 14125 transitions. Word has length 50 [2025-04-13 22:32:10,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:10,898 INFO L485 AbstractCegarLoop]: Abstraction has 3740 states and 14125 transitions. [2025-04-13 22:32:10,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 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 22:32:10,898 INFO L278 IsEmpty]: Start isEmpty. Operand 3740 states and 14125 transitions. [2025-04-13 22:32:10,906 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 22:32:10,906 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:10,906 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 22:32:10,913 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 22:32:11,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 22:32:11,109 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 22:32:11,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:11,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1952798044, now seen corresponding path program 7 times [2025-04-13 22:32:11,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:11,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570268513] [2025-04-13 22:32:11,109 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:11,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:11,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-13 22:32:11,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 22:32:11,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:11,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:32:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:11,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570268513] [2025-04-13 22:32:11,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570268513] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:11,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:11,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:32:11,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464078857] [2025-04-13 22:32:11,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:11,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:32:11,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:11,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:32:11,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:32:11,330 INFO L87 Difference]: Start difference. First operand 3740 states and 14125 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:11,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:11,781 INFO L93 Difference]: Finished difference Result 4738 states and 17909 transitions. [2025-04-13 22:32:11,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:32:11,781 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 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 22:32:11,781 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:11,796 INFO L225 Difference]: With dead ends: 4738 [2025-04-13 22:32:11,796 INFO L226 Difference]: Without dead ends: 4600 [2025-04-13 22:32:11,797 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:32:11,798 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 161 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:11,798 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 64 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:11,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4600 states. [2025-04-13 22:32:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4600 to 3578. [2025-04-13 22:32:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3578 states, 3577 states have (on average 3.7911657813810455) internal successors, (13561), 3577 states have internal predecessors, (13561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 3578 states and 13561 transitions. [2025-04-13 22:32:11,872 INFO L79 Accepts]: Start accepts. Automaton has 3578 states and 13561 transitions. Word has length 50 [2025-04-13 22:32:11,872 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:11,872 INFO L485 AbstractCegarLoop]: Abstraction has 3578 states and 13561 transitions. [2025-04-13 22:32:11,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:11,872 INFO L278 IsEmpty]: Start isEmpty. Operand 3578 states and 13561 transitions. [2025-04-13 22:32:11,879 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 22:32:11,879 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:11,879 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 22:32:11,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 22:32:11,879 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 22:32:11,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1057376356, now seen corresponding path program 8 times [2025-04-13 22:32:11,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:11,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312729752] [2025-04-13 22:32:11,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:11,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:11,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-04-13 22:32:11,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 22:32:11,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:11,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:12,097 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 22:32:12,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:12,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312729752] [2025-04-13 22:32:12,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312729752] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:12,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:12,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:12,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014328995] [2025-04-13 22:32:12,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:12,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:12,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:12,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:12,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:12,099 INFO L87 Difference]: Start difference. First operand 3578 states and 13561 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 22:32:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:12,620 INFO L93 Difference]: Finished difference Result 4796 states and 18057 transitions. [2025-04-13 22:32:12,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:32:12,620 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 22:32:12,620 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:12,633 INFO L225 Difference]: With dead ends: 4796 [2025-04-13 22:32:12,633 INFO L226 Difference]: Without dead ends: 4658 [2025-04-13 22:32:12,634 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:32:12,635 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 219 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:12,635 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 80 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:12,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4658 states. [2025-04-13 22:32:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4658 to 3566. [2025-04-13 22:32:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3566 states, 3565 states have (on average 3.788218793828892) internal successors, (13505), 3565 states have internal predecessors, (13505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 13505 transitions. [2025-04-13 22:32:12,700 INFO L79 Accepts]: Start accepts. Automaton has 3566 states and 13505 transitions. Word has length 50 [2025-04-13 22:32:12,700 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:12,701 INFO L485 AbstractCegarLoop]: Abstraction has 3566 states and 13505 transitions. [2025-04-13 22:32:12,701 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 22:32:12,701 INFO L278 IsEmpty]: Start isEmpty. Operand 3566 states and 13505 transitions. [2025-04-13 22:32:12,707 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 22:32:12,707 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:12,707 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 22:32:12,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 22:32:12,708 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 22:32:12,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:12,708 INFO L85 PathProgramCache]: Analyzing trace with hash -563179220, now seen corresponding path program 9 times [2025-04-13 22:32:12,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:12,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381199833] [2025-04-13 22:32:12,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:12,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:12,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 3 equivalence classes. [2025-04-13 22:32:12,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 47 of 50 statements. [2025-04-13 22:32:12,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:32:12,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 22:32:12,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:12,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381199833] [2025-04-13 22:32:12,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381199833] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:12,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471128453] [2025-04-13 22:32:12,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:12,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:12,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:12,863 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 22:32:12,865 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 22:32:12,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 3 equivalence classes. [2025-04-13 22:32:12,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 47 of 50 statements. [2025-04-13 22:32:12,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:32:12,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:12,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 22:32:12,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:13,051 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:13,051 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 21 treesize of output 17 [2025-04-13 22:32:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 22:32:13,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 22:32:13,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471128453] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:32:13,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:32:13,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 22 [2025-04-13 22:32:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322465759] [2025-04-13 22:32:13,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:32:13,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:32:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:13,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:32:13,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:32:13,202 INFO L87 Difference]: Start difference. First operand 3566 states and 13505 transitions. Second operand has 23 states, 22 states have (on average 4.181818181818182) internal successors, (92), 23 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:14,421 INFO L93 Difference]: Finished difference Result 5091 states and 18840 transitions. [2025-04-13 22:32:14,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 22:32:14,422 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.181818181818182) internal successors, (92), 23 states have internal predecessors, (92), 0 states have call successors, (0), 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 22:32:14,422 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:14,435 INFO L225 Difference]: With dead ends: 5091 [2025-04-13 22:32:14,435 INFO L226 Difference]: Without dead ends: 5014 [2025-04-13 22:32:14,436 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=491, Invalid=2701, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:32:14,437 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 507 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 2135 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:14,437 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 264 Invalid, 2178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2135 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:32:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5014 states. [2025-04-13 22:32:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5014 to 3668. [2025-04-13 22:32:14,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 3667 states have (on average 3.766839378238342) internal successors, (13813), 3667 states have internal predecessors, (13813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 13813 transitions. [2025-04-13 22:32:14,511 INFO L79 Accepts]: Start accepts. Automaton has 3668 states and 13813 transitions. Word has length 50 [2025-04-13 22:32:14,511 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:14,511 INFO L485 AbstractCegarLoop]: Abstraction has 3668 states and 13813 transitions. [2025-04-13 22:32:14,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.181818181818182) internal successors, (92), 23 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:14,511 INFO L278 IsEmpty]: Start isEmpty. Operand 3668 states and 13813 transitions. [2025-04-13 22:32:14,517 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 22:32:14,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:14,519 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 22:32:14,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 22:32:14,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:14,723 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 22:32:14,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:14,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2006926070, now seen corresponding path program 10 times [2025-04-13 22:32:14,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:14,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766261288] [2025-04-13 22:32:14,723 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:32:14,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:14,729 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-13 22:32:14,740 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 22:32:14,740 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:32:14,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:32:14,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:14,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766261288] [2025-04-13 22:32:14,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766261288] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:14,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935158010] [2025-04-13 22:32:14,978 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:32:14,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:14,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:14,979 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 22:32:14,981 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 22:32:15,027 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-13 22:32:15,049 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 22:32:15,049 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:32:15,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:15,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 22:32:15,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:15,188 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:15,189 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 33 treesize of output 27 [2025-04-13 22:32:15,253 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 22:32:15,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 22:32:15,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935158010] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:32:15,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:32:15,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 24 [2025-04-13 22:32:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324996583] [2025-04-13 22:32:15,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:32:15,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:32:15,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:15,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:32:15,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:32:15,402 INFO L87 Difference]: Start difference. First operand 3668 states and 13813 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:18,618 INFO L93 Difference]: Finished difference Result 8114 states and 31258 transitions. [2025-04-13 22:32:18,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-04-13 22:32:18,619 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 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 22:32:18,619 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:18,641 INFO L225 Difference]: With dead ends: 8114 [2025-04-13 22:32:18,641 INFO L226 Difference]: Without dead ends: 8068 [2025-04-13 22:32:18,646 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2617 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1115, Invalid=8005, Unknown=0, NotChecked=0, Total=9120 [2025-04-13 22:32:18,647 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 913 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 3789 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 3839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 3789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:18,647 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 431 Invalid, 3839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 3789 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 22:32:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8068 states. [2025-04-13 22:32:18,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8068 to 3812. [2025-04-13 22:32:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3812 states, 3811 states have (on average 3.818157963789032) internal successors, (14551), 3811 states have internal predecessors, (14551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3812 states to 3812 states and 14551 transitions. [2025-04-13 22:32:18,778 INFO L79 Accepts]: Start accepts. Automaton has 3812 states and 14551 transitions. Word has length 50 [2025-04-13 22:32:18,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:18,778 INFO L485 AbstractCegarLoop]: Abstraction has 3812 states and 14551 transitions. [2025-04-13 22:32:18,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:18,778 INFO L278 IsEmpty]: Start isEmpty. Operand 3812 states and 14551 transitions. [2025-04-13 22:32:18,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 22:32:18,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:18,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] [2025-04-13 22:32:18,792 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 22:32:18,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:18,986 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 22:32:18,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1108263562, now seen corresponding path program 11 times [2025-04-13 22:32:18,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:18,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715472265] [2025-04-13 22:32:18,986 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:18,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:18,993 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 3 equivalence classes. [2025-04-13 22:32:18,999 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 22:32:18,999 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:32:18,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:32:19,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:19,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715472265] [2025-04-13 22:32:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715472265] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:19,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42214289] [2025-04-13 22:32:19,217 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:19,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:19,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:19,219 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 22:32:19,220 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 22:32:19,268 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 3 equivalence classes. [2025-04-13 22:32:19,291 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 22:32:19,291 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:32:19,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:19,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 22:32:19,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:19,385 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:19,385 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 22:32:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:32:19,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:32:19,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42214289] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:19,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:32:19,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 8] total 21 [2025-04-13 22:32:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206780061] [2025-04-13 22:32:19,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:19,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:32:19,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:19,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:32:19,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:32:19,594 INFO L87 Difference]: Start difference. First operand 3812 states and 14551 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 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 22:32:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:19,896 INFO L93 Difference]: Finished difference Result 4763 states and 18506 transitions. [2025-04-13 22:32:19,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:32:19,896 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 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 22:32:19,896 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:19,934 INFO L225 Difference]: With dead ends: 4763 [2025-04-13 22:32:19,934 INFO L226 Difference]: Without dead ends: 4400 [2025-04-13 22:32:19,936 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 94 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:32:19,936 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 153 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:19,936 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 48 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:32:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2025-04-13 22:32:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 4080. [2025-04-13 22:32:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4080 states, 4079 states have (on average 3.867124295170385) internal successors, (15774), 4079 states have internal predecessors, (15774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 15774 transitions. [2025-04-13 22:32:20,004 INFO L79 Accepts]: Start accepts. Automaton has 4080 states and 15774 transitions. Word has length 50 [2025-04-13 22:32:20,004 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:20,005 INFO L485 AbstractCegarLoop]: Abstraction has 4080 states and 15774 transitions. [2025-04-13 22:32:20,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 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 22:32:20,005 INFO L278 IsEmpty]: Start isEmpty. Operand 4080 states and 15774 transitions. [2025-04-13 22:32:20,012 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 22:32:20,012 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:20,012 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 22:32:20,019 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 22:32:20,217 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:20,217 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 22:32:20,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:20,218 INFO L85 PathProgramCache]: Analyzing trace with hash -801012908, now seen corresponding path program 12 times [2025-04-13 22:32:20,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:20,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993390871] [2025-04-13 22:32:20,218 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:32:20,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:20,224 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 3 equivalence classes. [2025-04-13 22:32:20,238 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 22:32:20,238 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:32:20,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 22:32:20,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:20,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993390871] [2025-04-13 22:32:20,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993390871] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:20,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871324311] [2025-04-13 22:32:20,462 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:32:20,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:20,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:20,478 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 22:32:20,481 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 22:32:20,523 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 3 equivalence classes. [2025-04-13 22:32:20,544 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 22:32:20,545 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:32:20,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:20,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:32:20,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:20,645 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:20,646 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 22:32:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:32:20,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:32:20,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871324311] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:20,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:32:20,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 9] total 26 [2025-04-13 22:32:20,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205152982] [2025-04-13 22:32:20,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:20,912 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:32:20,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:20,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:32:20,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:32:20,912 INFO L87 Difference]: Start difference. First operand 4080 states and 15774 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 22:32:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:21,393 INFO L93 Difference]: Finished difference Result 5110 states and 19508 transitions. [2025-04-13 22:32:21,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:32:21,393 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 22:32:21,393 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:21,406 INFO L225 Difference]: With dead ends: 5110 [2025-04-13 22:32:21,406 INFO L226 Difference]: Without dead ends: 4950 [2025-04-13 22:32:21,408 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 82 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:32:21,409 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 92 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:21,409 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 81 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4950 states. [2025-04-13 22:32:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4950 to 4086. [2025-04-13 22:32:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 4085 states have (on average 3.8658506731946143) internal successors, (15792), 4085 states have internal predecessors, (15792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 15792 transitions. [2025-04-13 22:32:21,493 INFO L79 Accepts]: Start accepts. Automaton has 4086 states and 15792 transitions. Word has length 50 [2025-04-13 22:32:21,494 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:21,494 INFO L485 AbstractCegarLoop]: Abstraction has 4086 states and 15792 transitions. [2025-04-13 22:32:21,494 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 22:32:21,494 INFO L278 IsEmpty]: Start isEmpty. Operand 4086 states and 15792 transitions. [2025-04-13 22:32:21,501 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 22:32:21,501 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:21,501 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 22:32:21,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 22:32:21,702 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-13 22:32:21,702 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 22:32:21,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1868262230, now seen corresponding path program 13 times [2025-04-13 22:32:21,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:21,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873378587] [2025-04-13 22:32:21,702 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:21,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:21,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-13 22:32:21,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 22:32:21,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:21,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:32:21,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:21,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873378587] [2025-04-13 22:32:21,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873378587] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:21,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:21,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:32:21,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332454737] [2025-04-13 22:32:21,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:21,851 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:32:21,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:21,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:32:21,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:32:21,851 INFO L87 Difference]: Start difference. First operand 4086 states and 15792 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:22,300 INFO L93 Difference]: Finished difference Result 5212 states and 19834 transitions. [2025-04-13 22:32:22,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:32:22,300 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 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 22:32:22,300 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:22,313 INFO L225 Difference]: With dead ends: 5212 [2025-04-13 22:32:22,313 INFO L226 Difference]: Without dead ends: 5052 [2025-04-13 22:32:22,315 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:32:22,316 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 133 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:22,316 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 88 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5052 states. [2025-04-13 22:32:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5052 to 3906. [2025-04-13 22:32:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3906 states, 3905 states have (on average 3.8816901408450706) internal successors, (15158), 3905 states have internal predecessors, (15158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 15158 transitions. [2025-04-13 22:32:22,409 INFO L79 Accepts]: Start accepts. Automaton has 3906 states and 15158 transitions. Word has length 50 [2025-04-13 22:32:22,410 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:22,410 INFO L485 AbstractCegarLoop]: Abstraction has 3906 states and 15158 transitions. [2025-04-13 22:32:22,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:22,410 INFO L278 IsEmpty]: Start isEmpty. Operand 3906 states and 15158 transitions. [2025-04-13 22:32:22,416 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-13 22:32:22,416 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:22,416 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 22:32:22,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 22:32:22,416 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 22:32:22,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1861052644, now seen corresponding path program 1 times [2025-04-13 22:32:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:22,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066212383] [2025-04-13 22:32:22,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:32:22,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:22,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-13 22:32:22,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 22:32:22,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:22,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:22,496 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 22:32:22,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:22,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066212383] [2025-04-13 22:32:22,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066212383] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:22,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314739647] [2025-04-13 22:32:22,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:32:22,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:22,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:22,499 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 22:32:22,500 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 22:32:22,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-13 22:32:22,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 22:32:22,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:22,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:22,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:32:22,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:22,663 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 22:32:22,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:22,750 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 22:32:22,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314739647] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:32:22,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:32:22,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2025-04-13 22:32:22,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10905428] [2025-04-13 22:32:22,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:32:22,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:32:22,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:22,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:32:22,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:32:22,751 INFO L87 Difference]: Start difference. First operand 3906 states and 15158 transitions. Second operand has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:23,009 INFO L93 Difference]: Finished difference Result 8660 states and 33591 transitions. [2025-04-13 22:32:23,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:32:23,009 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 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 22:32:23,009 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:23,022 INFO L225 Difference]: With dead ends: 8660 [2025-04-13 22:32:23,022 INFO L226 Difference]: Without dead ends: 5110 [2025-04-13 22:32:23,028 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:32:23,029 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 87 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:23,029 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 82 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:32:23,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5110 states. [2025-04-13 22:32:23,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5110 to 4844. [2025-04-13 22:32:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4844 states, 4843 states have (on average 3.761511459838943) internal successors, (18217), 4843 states have internal predecessors, (18217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4844 states to 4844 states and 18217 transitions. [2025-04-13 22:32:23,106 INFO L79 Accepts]: Start accepts. Automaton has 4844 states and 18217 transitions. Word has length 51 [2025-04-13 22:32:23,106 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:23,106 INFO L485 AbstractCegarLoop]: Abstraction has 4844 states and 18217 transitions. [2025-04-13 22:32:23,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:23,106 INFO L278 IsEmpty]: Start isEmpty. Operand 4844 states and 18217 transitions. [2025-04-13 22:32:23,114 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-13 22:32:23,114 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:23,114 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 22:32:23,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 22:32:23,314 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,SelfDestructingSolverStorable22 [2025-04-13 22:32:23,315 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 22:32:23,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:23,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2132921508, now seen corresponding path program 1 times [2025-04-13 22:32:23,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:23,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844299348] [2025-04-13 22:32:23,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:32:23,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:23,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-13 22:32:23,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 22:32:23,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:23,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:32:23,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:23,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844299348] [2025-04-13 22:32:23,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844299348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:23,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214974396] [2025-04-13 22:32:23,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:32:23,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:23,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:23,642 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 22:32:23,643 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 22:32:23,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-13 22:32:23,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 22:32:23,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:23,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:23,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:32:23,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:32:23,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:24,005 INFO L325 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2025-04-13 22:32:24,005 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 22:32:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:32:24,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214974396] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:32:24,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:32:24,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 8] total 27 [2025-04-13 22:32:24,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147556826] [2025-04-13 22:32:24,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:32:24,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:32:24,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:24,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:32:24,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:32:24,022 INFO L87 Difference]: Start difference. First operand 4844 states and 18217 transitions. Second operand has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:30,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:30,248 INFO L93 Difference]: Finished difference Result 19444 states and 79661 transitions. [2025-04-13 22:32:30,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2025-04-13 22:32:30,248 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-04-13 22:32:30,248 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:30,265 INFO L225 Difference]: With dead ends: 19444 [2025-04-13 22:32:30,265 INFO L226 Difference]: Without dead ends: 5271 [2025-04-13 22:32:30,286 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18594 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4797, Invalid=42945, Unknown=0, NotChecked=0, Total=47742 [2025-04-13 22:32:30,287 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 1846 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 5995 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 6184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 5995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:30,287 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1846 Valid, 880 Invalid, 6184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 5995 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-04-13 22:32:30,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5271 states. [2025-04-13 22:32:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5271 to 4093. [2025-04-13 22:32:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4093 states, 4092 states have (on average 3.757575757575758) internal successors, (15376), 4092 states have internal predecessors, (15376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 15376 transitions. [2025-04-13 22:32:30,404 INFO L79 Accepts]: Start accepts. Automaton has 4093 states and 15376 transitions. Word has length 51 [2025-04-13 22:32:30,404 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:30,404 INFO L485 AbstractCegarLoop]: Abstraction has 4093 states and 15376 transitions. [2025-04-13 22:32:30,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:30,404 INFO L278 IsEmpty]: Start isEmpty. Operand 4093 states and 15376 transitions. [2025-04-13 22:32:30,410 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-13 22:32:30,411 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:30,411 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 22:32:30,416 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 22:32:30,611 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,SelfDestructingSolverStorable23 [2025-04-13 22:32:30,611 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 22:32:30,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:30,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2133198425, now seen corresponding path program 2 times [2025-04-13 22:32:30,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:30,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772194352] [2025-04-13 22:32:30,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:30,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:30,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-04-13 22:32:30,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 22:32:30,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:30,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:32:30,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:30,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772194352] [2025-04-13 22:32:30,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772194352] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:30,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378912462] [2025-04-13 22:32:30,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:30,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:30,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:30,678 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 22:32:30,679 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 22:32:30,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-04-13 22:32:30,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 22:32:30,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:30,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:30,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:32:30,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:32:30,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:32:30,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378912462] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:32:30,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:32:30,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-04-13 22:32:30,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250789548] [2025-04-13 22:32:30,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:32:30,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:30,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:30,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:30,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:30,851 INFO L87 Difference]: Start difference. First operand 4093 states and 15376 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:31,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:31,103 INFO L93 Difference]: Finished difference Result 5577 states and 21039 transitions. [2025-04-13 22:32:31,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:32:31,104 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 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 22:32:31,104 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:31,122 INFO L225 Difference]: With dead ends: 5577 [2025-04-13 22:32:31,122 INFO L226 Difference]: Without dead ends: 5489 [2025-04-13 22:32:31,123 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:32:31,124 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 180 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:31,124 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 64 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:32:31,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2025-04-13 22:32:31,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 4803. [2025-04-13 22:32:31,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4803 states, 4802 states have (on average 3.7813411078717203) internal successors, (18158), 4802 states have internal predecessors, (18158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4803 states to 4803 states and 18158 transitions. [2025-04-13 22:32:31,212 INFO L79 Accepts]: Start accepts. Automaton has 4803 states and 18158 transitions. Word has length 52 [2025-04-13 22:32:31,212 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:31,212 INFO L485 AbstractCegarLoop]: Abstraction has 4803 states and 18158 transitions. [2025-04-13 22:32:31,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:31,213 INFO L278 IsEmpty]: Start isEmpty. Operand 4803 states and 18158 transitions. [2025-04-13 22:32:31,221 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-13 22:32:31,221 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:31,221 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 22:32:31,227 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 22:32:31,421 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,SelfDestructingSolverStorable24 [2025-04-13 22:32:31,421 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 22:32:31,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash 884300613, now seen corresponding path program 3 times [2025-04-13 22:32:31,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:31,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70179589] [2025-04-13 22:32:31,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:31,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:31,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 3 equivalence classes. [2025-04-13 22:32:31,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 52 statements. [2025-04-13 22:32:31,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:32:31,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:31,485 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 22:32:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:31,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70179589] [2025-04-13 22:32:31,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70179589] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:31,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249502723] [2025-04-13 22:32:31,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:31,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:31,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:31,488 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 22:32:31,489 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 22:32:31,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 3 equivalence classes. [2025-04-13 22:32:31,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 52 statements. [2025-04-13 22:32:31,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:32:31,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:31,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:32:31,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:31,620 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 22:32:31,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:31,663 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 22:32:31,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249502723] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:32:31,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:32:31,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-04-13 22:32:31,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016873532] [2025-04-13 22:32:31,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:32:31,663 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 22:32:31,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:31,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 22:32:31,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:32:31,664 INFO L87 Difference]: Start difference. First operand 4803 states and 18158 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 22:32:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:32,020 INFO L93 Difference]: Finished difference Result 9633 states and 37410 transitions. [2025-04-13 22:32:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:32:32,020 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 22:32:32,020 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:32,045 INFO L225 Difference]: With dead ends: 9633 [2025-04-13 22:32:32,045 INFO L226 Difference]: Without dead ends: 9545 [2025-04-13 22:32:32,047 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:32:32,047 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 191 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:32,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 87 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:32,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2025-04-13 22:32:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 5869. [2025-04-13 22:32:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5869 states, 5868 states have (on average 3.8865030674846626) internal successors, (22806), 5868 states have internal predecessors, (22806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:32,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5869 states to 5869 states and 22806 transitions. [2025-04-13 22:32:32,158 INFO L79 Accepts]: Start accepts. Automaton has 5869 states and 22806 transitions. Word has length 52 [2025-04-13 22:32:32,159 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:32,159 INFO L485 AbstractCegarLoop]: Abstraction has 5869 states and 22806 transitions. [2025-04-13 22:32:32,159 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 22:32:32,159 INFO L278 IsEmpty]: Start isEmpty. Operand 5869 states and 22806 transitions. [2025-04-13 22:32:32,167 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-13 22:32:32,167 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:32,167 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 22:32:32,173 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 22:32:32,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:32,368 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 22:32:32,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:32,368 INFO L85 PathProgramCache]: Analyzing trace with hash -337333485, now seen corresponding path program 4 times [2025-04-13 22:32:32,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:32,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654696613] [2025-04-13 22:32:32,368 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:32:32,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:32,374 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-04-13 22:32:32,375 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 22:32:32,375 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:32:32,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:32,418 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 22:32:32,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:32,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654696613] [2025-04-13 22:32:32,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654696613] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:32,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112175888] [2025-04-13 22:32:32,419 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:32:32,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:32,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:32,420 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 22:32:32,422 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 22:32:32,478 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-04-13 22:32:32,490 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 22:32:32,490 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:32:32,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:32,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:32:32,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:32,540 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 22:32:32,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:32,575 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 22:32:32,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112175888] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:32:32,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:32:32,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-04-13 22:32:32,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223255154] [2025-04-13 22:32:32,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:32:32,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 22:32:32,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:32,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 22:32:32,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:32:32,576 INFO L87 Difference]: Start difference. First operand 5869 states and 22806 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 22:32:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:32,905 INFO L93 Difference]: Finished difference Result 9495 states and 37372 transitions. [2025-04-13 22:32:32,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:32:32,905 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 22:32:32,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:32,934 INFO L225 Difference]: With dead ends: 9495 [2025-04-13 22:32:32,934 INFO L226 Difference]: Without dead ends: 9407 [2025-04-13 22:32:32,937 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:32:32,937 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 192 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:32,937 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 82 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:32:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9407 states. [2025-04-13 22:32:33,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9407 to 6555. [2025-04-13 22:32:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6555 states, 6554 states have (on average 3.9487335978028684) internal successors, (25880), 6554 states have internal predecessors, (25880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6555 states to 6555 states and 25880 transitions. [2025-04-13 22:32:33,095 INFO L79 Accepts]: Start accepts. Automaton has 6555 states and 25880 transitions. Word has length 52 [2025-04-13 22:32:33,095 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:33,095 INFO L485 AbstractCegarLoop]: Abstraction has 6555 states and 25880 transitions. [2025-04-13 22:32:33,095 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 22:32:33,096 INFO L278 IsEmpty]: Start isEmpty. Operand 6555 states and 25880 transitions. [2025-04-13 22:32:33,106 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-13 22:32:33,106 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:33,106 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 22:32:33,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 22:32:33,307 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 22:32:33,307 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 22:32:33,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:33,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1252183157, now seen corresponding path program 5 times [2025-04-13 22:32:33,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:33,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661511381] [2025-04-13 22:32:33,308 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:33,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:33,313 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 3 equivalence classes. [2025-04-13 22:32:33,317 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 22:32:33,317 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:32:33,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 22:32:33,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:33,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661511381] [2025-04-13 22:32:33,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661511381] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:33,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821210908] [2025-04-13 22:32:33,430 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:33,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:33,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:33,432 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 22:32:33,433 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 22:32:33,491 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 3 equivalence classes. [2025-04-13 22:32:33,518 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 22:32:33,519 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:32:33,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:33,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:32:33,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:32:33,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:32:33,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821210908] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:32:33,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:32:33,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2025-04-13 22:32:33,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544012853] [2025-04-13 22:32:33,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:32:33,659 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:32:33,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:33,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:32:33,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:32:33,660 INFO L87 Difference]: Start difference. First operand 6555 states and 25880 transitions. Second operand has 20 states, 20 states have (on average 4.35) internal successors, (87), 20 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 22:32:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:34,209 INFO L93 Difference]: Finished difference Result 12333 states and 50512 transitions. [2025-04-13 22:32:34,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:32:34,209 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.35) internal successors, (87), 20 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 22:32:34,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:34,245 INFO L225 Difference]: With dead ends: 12333 [2025-04-13 22:32:34,245 INFO L226 Difference]: Without dead ends: 12245 [2025-04-13 22:32:34,249 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=482, Invalid=1410, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:32:34,250 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 291 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:34,250 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 103 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12245 states. [2025-04-13 22:32:34,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12245 to 5647. [2025-04-13 22:32:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5647 states, 5646 states have (on average 3.9001062699256113) internal successors, (22020), 5646 states have internal predecessors, (22020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5647 states to 5647 states and 22020 transitions. [2025-04-13 22:32:34,393 INFO L79 Accepts]: Start accepts. Automaton has 5647 states and 22020 transitions. Word has length 52 [2025-04-13 22:32:34,394 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:34,394 INFO L485 AbstractCegarLoop]: Abstraction has 5647 states and 22020 transitions. [2025-04-13 22:32:34,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.35) internal successors, (87), 20 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 22:32:34,394 INFO L278 IsEmpty]: Start isEmpty. Operand 5647 states and 22020 transitions. [2025-04-13 22:32:34,402 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:32:34,402 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:34,403 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 22:32:34,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 22:32:34,603 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,SelfDestructingSolverStorable27 [2025-04-13 22:32:34,603 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 22:32:34,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:34,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1709292668, now seen corresponding path program 6 times [2025-04-13 22:32:34,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:34,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251253195] [2025-04-13 22:32:34,604 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:32:34,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:34,609 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 53 statements into 3 equivalence classes. [2025-04-13 22:32:34,617 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:32:34,617 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:32:34,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:32:34,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:34,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251253195] [2025-04-13 22:32:34,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251253195] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:34,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602185421] [2025-04-13 22:32:34,904 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:32:34,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:34,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:34,906 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 22:32:34,907 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 22:32:34,961 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 53 statements into 3 equivalence classes. [2025-04-13 22:32:34,984 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:32:34,984 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:32:34,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:34,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:32:34,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:35,082 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:35,082 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 22:32:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-13 22:32:35,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:32:35,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602185421] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:35,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:32:35,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 22 [2025-04-13 22:32:35,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070124211] [2025-04-13 22:32:35,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:35,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:32:35,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:35,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:32:35,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:32:35,126 INFO L87 Difference]: Start difference. First operand 5647 states and 22020 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 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 22:32:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:35,670 INFO L93 Difference]: Finished difference Result 7063 states and 27332 transitions. [2025-04-13 22:32:35,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:32:35,671 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 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 53 [2025-04-13 22:32:35,671 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:35,695 INFO L225 Difference]: With dead ends: 7063 [2025-04-13 22:32:35,696 INFO L226 Difference]: Without dead ends: 6745 [2025-04-13 22:32:35,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:32:35,699 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 138 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:35,699 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 61 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6745 states. [2025-04-13 22:32:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6745 to 5599. [2025-04-13 22:32:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5599 states, 5598 states have (on average 3.9035369774919615) internal successors, (21852), 5598 states have internal predecessors, (21852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5599 states to 5599 states and 21852 transitions. [2025-04-13 22:32:35,793 INFO L79 Accepts]: Start accepts. Automaton has 5599 states and 21852 transitions. Word has length 53 [2025-04-13 22:32:35,794 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:35,794 INFO L485 AbstractCegarLoop]: Abstraction has 5599 states and 21852 transitions. [2025-04-13 22:32:35,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 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 22:32:35,794 INFO L278 IsEmpty]: Start isEmpty. Operand 5599 states and 21852 transitions. [2025-04-13 22:32:35,802 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:32:35,802 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:35,802 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 22:32:35,808 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 22:32:36,002 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 22:32:36,003 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 22:32:36,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:36,003 INFO L85 PathProgramCache]: Analyzing trace with hash 104712774, now seen corresponding path program 7 times [2025-04-13 22:32:36,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:36,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658171834] [2025-04-13 22:32:36,003 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:36,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:36,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-13 22:32:36,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:32:36,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:36,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:32:36,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:36,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658171834] [2025-04-13 22:32:36,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658171834] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:36,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439945540] [2025-04-13 22:32:36,178 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:36,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:36,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:36,180 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 22:32:36,181 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 22:32:36,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-13 22:32:36,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:32:36,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:36,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:36,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:32:36,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:36,634 INFO L325 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2025-04-13 22:32:36,634 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 80 treesize of output 62 [2025-04-13 22:32:36,679 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 22:32:36,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:32:37,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439945540] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:32:37,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:32:37,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 13] total 36 [2025-04-13 22:32:37,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870985003] [2025-04-13 22:32:37,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:32:37,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:32:37,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:37,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:32:37,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:32:37,112 INFO L87 Difference]: Start difference. First operand 5599 states and 21852 transitions. Second operand has 37 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 37 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:43,596 INFO L93 Difference]: Finished difference Result 13197 states and 51236 transitions. [2025-04-13 22:32:43,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2025-04-13 22:32:43,596 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 37 states have internal predecessors, (111), 0 states have call successors, (0), 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 22:32:43,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:43,629 INFO L225 Difference]: With dead ends: 13197 [2025-04-13 22:32:43,629 INFO L226 Difference]: Without dead ends: 11777 [2025-04-13 22:32:43,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8202 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3638, Invalid=21802, Unknown=0, NotChecked=0, Total=25440 [2025-04-13 22:32:43,633 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 1706 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 4680 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 4792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 4680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:43,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 570 Invalid, 4792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 4680 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 22:32:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11777 states. [2025-04-13 22:32:43,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11777 to 5761. [2025-04-13 22:32:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5761 states, 5760 states have (on average 3.890625) internal successors, (22410), 5760 states have internal predecessors, (22410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5761 states to 5761 states and 22410 transitions. [2025-04-13 22:32:43,755 INFO L79 Accepts]: Start accepts. Automaton has 5761 states and 22410 transitions. Word has length 53 [2025-04-13 22:32:43,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:43,756 INFO L485 AbstractCegarLoop]: Abstraction has 5761 states and 22410 transitions. [2025-04-13 22:32:43,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 37 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:43,756 INFO L278 IsEmpty]: Start isEmpty. Operand 5761 states and 22410 transitions. [2025-04-13 22:32:43,764 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:32:43,764 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:43,764 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 22:32:43,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 22:32:43,965 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 22:32:43,965 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 22:32:43,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1599297878, now seen corresponding path program 8 times [2025-04-13 22:32:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:43,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727824874] [2025-04-13 22:32:43,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:43,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:43,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-04-13 22:32:43,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:32:43,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:43,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:32:44,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:44,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727824874] [2025-04-13 22:32:44,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727824874] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:44,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447240904] [2025-04-13 22:32:44,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:44,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:44,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:44,322 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 22:32:44,323 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 22:32:44,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-04-13 22:32:44,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:32:44,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:44,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:44,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:32:44,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:44,561 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:44,561 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 22:32:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:32:44,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:32:44,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447240904] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:44,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:32:44,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 10] total 28 [2025-04-13 22:32:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781495750] [2025-04-13 22:32:44,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:44,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:44,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:44,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:44,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:32:44,940 INFO L87 Difference]: Start difference. First operand 5761 states and 22410 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 22:32:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:47,001 INFO L93 Difference]: Finished difference Result 11925 states and 46854 transitions. [2025-04-13 22:32:47,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:32:47,001 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 22:32:47,002 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:47,034 INFO L225 Difference]: With dead ends: 11925 [2025-04-13 22:32:47,034 INFO L226 Difference]: Without dead ends: 11017 [2025-04-13 22:32:47,039 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 90 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=376, Invalid=2594, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:32:47,039 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 301 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:47,039 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 124 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 22:32:47,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11017 states. [2025-04-13 22:32:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11017 to 7349. [2025-04-13 22:32:47,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7349 states, 7348 states have (on average 4.050081654872074) internal successors, (29760), 7348 states have internal predecessors, (29760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7349 states to 7349 states and 29760 transitions. [2025-04-13 22:32:47,199 INFO L79 Accepts]: Start accepts. Automaton has 7349 states and 29760 transitions. Word has length 53 [2025-04-13 22:32:47,199 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:47,199 INFO L485 AbstractCegarLoop]: Abstraction has 7349 states and 29760 transitions. [2025-04-13 22:32:47,199 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 22:32:47,199 INFO L278 IsEmpty]: Start isEmpty. Operand 7349 states and 29760 transitions. [2025-04-13 22:32:47,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:32:47,211 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:47,211 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 22:32:47,217 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 22:32:47,411 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 22:32:47,412 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 22:32:47,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:47,412 INFO L85 PathProgramCache]: Analyzing trace with hash -752160524, now seen corresponding path program 9 times [2025-04-13 22:32:47,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:47,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918734879] [2025-04-13 22:32:47,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:47,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:47,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 3 equivalence classes. [2025-04-13 22:32:47,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 53 statements. [2025-04-13 22:32:47,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:32:47,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:32:47,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:47,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918734879] [2025-04-13 22:32:47,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918734879] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:47,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418145852] [2025-04-13 22:32:47,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:47,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:47,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:47,625 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 22:32:47,627 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 22:32:47,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 3 equivalence classes. [2025-04-13 22:32:47,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 53 statements. [2025-04-13 22:32:47,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:32:47,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:47,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:32:47,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:47,810 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:47,810 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 22:32:47,854 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 22:32:47,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:32:47,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418145852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:47,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:32:47,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2025-04-13 22:32:47,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701123320] [2025-04-13 22:32:47,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:47,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:32:47,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:47,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:32:47,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:32:47,855 INFO L87 Difference]: Start difference. First operand 7349 states and 29760 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 22:32:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:48,272 INFO L93 Difference]: Finished difference Result 8261 states and 32974 transitions. [2025-04-13 22:32:48,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:32:48,272 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 53 [2025-04-13 22:32:48,272 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:48,305 INFO L225 Difference]: With dead ends: 8261 [2025-04-13 22:32:48,305 INFO L226 Difference]: Without dead ends: 7955 [2025-04-13 22:32:48,307 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:32:48,307 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 168 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:48,307 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 77 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:32:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7955 states. [2025-04-13 22:32:48,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7955 to 6155. [2025-04-13 22:32:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6155 states, 6154 states have (on average 4.114722131946701) internal successors, (25322), 6154 states have internal predecessors, (25322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6155 states to 6155 states and 25322 transitions. [2025-04-13 22:32:48,445 INFO L79 Accepts]: Start accepts. Automaton has 6155 states and 25322 transitions. Word has length 53 [2025-04-13 22:32:48,445 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:48,445 INFO L485 AbstractCegarLoop]: Abstraction has 6155 states and 25322 transitions. [2025-04-13 22:32:48,445 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 22:32:48,445 INFO L278 IsEmpty]: Start isEmpty. Operand 6155 states and 25322 transitions. [2025-04-13 22:32:48,455 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 22:32:48,455 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:48,455 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1] [2025-04-13 22:32:48,462 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 22:32:48,656 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 22:32:48,656 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 22:32:48,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:48,657 INFO L85 PathProgramCache]: Analyzing trace with hash 908390858, now seen corresponding path program 1 times [2025-04-13 22:32:48,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:48,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695247210] [2025-04-13 22:32:48,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:32:48,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:48,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 22:32:48,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 22:32:48,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:48,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:32:48,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:48,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695247210] [2025-04-13 22:32:48,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695247210] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:48,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96218049] [2025-04-13 22:32:48,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:32:48,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:48,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:48,938 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 22:32:48,939 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 22:32:48,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 22:32:49,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 22:32:49,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:49,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:49,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:32:49,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:32:49,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:49,310 INFO L325 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2025-04-13 22:32:49,310 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 41 treesize of output 30 [2025-04-13 22:32:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:32:49,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96218049] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:32:49,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:32:49,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 9] total 32 [2025-04-13 22:32:49,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640552095] [2025-04-13 22:32:49,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:32:49,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:32:49,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:49,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:32:49,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=907, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:32:49,326 INFO L87 Difference]: Start difference. First operand 6155 states and 25322 transitions. Second operand has 32 states, 32 states have (on average 3.25) internal successors, (104), 32 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:54,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:54,954 INFO L93 Difference]: Finished difference Result 23905 states and 105416 transitions. [2025-04-13 22:32:54,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2025-04-13 22:32:54,954 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.25) internal successors, (104), 32 states have internal predecessors, (104), 0 states have call successors, (0), 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 54 [2025-04-13 22:32:54,954 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:54,966 INFO L225 Difference]: With dead ends: 23905 [2025-04-13 22:32:54,966 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 22:32:54,986 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10464 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3864, Invalid=27288, Unknown=0, NotChecked=0, Total=31152 [2025-04-13 22:32:54,986 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 1458 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 6249 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 6348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 6249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:54,987 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 858 Invalid, 6348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 6249 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-13 22:32:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 22:32:54,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 22:32:54,987 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 22:32:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 22:32:54,999 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2025-04-13 22:32:55,000 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:55,000 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 22:32:55,000 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.25) internal successors, (104), 32 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:55,000 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 22:32:55,000 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 22:32:55,002 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 22:32:55,003 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 22:32:55,003 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 22:32:55,003 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 22:32:55,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 22:32:55,203 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 22:32:55,205 INFO L422 BasicCegarLoop]: Path program histogram: [13, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:55,207 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:32:55,207 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:32:55,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:32:55 BasicIcfg [2025-04-13 22:32:55,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:32:55,210 INFO L158 Benchmark]: Toolchain (without parser) took 64640.21ms. Allocated memory was 155.2MB in the beginning and 511.7MB in the end (delta: 356.5MB). Free memory was 108.4MB in the beginning and 269.6MB in the end (delta: -161.2MB). Peak memory consumption was 192.3MB. Max. memory is 8.0GB. [2025-04-13 22:32:55,210 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:32:55,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.67ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 92.4MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:32:55,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.29ms. Allocated memory is still 155.2MB. Free memory was 92.4MB in the beginning and 91.0MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:32:55,212 INFO L158 Benchmark]: Boogie Preprocessor took 29.98ms. Allocated memory is still 155.2MB. Free memory was 91.0MB in the beginning and 88.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:32:55,213 INFO L158 Benchmark]: IcfgBuilder took 453.20ms. Allocated memory is still 155.2MB. Free memory was 88.4MB in the beginning and 46.5MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-13 22:32:55,213 INFO L158 Benchmark]: TraceAbstraction took 63853.19ms. Allocated memory was 155.2MB in the beginning and 511.7MB in the end (delta: 356.5MB). Free memory was 45.7MB in the beginning and 269.6MB in the end (delta: -223.9MB). Peak memory consumption was 133.6MB. Max. memory is 8.0GB. [2025-04-13 22:32:55,213 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 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.67ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 92.4MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.29ms. Allocated memory is still 155.2MB. Free memory was 92.4MB in the beginning and 91.0MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.98ms. Allocated memory is still 155.2MB. Free memory was 91.0MB in the beginning and 88.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 453.20ms. Allocated memory is still 155.2MB. Free memory was 88.4MB in the beginning and 46.5MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 63853.19ms. Allocated memory was 155.2MB in the beginning and 511.7MB in the end (delta: 356.5MB). Free memory was 45.7MB in the beginning and 269.6MB in the end (delta: -223.9MB). Peak memory consumption was 133.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: 63.8s, OverallIterations: 33, TraceHistogramMax: 4, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.2s, AutomataDifference: 42.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13473 SdHoareTripleChecker+Valid, 19.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13473 mSDsluCounter, 5363 SdHoareTripleChecker+Invalid, 16.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4859 mSDsCounter, 1000 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44845 IncrementalHoareTripleChecker+Invalid, 45845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1000 mSolverCounterUnsat, 504 mSDtfsCounter, 44845 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3560 GetRequests, 1923 SyntacticMatches, 63 SemanticMatches, 1574 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53332 ImplicationChecksByTransitivity, 24.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7349occurred in iteration=31, InterpolantAutomatonStates: 1273, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 47862 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 2669 NumberOfCodeBlocks, 2618 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 3508 ConstructedInterpolants, 78 QuantifiedInterpolants, 20064 SizeOfPredicates, 228 NumberOfNonLiveVariables, 5454 ConjunctsInSsa, 341 ConjunctsInUnsatCore, 72 InterpolantComputations, 18 PerfectInterpolantSequences, 778/1018 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 22:32:55,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...