/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/unroll-cond-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:25:26,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:25:26,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:25:26,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:25:26,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:25:26,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:25:26,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:25:26,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:25:26,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:25:26,817 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:25:26,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:25:26,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:25:26,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:25:26,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:25:26,818 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:25:26,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:25:26,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:25:26,819 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:25:26,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:25:26,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:25:26,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:25:26,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:25:26,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:25:26,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:25:26,820 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:25:26,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:25:26,820 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:25:26,820 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:25:26,820 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:25:26,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:25:26,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:25:26,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:25:26,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:25:26,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:25:26,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:25:26,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:25:26,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:25:26,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:25:26,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:25:26,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:25:26,821 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:25:26,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:25:26,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:25:26,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:25:26,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:25:26,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:25:26,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:25:26,821 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:25:27,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:25:27,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:25:27,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:25:27,061 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:25:27,063 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:25:27,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2025-04-13 23:25:28,329 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e668788c6/ae37ff2e11d04e2e82a74299f73fab68/FLAGc3b24f24a [2025-04-13 23:25:28,570 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:25:28,570 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2025-04-13 23:25:28,579 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e668788c6/ae37ff2e11d04e2e82a74299f73fab68/FLAGc3b24f24a [2025-04-13 23:25:29,379 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e668788c6/ae37ff2e11d04e2e82a74299f73fab68 [2025-04-13 23:25:29,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:25:29,383 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:25:29,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:25:29,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:25:29,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:25:29,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:25:29" (1/1) ... [2025-04-13 23:25:29,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600c44b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29, skipping insertion in model container [2025-04-13 23:25:29,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:25:29" (1/1) ... [2025-04-13 23:25:29,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:25:29,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c[2500,2513] [2025-04-13 23:25:29,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:25:29,580 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:25:29,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c[2500,2513] [2025-04-13 23:25:29,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:25:29,631 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:25:29,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29 WrapperNode [2025-04-13 23:25:29,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:25:29,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:25:29,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:25:29,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:25:29,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29" (1/1) ... [2025-04-13 23:25:29,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29" (1/1) ... [2025-04-13 23:25:29,664 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 125 [2025-04-13 23:25:29,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:25:29,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:25:29,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:25:29,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:25:29,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29" (1/1) ... [2025-04-13 23:25:29,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29" (1/1) ... [2025-04-13 23:25:29,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29" (1/1) ... [2025-04-13 23:25:29,690 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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 23:25:29,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29" (1/1) ... [2025-04-13 23:25:29,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29" (1/1) ... [2025-04-13 23:25:29,695 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29" (1/1) ... [2025-04-13 23:25:29,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29" (1/1) ... [2025-04-13 23:25:29,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29" (1/1) ... [2025-04-13 23:25:29,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29" (1/1) ... [2025-04-13 23:25:29,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:25:29,700 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:25:29,700 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:25:29,700 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:25:29,701 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29" (1/1) ... [2025-04-13 23:25:29,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:25:29,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:29,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 23:25:29,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 23:25:29,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:25:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:25:29,744 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:25:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:25:29,744 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:25:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:25:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:25:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:25:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:25:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 23:25:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:25:29,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:25:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:25:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:25:29,745 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:25:29,816 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:25:29,817 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:25:30,008 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:25:30,009 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:25:30,009 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:25:30,190 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:25:30,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:25:30 BoogieIcfgContainer [2025-04-13 23:25:30,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:25:30,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:25:30,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:25:30,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:25:30,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:25:29" (1/3) ... [2025-04-13 23:25:30,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4581835e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:25:30, skipping insertion in model container [2025-04-13 23:25:30,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:25:29" (2/3) ... [2025-04-13 23:25:30,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4581835e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:25:30, skipping insertion in model container [2025-04-13 23:25:30,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:25:30" (3/3) ... [2025-04-13 23:25:30,200 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2025-04-13 23:25:30,210 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:25:30,211 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-2.wvr.c that has 3 procedures, 17 locations, 17 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 23:25:30,212 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:25:30,243 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 23:25:30,265 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 23:25:30,288 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:30,306 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:25:30,315 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;@622add75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:25:30,315 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:25:30,318 INFO L278 IsEmpty]: Start isEmpty. Operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:30,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 23:25:30,321 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:30,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:30,322 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:30,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:30,326 INFO L85 PathProgramCache]: Analyzing trace with hash -984405930, now seen corresponding path program 1 times [2025-04-13 23:25:30,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:30,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76527738] [2025-04-13 23:25:30,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:25:30,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:30,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 23:25:30,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 23:25:30,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:30,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:30,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:30,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76527738] [2025-04-13 23:25:30,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76527738] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:30,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:30,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:25:30,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020463917] [2025-04-13 23:25:30,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:30,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:25:30,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:30,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:25:30,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:25:30,660 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:30,711 INFO L93 Difference]: Finished difference Result 63 states and 137 transitions. [2025-04-13 23:25:30,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:25:30,716 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-13 23:25:30,716 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:30,722 INFO L225 Difference]: With dead ends: 63 [2025-04-13 23:25:30,722 INFO L226 Difference]: Without dead ends: 33 [2025-04-13 23:25:30,724 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:25:30,727 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:30,727 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:25:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-13 23:25:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-04-13 23:25:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 70 transitions. [2025-04-13 23:25:30,750 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 70 transitions. Word has length 13 [2025-04-13 23:25:30,750 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:30,750 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 70 transitions. [2025-04-13 23:25:30,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:30,751 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 70 transitions. [2025-04-13 23:25:30,751 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 23:25:30,751 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:30,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:30,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:25:30,752 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:30,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2129668551, now seen corresponding path program 1 times [2025-04-13 23:25:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:30,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473811628] [2025-04-13 23:25:30,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:25:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:30,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:25:30,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:25:30,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:30,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:31,031 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 23:25:31,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:31,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473811628] [2025-04-13 23:25:31,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473811628] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:31,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:31,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:25:31,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280549215] [2025-04-13 23:25:31,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:31,032 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:25:31,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:31,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:25:31,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:25:31,033 INFO L87 Difference]: Start difference. First operand 33 states and 70 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:31,166 INFO L93 Difference]: Finished difference Result 61 states and 130 transitions. [2025-04-13 23:25:31,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:25:31,166 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 23:25:31,166 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:31,167 INFO L225 Difference]: With dead ends: 61 [2025-04-13 23:25:31,167 INFO L226 Difference]: Without dead ends: 52 [2025-04-13 23:25:31,167 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:25:31,167 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:31,168 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:25:31,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-13 23:25:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2025-04-13 23:25:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 2.3125) internal successors, (111), 48 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 23:25:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 111 transitions. [2025-04-13 23:25:31,194 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 111 transitions. Word has length 14 [2025-04-13 23:25:31,195 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:31,195 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 111 transitions. [2025-04-13 23:25:31,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:31,195 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 111 transitions. [2025-04-13 23:25:31,195 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 23:25:31,195 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:31,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:31,195 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:25:31,195 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:31,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2044827221, now seen corresponding path program 2 times [2025-04-13 23:25:31,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:31,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062508966] [2025-04-13 23:25:31,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:25:31,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:31,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 23:25:31,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 14 statements. [2025-04-13 23:25:31,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:25:31,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:31,356 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 23:25:31,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:31,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062508966] [2025-04-13 23:25:31,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062508966] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:31,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:31,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:25:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825697859] [2025-04-13 23:25:31,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:31,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:25:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:31,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:25:31,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:25:31,358 INFO L87 Difference]: Start difference. First operand 49 states and 111 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:31,432 INFO L93 Difference]: Finished difference Result 61 states and 134 transitions. [2025-04-13 23:25:31,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:25:31,433 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 23:25:31,433 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:31,433 INFO L225 Difference]: With dead ends: 61 [2025-04-13 23:25:31,433 INFO L226 Difference]: Without dead ends: 56 [2025-04-13 23:25:31,434 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:25:31,434 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:31,434 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:25:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-13 23:25:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2025-04-13 23:25:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 2.28) internal successors, (114), 50 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 114 transitions. [2025-04-13 23:25:31,444 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 114 transitions. Word has length 14 [2025-04-13 23:25:31,445 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:31,445 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 114 transitions. [2025-04-13 23:25:31,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:31,445 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 114 transitions. [2025-04-13 23:25:31,445 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 23:25:31,445 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:31,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:31,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:25:31,446 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:31,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash 360111353, now seen corresponding path program 3 times [2025-04-13 23:25:31,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:31,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886963403] [2025-04-13 23:25:31,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:25:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:31,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 23:25:31,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 14 statements. [2025-04-13 23:25:31,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:25:31,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:31,606 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 23:25:31,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:31,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886963403] [2025-04-13 23:25:31,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886963403] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:31,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:31,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:25:31,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955829295] [2025-04-13 23:25:31,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:31,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:25:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:31,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:25:31,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:25:31,608 INFO L87 Difference]: Start difference. First operand 51 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:31,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:31,716 INFO L93 Difference]: Finished difference Result 72 states and 152 transitions. [2025-04-13 23:25:31,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:25:31,717 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 23:25:31,717 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:31,718 INFO L225 Difference]: With dead ends: 72 [2025-04-13 23:25:31,718 INFO L226 Difference]: Without dead ends: 67 [2025-04-13 23:25:31,718 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:25:31,718 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:31,719 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:25:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-13 23:25:31,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2025-04-13 23:25:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 2.25) internal successors, (117), 52 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 117 transitions. [2025-04-13 23:25:31,729 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 117 transitions. Word has length 14 [2025-04-13 23:25:31,729 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:31,729 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 117 transitions. [2025-04-13 23:25:31,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:31,729 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 117 transitions. [2025-04-13 23:25:31,730 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 23:25:31,730 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:31,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:31,730 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:25:31,730 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:31,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:31,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1612403380, now seen corresponding path program 1 times [2025-04-13 23:25:31,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:31,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129027719] [2025-04-13 23:25:31,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:25:31,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:31,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:25:31,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:25:31,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:31,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:25:31,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:31,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129027719] [2025-04-13 23:25:31,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129027719] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:31,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026892741] [2025-04-13 23:25:31,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:25:31,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:31,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:31,869 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:31,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 23:25:31,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:25:31,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:25:31,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:31,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:31,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 23:25:31,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:31,997 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 23:25:32,265 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 23:25:32,265 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 17 [2025-04-13 23:25:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:32,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:32,883 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2025-04-13 23:25:32,902 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:25:32,902 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 116 [2025-04-13 23:25:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:33,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026892741] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:33,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:33,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2025-04-13 23:25:33,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022161175] [2025-04-13 23:25:33,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:33,550 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 23:25:33,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:33,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 23:25:33,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:25:33,551 INFO L87 Difference]: Start difference. First operand 53 states and 117 transitions. Second operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 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 23:25:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:34,353 INFO L93 Difference]: Finished difference Result 187 states and 426 transitions. [2025-04-13 23:25:34,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 23:25:34,353 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 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 15 [2025-04-13 23:25:34,354 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:34,354 INFO L225 Difference]: With dead ends: 187 [2025-04-13 23:25:34,354 INFO L226 Difference]: Without dead ends: 118 [2025-04-13 23:25:34,355 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=348, Invalid=1058, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 23:25:34,356 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:34,356 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:25:34,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-04-13 23:25:34,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 86. [2025-04-13 23:25:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 2.2941176470588234) internal successors, (195), 85 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 195 transitions. [2025-04-13 23:25:34,373 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 195 transitions. Word has length 15 [2025-04-13 23:25:34,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:34,373 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 195 transitions. [2025-04-13 23:25:34,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 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 23:25:34,373 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 195 transitions. [2025-04-13 23:25:34,373 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 23:25:34,373 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:34,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:34,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 23:25:34,579 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:34,579 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:34,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:34,580 INFO L85 PathProgramCache]: Analyzing trace with hash -159710282, now seen corresponding path program 1 times [2025-04-13 23:25:34,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:34,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316045769] [2025-04-13 23:25:34,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:25:34,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:34,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:25:34,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:25:34,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:34,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:25:34,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:34,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316045769] [2025-04-13 23:25:34,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316045769] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:34,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671938575] [2025-04-13 23:25:34,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:25:34,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:34,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:34,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:34,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 23:25:34,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:25:34,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:25:34,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:34,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:34,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 23:25:34,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:34,952 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 23:25:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:25:34,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:35,087 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 23:25:35,087 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2025-04-13 23:25:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:25:35,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671938575] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:35,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:35,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-04-13 23:25:35,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504272524] [2025-04-13 23:25:35,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:35,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 23:25:35,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:35,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 23:25:35,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:25:35,131 INFO L87 Difference]: Start difference. First operand 86 states and 195 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 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 23:25:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:35,317 INFO L93 Difference]: Finished difference Result 141 states and 326 transitions. [2025-04-13 23:25:35,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 23:25:35,318 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 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 15 [2025-04-13 23:25:35,318 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:35,319 INFO L225 Difference]: With dead ends: 141 [2025-04-13 23:25:35,319 INFO L226 Difference]: Without dead ends: 136 [2025-04-13 23:25:35,319 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:25:35,320 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:35,320 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:25:35,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-04-13 23:25:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 101. [2025-04-13 23:25:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.37) internal successors, (237), 100 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 237 transitions. [2025-04-13 23:25:35,333 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 237 transitions. Word has length 15 [2025-04-13 23:25:35,333 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:35,333 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 237 transitions. [2025-04-13 23:25:35,333 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 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 23:25:35,334 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 237 transitions. [2025-04-13 23:25:35,334 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 23:25:35,334 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:35,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:35,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 23:25:35,538 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,SelfDestructingSolverStorable5 [2025-04-13 23:25:35,538 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:35,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:35,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1616204042, now seen corresponding path program 2 times [2025-04-13 23:25:35,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:35,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861134855] [2025-04-13 23:25:35,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:25:35,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:35,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 23:25:35,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:25:35,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:25:35,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:25:35,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:35,738 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861134855] [2025-04-13 23:25:35,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861134855] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:35,738 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523253322] [2025-04-13 23:25:35,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:25:35,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:35,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:35,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:35,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 23:25:35,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 23:25:35,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:25:35,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:25:35,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:35,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:25:35,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:35,872 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 23:25:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:25:35,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:35,962 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:25:35,962 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 48 treesize of output 33 [2025-04-13 23:25:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:25:36,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523253322] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:36,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:36,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2025-04-13 23:25:36,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601596750] [2025-04-13 23:25:36,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:36,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:36,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:36,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:36,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:36,044 INFO L87 Difference]: Start difference. First operand 101 states and 237 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:36,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:36,275 INFO L93 Difference]: Finished difference Result 134 states and 311 transitions. [2025-04-13 23:25:36,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:25:36,276 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 23:25:36,276 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:36,276 INFO L225 Difference]: With dead ends: 134 [2025-04-13 23:25:36,277 INFO L226 Difference]: Without dead ends: 129 [2025-04-13 23:25:36,277 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:25:36,277 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:36,277 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:25:36,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-04-13 23:25:36,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2025-04-13 23:25:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 2.411764705882353) internal successors, (246), 102 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 246 transitions. [2025-04-13 23:25:36,289 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 246 transitions. Word has length 15 [2025-04-13 23:25:36,289 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:36,289 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 246 transitions. [2025-04-13 23:25:36,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:36,290 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 246 transitions. [2025-04-13 23:25:36,290 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 23:25:36,290 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:36,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:36,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 23:25:36,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:36,492 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:36,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:36,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1071242068, now seen corresponding path program 3 times [2025-04-13 23:25:36,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:36,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628341973] [2025-04-13 23:25:36,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:25:36,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:36,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 23:25:36,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:25:36,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:25:36,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:25:36,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:36,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628341973] [2025-04-13 23:25:36,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628341973] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:36,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317059714] [2025-04-13 23:25:36,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:25:36,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:36,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:36,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:36,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 23:25:36,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 23:25:36,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:25:36,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:25:36,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:36,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:25:36,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:36,832 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 23:25:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:25:36,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:36,890 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:25:36,890 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 81 treesize of output 73 [2025-04-13 23:25:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:25:36,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317059714] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:36,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:36,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2025-04-13 23:25:36,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044191131] [2025-04-13 23:25:36,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:36,999 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:36,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:37,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:37,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:37,000 INFO L87 Difference]: Start difference. First operand 103 states and 246 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:37,214 INFO L93 Difference]: Finished difference Result 142 states and 308 transitions. [2025-04-13 23:25:37,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:25:37,214 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 23:25:37,214 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:37,215 INFO L225 Difference]: With dead ends: 142 [2025-04-13 23:25:37,215 INFO L226 Difference]: Without dead ends: 137 [2025-04-13 23:25:37,215 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:25:37,216 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:37,216 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:25:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-04-13 23:25:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2025-04-13 23:25:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.394230769230769) internal successors, (249), 104 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 249 transitions. [2025-04-13 23:25:37,232 INFO L79 Accepts]: Start accepts. Automaton has 105 states and 249 transitions. Word has length 15 [2025-04-13 23:25:37,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:37,232 INFO L485 AbstractCegarLoop]: Abstraction has 105 states and 249 transitions. [2025-04-13 23:25:37,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:37,232 INFO L278 IsEmpty]: Start isEmpty. Operand 105 states and 249 transitions. [2025-04-13 23:25:37,232 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:25:37,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:37,232 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:37,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 23:25:37,437 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:37,437 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:37,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:37,437 INFO L85 PathProgramCache]: Analyzing trace with hash 791396021, now seen corresponding path program 2 times [2025-04-13 23:25:37,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:37,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131870202] [2025-04-13 23:25:37,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:25:37,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:37,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:37,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:37,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:25:37,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:37,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:37,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131870202] [2025-04-13 23:25:37,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131870202] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:37,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775991539] [2025-04-13 23:25:37,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:25:37,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:37,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:37,540 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:37,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 23:25:37,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:37,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:37,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:25:37,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:37,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:25:37,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:37,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:37,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:37,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775991539] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:37,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:37,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 23:25:37,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479227736] [2025-04-13 23:25:37,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:37,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:25:37,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:37,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:25:37,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:25:37,767 INFO L87 Difference]: Start difference. First operand 105 states and 249 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:38,347 INFO L93 Difference]: Finished difference Result 210 states and 475 transitions. [2025-04-13 23:25:38,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:25:38,348 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:25:38,348 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:38,349 INFO L225 Difference]: With dead ends: 210 [2025-04-13 23:25:38,349 INFO L226 Difference]: Without dead ends: 205 [2025-04-13 23:25:38,349 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:25:38,349 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:38,350 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:25:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-04-13 23:25:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 119. [2025-04-13 23:25:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 2.5) internal successors, (295), 118 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 295 transitions. [2025-04-13 23:25:38,367 INFO L79 Accepts]: Start accepts. Automaton has 119 states and 295 transitions. Word has length 16 [2025-04-13 23:25:38,368 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:38,368 INFO L485 AbstractCegarLoop]: Abstraction has 119 states and 295 transitions. [2025-04-13 23:25:38,368 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:38,368 INFO L278 IsEmpty]: Start isEmpty. Operand 119 states and 295 transitions. [2025-04-13 23:25:38,368 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:25:38,368 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:38,368 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:38,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 23:25:38,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:38,573 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:38,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:38,573 INFO L85 PathProgramCache]: Analyzing trace with hash -926947685, now seen corresponding path program 3 times [2025-04-13 23:25:38,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:38,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808455390] [2025-04-13 23:25:38,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:25:38,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:38,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:38,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:38,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:25:38,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:38,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:38,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808455390] [2025-04-13 23:25:38,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808455390] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:38,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110548303] [2025-04-13 23:25:38,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:25:38,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:38,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:38,700 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:38,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 23:25:38,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:38,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:38,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:25:38,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:38,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:25:38,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:38,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:38,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110548303] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:38,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:38,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 23:25:38,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895137001] [2025-04-13 23:25:38,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:38,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:25:38,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:38,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:25:38,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:25:38,913 INFO L87 Difference]: Start difference. First operand 119 states and 295 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:39,397 INFO L93 Difference]: Finished difference Result 271 states and 595 transitions. [2025-04-13 23:25:39,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:25:39,398 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:25:39,398 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:39,400 INFO L225 Difference]: With dead ends: 271 [2025-04-13 23:25:39,400 INFO L226 Difference]: Without dead ends: 266 [2025-04-13 23:25:39,400 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:39,400 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:39,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:25:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-04-13 23:25:39,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 125. [2025-04-13 23:25:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.596774193548387) internal successors, (322), 124 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 322 transitions. [2025-04-13 23:25:39,425 INFO L79 Accepts]: Start accepts. Automaton has 125 states and 322 transitions. Word has length 16 [2025-04-13 23:25:39,426 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:39,426 INFO L485 AbstractCegarLoop]: Abstraction has 125 states and 322 transitions. [2025-04-13 23:25:39,428 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:39,428 INFO L278 IsEmpty]: Start isEmpty. Operand 125 states and 322 transitions. [2025-04-13 23:25:39,428 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:25:39,428 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:39,428 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:39,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 23:25:39,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:39,629 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:39,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash -816125165, now seen corresponding path program 4 times [2025-04-13 23:25:39,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:39,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760766493] [2025-04-13 23:25:39,630 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:25:39,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:39,636 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:39,646 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:39,646 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:25:39,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:39,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:39,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760766493] [2025-04-13 23:25:39,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760766493] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:39,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968836921] [2025-04-13 23:25:39,755 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:25:39,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:39,757 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:39,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 23:25:39,798 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:39,836 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:39,836 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:25:39,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:39,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:25:39,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:39,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:39,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968836921] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:39,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:39,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 23:25:39,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63073542] [2025-04-13 23:25:39,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:39,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:25:39,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:39,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:25:39,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:25:39,960 INFO L87 Difference]: Start difference. First operand 125 states and 322 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:40,321 INFO L93 Difference]: Finished difference Result 249 states and 575 transitions. [2025-04-13 23:25:40,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:25:40,321 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:25:40,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:40,323 INFO L225 Difference]: With dead ends: 249 [2025-04-13 23:25:40,323 INFO L226 Difference]: Without dead ends: 235 [2025-04-13 23:25:40,323 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:25:40,323 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:40,324 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:25:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-04-13 23:25:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 123. [2025-04-13 23:25:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.5491803278688523) internal successors, (311), 122 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 311 transitions. [2025-04-13 23:25:40,340 INFO L79 Accepts]: Start accepts. Automaton has 123 states and 311 transitions. Word has length 16 [2025-04-13 23:25:40,340 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:40,340 INFO L485 AbstractCegarLoop]: Abstraction has 123 states and 311 transitions. [2025-04-13 23:25:40,341 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:40,341 INFO L278 IsEmpty]: Start isEmpty. Operand 123 states and 311 transitions. [2025-04-13 23:25:40,341 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:25:40,341 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:40,341 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:40,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 23:25:40,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:40,542 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:40,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:40,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1946485487, now seen corresponding path program 5 times [2025-04-13 23:25:40,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:40,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504194561] [2025-04-13 23:25:40,542 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:25:40,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:40,547 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:40,552 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:40,553 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:25:40,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:40,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504194561] [2025-04-13 23:25:40,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504194561] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:40,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70186411] [2025-04-13 23:25:40,643 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:25:40,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:40,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:40,645 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:40,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 23:25:40,681 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:40,717 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:40,717 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:25:40,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:40,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:25:40,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:40,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:40,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70186411] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:40,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:40,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 23:25:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655616544] [2025-04-13 23:25:40,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:40,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:25:40,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:40,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:25:40,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:25:40,845 INFO L87 Difference]: Start difference. First operand 123 states and 311 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:41,252 INFO L93 Difference]: Finished difference Result 218 states and 524 transitions. [2025-04-13 23:25:41,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:25:41,253 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:25:41,253 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:41,254 INFO L225 Difference]: With dead ends: 218 [2025-04-13 23:25:41,254 INFO L226 Difference]: Without dead ends: 213 [2025-04-13 23:25:41,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-04-13 23:25:41,254 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:41,255 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:25:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-04-13 23:25:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 135. [2025-04-13 23:25:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.6492537313432836) internal successors, (355), 134 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 355 transitions. [2025-04-13 23:25:41,276 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 355 transitions. Word has length 16 [2025-04-13 23:25:41,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:41,276 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 355 transitions. [2025-04-13 23:25:41,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:41,277 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 355 transitions. [2025-04-13 23:25:41,277 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:25:41,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:41,277 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:41,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 23:25:41,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 23:25:41,478 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:41,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash 630138103, now seen corresponding path program 6 times [2025-04-13 23:25:41,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:41,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009552221] [2025-04-13 23:25:41,478 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:25:41,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:41,483 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:41,493 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:41,493 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:25:41,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:41,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:41,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009552221] [2025-04-13 23:25:41,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009552221] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:41,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542138387] [2025-04-13 23:25:41,593 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:25:41,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:41,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:41,595 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:41,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 23:25:41,633 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:41,699 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:41,699 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:25:41,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:41,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:25:41,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:41,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:41,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542138387] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:41,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:41,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 23:25:41,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908896105] [2025-04-13 23:25:41,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:41,834 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:25:41,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:41,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:25:41,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:25:41,834 INFO L87 Difference]: Start difference. First operand 135 states and 355 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:42,167 INFO L93 Difference]: Finished difference Result 259 states and 608 transitions. [2025-04-13 23:25:42,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:25:42,167 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:25:42,168 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:42,169 INFO L225 Difference]: With dead ends: 259 [2025-04-13 23:25:42,169 INFO L226 Difference]: Without dead ends: 254 [2025-04-13 23:25:42,169 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2025-04-13 23:25:42,170 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:42,170 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:25:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-04-13 23:25:42,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 143. [2025-04-13 23:25:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.7535211267605635) internal successors, (391), 142 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 391 transitions. [2025-04-13 23:25:42,191 INFO L79 Accepts]: Start accepts. Automaton has 143 states and 391 transitions. Word has length 16 [2025-04-13 23:25:42,191 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:42,191 INFO L485 AbstractCegarLoop]: Abstraction has 143 states and 391 transitions. [2025-04-13 23:25:42,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:42,191 INFO L278 IsEmpty]: Start isEmpty. Operand 143 states and 391 transitions. [2025-04-13 23:25:42,192 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:25:42,192 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:42,192 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:42,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 23:25:42,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 23:25:42,392 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:42,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash 740960623, now seen corresponding path program 7 times [2025-04-13 23:25:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:42,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067327078] [2025-04-13 23:25:42,393 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:25:42,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:42,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:25:42,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:42,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:42,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:42,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:42,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067327078] [2025-04-13 23:25:42,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067327078] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:42,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514611657] [2025-04-13 23:25:42,471 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:25:42,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:42,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:42,473 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:42,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 23:25:42,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:25:42,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:42,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:42,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:42,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:25:42,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:42,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:42,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514611657] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:42,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:42,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 23:25:42,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733249018] [2025-04-13 23:25:42,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:42,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:25:42,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:42,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:25:42,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:25:42,668 INFO L87 Difference]: Start difference. First operand 143 states and 391 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:42,984 INFO L93 Difference]: Finished difference Result 241 states and 599 transitions. [2025-04-13 23:25:42,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:25:42,985 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:25:42,985 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:42,986 INFO L225 Difference]: With dead ends: 241 [2025-04-13 23:25:42,986 INFO L226 Difference]: Without dead ends: 230 [2025-04-13 23:25:42,986 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-04-13 23:25:42,987 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:42,987 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:25:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-04-13 23:25:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 139. [2025-04-13 23:25:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.7028985507246377) internal successors, (373), 138 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 373 transitions. [2025-04-13 23:25:43,008 INFO L79 Accepts]: Start accepts. Automaton has 139 states and 373 transitions. Word has length 16 [2025-04-13 23:25:43,008 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:43,008 INFO L485 AbstractCegarLoop]: Abstraction has 139 states and 373 transitions. [2025-04-13 23:25:43,008 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:43,008 INFO L278 IsEmpty]: Start isEmpty. Operand 139 states and 373 transitions. [2025-04-13 23:25:43,009 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:25:43,009 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:43,009 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:43,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 23:25:43,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 23:25:43,210 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:43,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash -243602577, now seen corresponding path program 8 times [2025-04-13 23:25:43,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:43,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872230563] [2025-04-13 23:25:43,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:25:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:43,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:43,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:43,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:25:43,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:43,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:43,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872230563] [2025-04-13 23:25:43,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872230563] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:43,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356136961] [2025-04-13 23:25:43,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:25:43,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:43,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:43,303 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:43,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 23:25:43,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:43,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:43,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:25:43,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:43,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:25:43,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:43,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:43,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356136961] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:43,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:43,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 23:25:43,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805232276] [2025-04-13 23:25:43,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:43,476 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:25:43,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:43,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:25:43,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:25:43,477 INFO L87 Difference]: Start difference. First operand 139 states and 373 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:43,803 INFO L93 Difference]: Finished difference Result 290 states and 723 transitions. [2025-04-13 23:25:43,804 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:25:43,804 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:25:43,804 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:43,805 INFO L225 Difference]: With dead ends: 290 [2025-04-13 23:25:43,805 INFO L226 Difference]: Without dead ends: 285 [2025-04-13 23:25:43,806 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:25:43,806 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:43,806 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:25:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-04-13 23:25:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 145. [2025-04-13 23:25:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.75) internal successors, (396), 144 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 396 transitions. [2025-04-13 23:25:43,829 INFO L79 Accepts]: Start accepts. Automaton has 145 states and 396 transitions. Word has length 16 [2025-04-13 23:25:43,829 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:43,829 INFO L485 AbstractCegarLoop]: Abstraction has 145 states and 396 transitions. [2025-04-13 23:25:43,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:43,830 INFO L278 IsEmpty]: Start isEmpty. Operand 145 states and 396 transitions. [2025-04-13 23:25:43,830 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:25:43,830 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:43,830 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:43,836 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 23:25:44,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 23:25:44,031 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:44,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:44,031 INFO L85 PathProgramCache]: Analyzing trace with hash -132780057, now seen corresponding path program 9 times [2025-04-13 23:25:44,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:44,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951606356] [2025-04-13 23:25:44,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:25:44,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:44,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:44,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:44,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:25:44,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:44,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:44,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951606356] [2025-04-13 23:25:44,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951606356] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:44,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074922806] [2025-04-13 23:25:44,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:25:44,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:44,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:44,134 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:44,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 23:25:44,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:44,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:44,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:25:44,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:44,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:25:44,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:44,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:44,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:44,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074922806] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:44,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:44,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 23:25:44,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116171040] [2025-04-13 23:25:44,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:44,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:25:44,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:44,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:25:44,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:25:44,339 INFO L87 Difference]: Start difference. First operand 145 states and 396 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:44,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:44,721 INFO L93 Difference]: Finished difference Result 339 states and 850 transitions. [2025-04-13 23:25:44,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:25:44,721 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:25:44,721 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:44,723 INFO L225 Difference]: With dead ends: 339 [2025-04-13 23:25:44,723 INFO L226 Difference]: Without dead ends: 328 [2025-04-13 23:25:44,723 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:25:44,723 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:44,723 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:25:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-04-13 23:25:44,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 143. [2025-04-13 23:25:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.7253521126760565) internal successors, (387), 142 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 387 transitions. [2025-04-13 23:25:44,748 INFO L79 Accepts]: Start accepts. Automaton has 143 states and 387 transitions. Word has length 16 [2025-04-13 23:25:44,748 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:44,748 INFO L485 AbstractCegarLoop]: Abstraction has 143 states and 387 transitions. [2025-04-13 23:25:44,748 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:44,748 INFO L278 IsEmpty]: Start isEmpty. Operand 143 states and 387 transitions. [2025-04-13 23:25:44,748 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:25:44,748 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:44,748 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:44,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 23:25:44,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 23:25:44,949 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:44,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:44,949 INFO L85 PathProgramCache]: Analyzing trace with hash -133374703, now seen corresponding path program 10 times [2025-04-13 23:25:44,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:44,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769705211] [2025-04-13 23:25:44,949 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:25:44,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:44,953 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:44,963 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:44,963 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:25:44,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:45,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:45,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769705211] [2025-04-13 23:25:45,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769705211] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:45,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082391135] [2025-04-13 23:25:45,022 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:25:45,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:45,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:45,024 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:45,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 23:25:45,064 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:45,101 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:45,101 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:25:45,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:45,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:25:45,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:45,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:45,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082391135] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:45,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:45,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 23:25:45,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594145855] [2025-04-13 23:25:45,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:45,196 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:25:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:45,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:25:45,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:25:45,196 INFO L87 Difference]: Start difference. First operand 143 states and 387 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:45,539 INFO L93 Difference]: Finished difference Result 283 states and 706 transitions. [2025-04-13 23:25:45,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:25:45,539 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:25:45,539 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:45,541 INFO L225 Difference]: With dead ends: 283 [2025-04-13 23:25:45,541 INFO L226 Difference]: Without dead ends: 278 [2025-04-13 23:25:45,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:25:45,543 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:45,543 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:25:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-04-13 23:25:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 145. [2025-04-13 23:25:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.7083333333333335) internal successors, (390), 144 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 390 transitions. [2025-04-13 23:25:45,582 INFO L79 Accepts]: Start accepts. Automaton has 145 states and 390 transitions. Word has length 16 [2025-04-13 23:25:45,582 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:45,582 INFO L485 AbstractCegarLoop]: Abstraction has 145 states and 390 transitions. [2025-04-13 23:25:45,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:45,582 INFO L278 IsEmpty]: Start isEmpty. Operand 145 states and 390 transitions. [2025-04-13 23:25:45,583 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:25:45,583 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:45,583 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:45,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 23:25:45,783 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 23:25:45,783 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:45,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:45,784 INFO L85 PathProgramCache]: Analyzing trace with hash -826235493, now seen corresponding path program 4 times [2025-04-13 23:25:45,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:45,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118627815] [2025-04-13 23:25:45,784 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:25:45,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:45,788 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:45,794 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:45,794 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:25:45,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:25:45,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:45,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118627815] [2025-04-13 23:25:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118627815] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:45,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95851895] [2025-04-13 23:25:45,880 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:25:45,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:45,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:45,882 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:45,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 23:25:45,920 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:45,932 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:45,933 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:25:45,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:45,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 23:25:45,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:45,958 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 23:25:46,121 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 23:25:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:46,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:46,431 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-13 23:25:46,442 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 23:25:46,442 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 62 treesize of output 41 [2025-04-13 23:25:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:46,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95851895] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:46,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:46,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2025-04-13 23:25:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696236837] [2025-04-13 23:25:46,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:46,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 23:25:46,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:46,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 23:25:46,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:25:46,476 INFO L87 Difference]: Start difference. First operand 145 states and 390 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 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 23:25:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:48,125 INFO L93 Difference]: Finished difference Result 377 states and 898 transitions. [2025-04-13 23:25:48,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 23:25:48,125 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 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 16 [2025-04-13 23:25:48,125 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:48,126 INFO L225 Difference]: With dead ends: 377 [2025-04-13 23:25:48,126 INFO L226 Difference]: Without dead ends: 233 [2025-04-13 23:25:48,127 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=546, Invalid=2534, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 23:25:48,127 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 289 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:48,127 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 0 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-04-13 23:25:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 125. [2025-04-13 23:25:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.629032258064516) internal successors, (326), 124 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 326 transitions. [2025-04-13 23:25:48,155 INFO L79 Accepts]: Start accepts. Automaton has 125 states and 326 transitions. Word has length 16 [2025-04-13 23:25:48,155 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:48,156 INFO L485 AbstractCegarLoop]: Abstraction has 125 states and 326 transitions. [2025-04-13 23:25:48,156 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 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 23:25:48,156 INFO L278 IsEmpty]: Start isEmpty. Operand 125 states and 326 transitions. [2025-04-13 23:25:48,156 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:25:48,156 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:48,156 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:48,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 23:25:48,356 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:48,357 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:48,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:48,357 INFO L85 PathProgramCache]: Analyzing trace with hash 614189553, now seen corresponding path program 5 times [2025-04-13 23:25:48,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:48,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696544720] [2025-04-13 23:25:48,357 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:25:48,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:48,361 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:48,367 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:48,368 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:25:48,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:25:48,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:48,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696544720] [2025-04-13 23:25:48,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696544720] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:48,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969902728] [2025-04-13 23:25:48,427 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:25:48,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:48,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:48,429 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:48,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 23:25:48,469 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:25:48,482 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:25:48,482 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:25:48,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:48,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:25:48,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:48,503 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 23:25:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:48,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:48,849 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 116 [2025-04-13 23:25:48,872 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:25:48,872 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 240 [2025-04-13 23:25:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:49,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969902728] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:49,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:49,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-04-13 23:25:49,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552567979] [2025-04-13 23:25:49,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:49,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 23:25:49,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:49,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 23:25:49,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:25:49,512 INFO L87 Difference]: Start difference. First operand 125 states and 326 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:50,036 INFO L93 Difference]: Finished difference Result 208 states and 485 transitions. [2025-04-13 23:25:50,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 23:25:50,036 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:25:50,036 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:50,037 INFO L225 Difference]: With dead ends: 208 [2025-04-13 23:25:50,037 INFO L226 Difference]: Without dead ends: 154 [2025-04-13 23:25:50,038 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 23:25:50,038 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:50,038 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:25:50,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-04-13 23:25:50,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 116. [2025-04-13 23:25:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.747826086956522) internal successors, (316), 115 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 316 transitions. [2025-04-13 23:25:50,062 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 316 transitions. Word has length 16 [2025-04-13 23:25:50,062 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:50,062 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 316 transitions. [2025-04-13 23:25:50,062 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:50,062 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 316 transitions. [2025-04-13 23:25:50,062 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:25:50,062 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:50,062 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:50,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 23:25:50,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:50,263 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:25:50,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:50,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2055595050, now seen corresponding path program 11 times [2025-04-13 23:25:50,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:50,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982561840] [2025-04-13 23:25:50,263 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:25:50,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:50,267 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:25:50,276 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:25:50,276 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:25:50,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:50,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:50,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982561840] [2025-04-13 23:25:50,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982561840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:50,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821789213] [2025-04-13 23:25:50,390 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:25:50,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:50,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:50,392 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:25:50,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 23:25:50,437 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:25:50,460 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:25:50,460 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:25:50,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:50,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 23:25:50,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:50,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:50,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821789213] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:50,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:50,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 23:25:50,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11043781] [2025-04-13 23:25:50,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:50,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:50,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:50,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:50,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:50,587 INFO L87 Difference]: Start difference. First operand 116 states and 316 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:59,387 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 26 DAG size of output: 26 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:25:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:59,859 INFO L93 Difference]: Finished difference Result 200 states and 477 transitions. [2025-04-13 23:25:59,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 23:25:59,859 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:25:59,859 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:59,860 INFO L225 Difference]: With dead ends: 200 [2025-04-13 23:25:59,860 INFO L226 Difference]: Without dead ends: 195 [2025-04-13 23:25:59,861 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=246, Invalid=624, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:25:59,861 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:59,861 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:25:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-13 23:25:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 133. [2025-04-13 23:25:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.621212121212121) internal successors, (346), 132 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 346 transitions. [2025-04-13 23:25:59,896 INFO L79 Accepts]: Start accepts. Automaton has 133 states and 346 transitions. Word has length 17 [2025-04-13 23:25:59,896 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:59,896 INFO L485 AbstractCegarLoop]: Abstraction has 133 states and 346 transitions. [2025-04-13 23:25:59,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:59,896 INFO L278 IsEmpty]: Start isEmpty. Operand 133 states and 346 transitions. [2025-04-13 23:25:59,896 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:25:59,896 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:59,896 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:59,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 23:26:00,097 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:00,098 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:26:00,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:00,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1414673266, now seen corresponding path program 1 times [2025-04-13 23:26:00,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:00,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129926858] [2025-04-13 23:26:00,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:26:00,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:00,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 23:26:00,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:00,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:26:00,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:00,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:00,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:00,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129926858] [2025-04-13 23:26:00,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129926858] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:26:00,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604736198] [2025-04-13 23:26:00,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:26:00,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:00,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:26:00,212 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:26:00,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 23:26:00,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 23:26:00,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:00,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:26:00,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:00,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:26:00,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:26:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:00,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:26:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:00,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604736198] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:26:00,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:26:00,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2025-04-13 23:26:00,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313405299] [2025-04-13 23:26:00,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:26:00,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:26:00,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:00,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:26:00,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:26:00,421 INFO L87 Difference]: Start difference. First operand 133 states and 346 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:00,732 INFO L93 Difference]: Finished difference Result 181 states and 442 transitions. [2025-04-13 23:26:00,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:26:00,732 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:26:00,732 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:00,733 INFO L225 Difference]: With dead ends: 181 [2025-04-13 23:26:00,733 INFO L226 Difference]: Without dead ends: 153 [2025-04-13 23:26:00,733 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:26:00,734 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:00,734 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:26:00,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-04-13 23:26:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 131. [2025-04-13 23:26:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 2.6615384615384614) internal successors, (346), 130 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 346 transitions. [2025-04-13 23:26:00,767 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 346 transitions. Word has length 17 [2025-04-13 23:26:00,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:00,767 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 346 transitions. [2025-04-13 23:26:00,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:00,767 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 346 transitions. [2025-04-13 23:26:00,771 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:26:00,771 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:00,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:00,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 23:26:00,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:00,972 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:26:00,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:00,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1581272040, now seen corresponding path program 6 times [2025-04-13 23:26:00,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:00,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118021541] [2025-04-13 23:26:00,972 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:26:00,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:00,977 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:26:00,984 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:00,985 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:26:00,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:01,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:01,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118021541] [2025-04-13 23:26:01,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118021541] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:26:01,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261756546] [2025-04-13 23:26:01,065 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:26:01,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:01,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:26:01,066 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:26:01,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 23:26:01,103 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:26:01,126 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:01,126 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:26:01,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:01,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:26:01,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:26:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:01,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:26:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:01,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261756546] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:26:01,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:26:01,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2025-04-13 23:26:01,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763056703] [2025-04-13 23:26:01,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:26:01,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:01,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:01,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:01,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:01,256 INFO L87 Difference]: Start difference. First operand 131 states and 346 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:01,691 INFO L93 Difference]: Finished difference Result 239 states and 583 transitions. [2025-04-13 23:26:01,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:26:01,692 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:26:01,692 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:01,693 INFO L225 Difference]: With dead ends: 239 [2025-04-13 23:26:01,693 INFO L226 Difference]: Without dead ends: 229 [2025-04-13 23:26:01,693 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:26:01,694 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:01,694 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:26:01,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-04-13 23:26:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 131. [2025-04-13 23:26:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 2.6615384615384614) internal successors, (346), 130 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 346 transitions. [2025-04-13 23:26:01,731 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 346 transitions. Word has length 17 [2025-04-13 23:26:01,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:01,731 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 346 transitions. [2025-04-13 23:26:01,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:01,731 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 346 transitions. [2025-04-13 23:26:01,732 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:26:01,732 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:01,732 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:01,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 23:26:01,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:01,932 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:26:01,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1268972182, now seen corresponding path program 7 times [2025-04-13 23:26:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:01,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216647526] [2025-04-13 23:26:01,933 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:26:01,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:01,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 23:26:01,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:01,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:26:01,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:02,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:02,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216647526] [2025-04-13 23:26:02,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216647526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:26:02,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150598546] [2025-04-13 23:26:02,036 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:26:02,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:02,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:26:02,037 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 23:26:02,039 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 23:26:02,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 23:26:02,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:02,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:26:02,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:02,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 23:26:02,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:26:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:02,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:26:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:02,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150598546] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:26:02,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:26:02,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 14 [2025-04-13 23:26:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742240390] [2025-04-13 23:26:02,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:26:02,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:02,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:02,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:02,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:02,259 INFO L87 Difference]: Start difference. First operand 131 states and 346 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:07,170 INFO L93 Difference]: Finished difference Result 224 states and 530 transitions. [2025-04-13 23:26:07,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 23:26:07,170 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:26:07,170 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:07,171 INFO L225 Difference]: With dead ends: 224 [2025-04-13 23:26:07,171 INFO L226 Difference]: Without dead ends: 215 [2025-04-13 23:26:07,172 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:26:07,172 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:07,172 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:26:07,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-04-13 23:26:07,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 133. [2025-04-13 23:26:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.6742424242424243) internal successors, (353), 132 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 353 transitions. [2025-04-13 23:26:07,212 INFO L79 Accepts]: Start accepts. Automaton has 133 states and 353 transitions. Word has length 17 [2025-04-13 23:26:07,212 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:07,212 INFO L485 AbstractCegarLoop]: Abstraction has 133 states and 353 transitions. [2025-04-13 23:26:07,212 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:07,212 INFO L278 IsEmpty]: Start isEmpty. Operand 133 states and 353 transitions. [2025-04-13 23:26:07,212 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:26:07,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:07,212 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:07,219 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 23:26:07,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:07,413 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:26:07,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:07,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1371799344, now seen corresponding path program 8 times [2025-04-13 23:26:07,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:07,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786179427] [2025-04-13 23:26:07,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:26:07,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:07,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:26:07,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:07,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:26:07,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:07,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:07,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786179427] [2025-04-13 23:26:07,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786179427] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:26:07,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332709926] [2025-04-13 23:26:07,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:26:07,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:07,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:26:07,515 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 23:26:07,516 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 23:26:07,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:26:07,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:07,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:26:07,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:07,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:26:07,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:26:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:07,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:26:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:07,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332709926] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:26:07,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:26:07,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 11 [2025-04-13 23:26:07,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650727840] [2025-04-13 23:26:07,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:26:07,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:26:07,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:07,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:26:07,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:26:07,722 INFO L87 Difference]: Start difference. First operand 133 states and 353 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:08,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:08,419 INFO L93 Difference]: Finished difference Result 239 states and 541 transitions. [2025-04-13 23:26:08,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:26:08,420 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:26:08,420 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:08,421 INFO L225 Difference]: With dead ends: 239 [2025-04-13 23:26:08,421 INFO L226 Difference]: Without dead ends: 226 [2025-04-13 23:26:08,421 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:26:08,422 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:08,422 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:26:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-04-13 23:26:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 125. [2025-04-13 23:26:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.6370967741935485) internal successors, (327), 124 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 327 transitions. [2025-04-13 23:26:08,464 INFO L79 Accepts]: Start accepts. Automaton has 125 states and 327 transitions. Word has length 17 [2025-04-13 23:26:08,464 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:08,464 INFO L485 AbstractCegarLoop]: Abstraction has 125 states and 327 transitions. [2025-04-13 23:26:08,464 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:08,464 INFO L278 IsEmpty]: Start isEmpty. Operand 125 states and 327 transitions. [2025-04-13 23:26:08,464 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:26:08,464 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:08,465 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:08,474 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 23:26:08,665 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-13 23:26:08,665 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:26:08,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:08,666 INFO L85 PathProgramCache]: Analyzing trace with hash -413400568, now seen corresponding path program 9 times [2025-04-13 23:26:08,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:08,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553214686] [2025-04-13 23:26:08,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:26:08,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:08,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:26:08,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:08,675 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:26:08,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:08,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:08,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553214686] [2025-04-13 23:26:08,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553214686] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:26:08,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821755879] [2025-04-13 23:26:08,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:26:08,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:08,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:26:08,765 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 23:26:08,765 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 23:26:08,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:26:08,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:08,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:26:08,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:08,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:26:08,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:26:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:08,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:26:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:09,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821755879] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:26:09,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:26:09,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-04-13 23:26:09,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411289904] [2025-04-13 23:26:09,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:26:09,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:26:09,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:09,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:26:09,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:26:09,008 INFO L87 Difference]: Start difference. First operand 125 states and 327 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:09,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:09,505 INFO L93 Difference]: Finished difference Result 176 states and 413 transitions. [2025-04-13 23:26:09,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:09,505 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:26:09,505 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:09,506 INFO L225 Difference]: With dead ends: 176 [2025-04-13 23:26:09,506 INFO L226 Difference]: Without dead ends: 165 [2025-04-13 23:26:09,507 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-04-13 23:26:09,507 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:09,507 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:26:09,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-04-13 23:26:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 127. [2025-04-13 23:26:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.619047619047619) internal successors, (330), 126 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 330 transitions. [2025-04-13 23:26:09,548 INFO L79 Accepts]: Start accepts. Automaton has 127 states and 330 transitions. Word has length 17 [2025-04-13 23:26:09,548 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:09,548 INFO L485 AbstractCegarLoop]: Abstraction has 127 states and 330 transitions. [2025-04-13 23:26:09,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:09,548 INFO L278 IsEmpty]: Start isEmpty. Operand 127 states and 330 transitions. [2025-04-13 23:26:09,548 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:26:09,548 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:09,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:09,554 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 23:26:09,749 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-13 23:26:09,749 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:26:09,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash -346780172, now seen corresponding path program 10 times [2025-04-13 23:26:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:09,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91023063] [2025-04-13 23:26:09,749 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:26:09,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:09,753 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:26:09,758 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:09,758 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:26:09,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:09,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:09,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91023063] [2025-04-13 23:26:09,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91023063] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:26:09,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007043753] [2025-04-13 23:26:09,874 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:26:09,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:09,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:26:09,877 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:26:09,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 23:26:09,920 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:26:09,945 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:09,945 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:26:09,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:09,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:26:09,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:26:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:09,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:26:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:10,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007043753] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:26:10,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:26:10,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-04-13 23:26:10,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836880766] [2025-04-13 23:26:10,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:26:10,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:26:10,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:10,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:26:10,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:26:10,085 INFO L87 Difference]: Start difference. First operand 127 states and 330 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:11,974 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:26:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:12,019 INFO L93 Difference]: Finished difference Result 214 states and 492 transitions. [2025-04-13 23:26:12,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:26:12,019 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:26:12,019 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:12,020 INFO L225 Difference]: With dead ends: 214 [2025-04-13 23:26:12,020 INFO L226 Difference]: Without dead ends: 207 [2025-04-13 23:26:12,020 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-04-13 23:26:12,021 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:12,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:26:12,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-04-13 23:26:12,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 129. [2025-04-13 23:26:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.6328125) internal successors, (337), 128 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 337 transitions. [2025-04-13 23:26:12,066 INFO L79 Accepts]: Start accepts. Automaton has 129 states and 337 transitions. Word has length 17 [2025-04-13 23:26:12,066 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:12,066 INFO L485 AbstractCegarLoop]: Abstraction has 129 states and 337 transitions. [2025-04-13 23:26:12,066 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:12,066 INFO L278 IsEmpty]: Start isEmpty. Operand 129 states and 337 transitions. [2025-04-13 23:26:12,066 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:26:12,066 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:12,066 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:12,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-13 23:26:12,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 23:26:12,267 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:26:12,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:12,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1954301358, now seen corresponding path program 11 times [2025-04-13 23:26:12,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:12,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772151694] [2025-04-13 23:26:12,267 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:26:12,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:12,271 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:26:12,275 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:12,275 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:26:12,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:12,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:12,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772151694] [2025-04-13 23:26:12,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772151694] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:26:12,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220734925] [2025-04-13 23:26:12,342 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:26:12,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:12,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:26:12,343 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:26:12,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 23:26:12,389 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:26:12,420 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:12,420 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:26:12,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:12,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:26:12,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:26:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:12,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:26:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:12,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220734925] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:26:12,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:26:12,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 23:26:12,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274946850] [2025-04-13 23:26:12,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:26:12,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:26:12,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:12,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:26:12,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:26:12,546 INFO L87 Difference]: Start difference. First operand 129 states and 337 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:16,868 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:26:16,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:16,936 INFO L93 Difference]: Finished difference Result 170 states and 411 transitions. [2025-04-13 23:26:16,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:26:16,936 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:26:16,936 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:16,937 INFO L225 Difference]: With dead ends: 170 [2025-04-13 23:26:16,937 INFO L226 Difference]: Without dead ends: 157 [2025-04-13 23:26:16,937 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-04-13 23:26:16,937 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:16,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-04-13 23:26:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-13 23:26:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 129. [2025-04-13 23:26:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.6015625) internal successors, (333), 128 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 333 transitions. [2025-04-13 23:26:16,980 INFO L79 Accepts]: Start accepts. Automaton has 129 states and 333 transitions. Word has length 17 [2025-04-13 23:26:16,980 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:16,980 INFO L485 AbstractCegarLoop]: Abstraction has 129 states and 333 transitions. [2025-04-13 23:26:16,980 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:16,980 INFO L278 IsEmpty]: Start isEmpty. Operand 129 states and 333 transitions. [2025-04-13 23:26:16,981 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:26:16,981 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:16,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:16,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-13 23:26:17,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:17,181 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:26:17,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash 611618604, now seen corresponding path program 12 times [2025-04-13 23:26:17,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:17,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854222557] [2025-04-13 23:26:17,182 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:26:17,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:17,185 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:26:17,190 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:17,190 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:26:17,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:17,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:17,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854222557] [2025-04-13 23:26:17,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854222557] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:26:17,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598475932] [2025-04-13 23:26:17,282 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:26:17,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:17,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:26:17,284 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:26:17,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 23:26:17,328 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:26:17,355 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:17,355 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:26:17,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:17,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 23:26:17,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:26:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:17,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:26:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:17,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598475932] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:26:17,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:26:17,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2025-04-13 23:26:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332025136] [2025-04-13 23:26:17,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:26:17,533 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:26:17,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:17,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:26:17,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:26:17,533 INFO L87 Difference]: Start difference. First operand 129 states and 333 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:21,719 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:26:25,830 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:26:25,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:25,992 INFO L93 Difference]: Finished difference Result 187 states and 457 transitions. [2025-04-13 23:26:25,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:26:25,992 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:26:25,992 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:25,993 INFO L225 Difference]: With dead ends: 187 [2025-04-13 23:26:25,993 INFO L226 Difference]: Without dead ends: 176 [2025-04-13 23:26:25,994 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-04-13 23:26:25,994 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:25,994 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-04-13 23:26:25,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-04-13 23:26:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 127. [2025-04-13 23:26:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.5714285714285716) internal successors, (324), 126 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:26,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 324 transitions. [2025-04-13 23:26:26,038 INFO L79 Accepts]: Start accepts. Automaton has 127 states and 324 transitions. Word has length 17 [2025-04-13 23:26:26,038 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:26,038 INFO L485 AbstractCegarLoop]: Abstraction has 127 states and 324 transitions. [2025-04-13 23:26:26,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:26,038 INFO L278 IsEmpty]: Start isEmpty. Operand 127 states and 324 transitions. [2025-04-13 23:26:26,038 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:26:26,038 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:26,038 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:26,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-13 23:26:26,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 23:26:26,239 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:26:26,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:26,239 INFO L85 PathProgramCache]: Analyzing trace with hash 40163798, now seen corresponding path program 13 times [2025-04-13 23:26:26,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:26,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858316593] [2025-04-13 23:26:26,239 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:26:26,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:26,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 23:26:26,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:26,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:26:26,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:26,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:26,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858316593] [2025-04-13 23:26:26,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858316593] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:26:26,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967391774] [2025-04-13 23:26:26,303 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:26:26,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:26,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:26:26,305 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:26:26,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 23:26:26,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 23:26:26,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:26:26,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:26:26,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:26,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:26:26,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:26:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:26,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:26:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:26,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967391774] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:26:26,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:26:26,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 14 [2025-04-13 23:26:26,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537371549] [2025-04-13 23:26:26,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:26:26,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:26,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:26,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:26,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:26,509 INFO L87 Difference]: Start difference. First operand 127 states and 324 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:26,770 INFO L93 Difference]: Finished difference Result 158 states and 370 transitions. [2025-04-13 23:26:26,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:26:26,770 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:26:26,770 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:26,771 INFO L225 Difference]: With dead ends: 158 [2025-04-13 23:26:26,771 INFO L226 Difference]: Without dead ends: 141 [2025-04-13 23:26:26,771 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:26:26,772 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:26,772 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:26:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-04-13 23:26:26,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 125. [2025-04-13 23:26:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.556451612903226) internal successors, (317), 124 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 317 transitions. [2025-04-13 23:26:26,817 INFO L79 Accepts]: Start accepts. Automaton has 125 states and 317 transitions. Word has length 17 [2025-04-13 23:26:26,817 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:26,817 INFO L485 AbstractCegarLoop]: Abstraction has 125 states and 317 transitions. [2025-04-13 23:26:26,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:26,817 INFO L278 IsEmpty]: Start isEmpty. Operand 125 states and 317 transitions. [2025-04-13 23:26:26,818 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:26:26,818 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:26,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:26,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-13 23:26:27,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 23:26:27,018 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:26:27,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:27,019 INFO L85 PathProgramCache]: Analyzing trace with hash 409652877, now seen corresponding path program 2 times [2025-04-13 23:26:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:27,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398205865] [2025-04-13 23:26:27,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:26:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:27,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:26:27,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:26:27,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:26:27,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:27,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:27,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398205865] [2025-04-13 23:26:27,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398205865] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:26:27,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008549780] [2025-04-13 23:26:27,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:26:27,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:27,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:26:27,781 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:26:27,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 23:26:27,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:26:27,833 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:26:27,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:26:27,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:27,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 23:26:27,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:26:28,112 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:26:28,112 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2025-04-13 23:26:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:26:28,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:26:28,428 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 23:26:28,428 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 23:26:28,487 INFO L325 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2025-04-13 23:26:28,487 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 61 [2025-04-13 23:26:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:26:28,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008549780] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:26:28,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:26:28,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 26 [2025-04-13 23:26:28,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431508086] [2025-04-13 23:26:28,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:26:28,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 23:26:28,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:28,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 23:26:28,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2025-04-13 23:26:28,541 INFO L87 Difference]: Start difference. First operand 125 states and 317 transitions. Second operand has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 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 23:26:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:29,723 INFO L93 Difference]: Finished difference Result 240 states and 570 transitions. [2025-04-13 23:26:29,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 23:26:29,723 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 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 18 [2025-04-13 23:26:29,723 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:29,724 INFO L225 Difference]: With dead ends: 240 [2025-04-13 23:26:29,724 INFO L226 Difference]: Without dead ends: 227 [2025-04-13 23:26:29,724 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=211, Invalid=1595, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 23:26:29,725 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 143 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:29,725 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 0 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-04-13 23:26:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2025-04-13 23:26:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.6056338028169015) internal successors, (370), 142 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 370 transitions. [2025-04-13 23:26:29,774 INFO L79 Accepts]: Start accepts. Automaton has 143 states and 370 transitions. Word has length 18 [2025-04-13 23:26:29,774 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:29,774 INFO L485 AbstractCegarLoop]: Abstraction has 143 states and 370 transitions. [2025-04-13 23:26:29,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 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 23:26:29,774 INFO L278 IsEmpty]: Start isEmpty. Operand 143 states and 370 transitions. [2025-04-13 23:26:29,775 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:26:29,775 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:29,775 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:29,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 23:26:29,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:29,975 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:26:29,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:29,976 INFO L85 PathProgramCache]: Analyzing trace with hash -537884009, now seen corresponding path program 14 times [2025-04-13 23:26:29,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:29,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838609358] [2025-04-13 23:26:29,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:26:29,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:29,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:26:29,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:26:29,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:26:29,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:26:30,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:30,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838609358] [2025-04-13 23:26:30,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838609358] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:26:30,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759714196] [2025-04-13 23:26:30,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:26:30,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:26:30,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:26:30,072 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:26:30,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 23:26:30,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:26:30,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:26:30,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:26:30,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:30,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 23:26:30,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:26:30,172 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 23:26:30,197 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 23:26:30,539 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-13 23:26:30,539 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 40 [2025-04-13 23:26:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:30,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:26:31,272 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 230 [2025-04-13 23:26:31,509 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:26:31,510 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 10365 treesize of output 8945 [2025-04-13 23:30:15,199 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 23:30:15,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-13 23:30:15,200 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 23:30:15,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-04-13 23:30:15,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:30:15,405 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2025-04-13 23:30:15,409 INFO L158 Benchmark]: Toolchain (without parser) took 286026.89ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 102.1MB in the beginning and 401.5MB in the end (delta: -299.4MB). Peak memory consumption was 647.3MB. Max. memory is 8.0GB. [2025-04-13 23:30:15,410 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:30:15,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.46ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 87.2MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 23:30:15,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.28ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.0MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:30:15,410 INFO L158 Benchmark]: Boogie Preprocessor took 32.24ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:30:15,410 INFO L158 Benchmark]: IcfgBuilder took 490.75ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 36.9MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-13 23:30:15,410 INFO L158 Benchmark]: TraceAbstraction took 285215.29ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 35.9MB in the beginning and 401.5MB in the end (delta: -365.6MB). Peak memory consumption was 580.2MB. Max. memory is 8.0GB. [2025-04-13 23:30:15,411 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.46ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 87.2MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.28ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.0MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.24ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 490.75ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 36.9MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 285215.29ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 35.9MB in the beginning and 401.5MB in the end (delta: -365.6MB). Peak memory consumption was 580.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...