/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/test-easy11.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:23:08,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:23:08,171 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:23:08,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:23:08,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:23:08,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:23:08,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:23:08,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:23:08,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:23:08,189 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:23:08,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:23:08,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:23:08,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:23:08,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:23:08,189 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:23:08,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:23:08,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:23:08,189 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:23:08,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:23:08,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:23:08,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:23:08,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:23:08,190 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:23:08,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:23:08,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:23:08,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:23:08,191 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:23:08,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:23:08,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:23:08,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:23:08,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:23:08,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:23:08,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:23:08,191 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:23:08,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:23:08,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:23:08,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:23:08,405 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:23:08,405 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:23:08,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c [2025-04-13 23:23:09,769 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde3cfb10/eab792d1b05b42fcad0ea34501c387b6/FLAG7ddb6ae9c [2025-04-13 23:23:09,984 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:23:09,987 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c [2025-04-13 23:23:09,996 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde3cfb10/eab792d1b05b42fcad0ea34501c387b6/FLAG7ddb6ae9c [2025-04-13 23:23:10,768 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde3cfb10/eab792d1b05b42fcad0ea34501c387b6 [2025-04-13 23:23:10,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:23:10,774 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:23:10,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:23:10,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:23:10,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:23:10,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:23:10" (1/1) ... [2025-04-13 23:23:10,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6504cb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:10, skipping insertion in model container [2025-04-13 23:23:10,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:23:10" (1/1) ... [2025-04-13 23:23:10,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:23:10,964 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/test-easy11.wvr.c[1841,1854] [2025-04-13 23:23:10,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:23:10,980 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:23:11,006 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/test-easy11.wvr.c[1841,1854] [2025-04-13 23:23:11,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:23:11,017 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:23:11,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:11 WrapperNode [2025-04-13 23:23:11,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:23:11,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:23:11,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:23:11,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:23:11,024 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:23:11" (1/1) ... [2025-04-13 23:23:11,032 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:23:11" (1/1) ... [2025-04-13 23:23:11,050 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 41 [2025-04-13 23:23:11,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:23:11,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:23:11,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:23:11,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:23:11,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:11" (1/1) ... [2025-04-13 23:23:11,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:11" (1/1) ... [2025-04-13 23:23:11,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:11" (1/1) ... [2025-04-13 23:23:11,073 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 23:23:11,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:11" (1/1) ... [2025-04-13 23:23:11,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:11" (1/1) ... [2025-04-13 23:23:11,077 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:11" (1/1) ... [2025-04-13 23:23:11,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:11" (1/1) ... [2025-04-13 23:23:11,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:11" (1/1) ... [2025-04-13 23:23:11,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:11" (1/1) ... [2025-04-13 23:23:11,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:23:11,082 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:23:11,082 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:23:11,082 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:23:11,086 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:11" (1/1) ... [2025-04-13 23:23:11,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:23:11,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:11,123 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:23:11,129 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:23:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:23:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:23:11,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:23:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:23:11,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:23:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:23:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:23:11,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:23:11,150 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:23:11,217 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:23:11,219 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:23:11,345 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:23:11,346 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:23:11,346 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:23:11,444 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:23:11,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:23:11 BoogieIcfgContainer [2025-04-13 23:23:11,445 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:23:11,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:23:11,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:23:11,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:23:11,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:23:10" (1/3) ... [2025-04-13 23:23:11,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38010101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:23:11, skipping insertion in model container [2025-04-13 23:23:11,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:11" (2/3) ... [2025-04-13 23:23:11,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38010101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:23:11, skipping insertion in model container [2025-04-13 23:23:11,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:23:11" (3/3) ... [2025-04-13 23:23:11,457 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy11.wvr.c [2025-04-13 23:23:11,467 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:23:11,468 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy11.wvr.c that has 3 procedures, 20 locations, 19 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 23:23:11,468 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:23:11,500 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 23:23:11,527 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions, 56 flow [2025-04-13 23:23:11,542 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 69 states, 68 states have (on average 2.338235294117647) internal successors, (159), 68 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have 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:23:11,561 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:23:11,571 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;@4c9b881, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:23:11,571 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:23:11,573 INFO L278 IsEmpty]: Start isEmpty. Operand has 69 states, 68 states have (on average 2.338235294117647) internal successors, (159), 68 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have 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:23:11,579 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:11,579 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:11,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:11,580 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:23:11,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:11,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1840740617, now seen corresponding path program 1 times [2025-04-13 23:23:11,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:11,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732625690] [2025-04-13 23:23:11,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:23:11,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:11,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:11,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:11,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:11,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:12,078 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:23:12,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:12,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732625690] [2025-04-13 23:23:12,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732625690] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:12,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:12,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:12,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859729666] [2025-04-13 23:23:12,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:12,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:12,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:12,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:12,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:12,105 INFO L87 Difference]: Start difference. First operand has 69 states, 68 states have (on average 2.338235294117647) internal successors, (159), 68 states have internal predecessors, (159), 0 states have call successors, (0), 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 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:12,392 INFO L93 Difference]: Finished difference Result 91 states and 201 transitions. [2025-04-13 23:23:12,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:12,394 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:12,394 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:12,399 INFO L225 Difference]: With dead ends: 91 [2025-04-13 23:23:12,399 INFO L226 Difference]: Without dead ends: 74 [2025-04-13 23:23:12,401 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:23:12,403 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 35 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:12,404 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 12 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:23:12,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-13 23:23:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-04-13 23:23:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.315068493150685) internal successors, (169), 73 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have 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:23:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 169 transitions. [2025-04-13 23:23:12,442 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 169 transitions. Word has length 16 [2025-04-13 23:23:12,442 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:12,442 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 169 transitions. [2025-04-13 23:23:12,442 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:12,442 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 169 transitions. [2025-04-13 23:23:12,443 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:12,443 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:12,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:12,443 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:23:12,444 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:23:12,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:12,444 INFO L85 PathProgramCache]: Analyzing trace with hash 505160325, now seen corresponding path program 2 times [2025-04-13 23:23:12,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:12,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094540429] [2025-04-13 23:23:12,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:12,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:12,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:12,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:12,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:12,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:12,634 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:23:12,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:12,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094540429] [2025-04-13 23:23:12,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094540429] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:12,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:12,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:12,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795656184] [2025-04-13 23:23:12,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:12,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:12,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:12,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:12,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:12,637 INFO L87 Difference]: Start difference. First operand 74 states and 169 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:12,859 INFO L93 Difference]: Finished difference Result 105 states and 233 transitions. [2025-04-13 23:23:12,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:12,859 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:12,859 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:12,860 INFO L225 Difference]: With dead ends: 105 [2025-04-13 23:23:12,860 INFO L226 Difference]: Without dead ends: 88 [2025-04-13 23:23:12,860 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:23:12,861 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:12,861 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 7 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:23:12,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-13 23:23:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2025-04-13 23:23:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 2.3466666666666667) internal successors, (176), 75 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 176 transitions. [2025-04-13 23:23:12,870 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 176 transitions. Word has length 16 [2025-04-13 23:23:12,870 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:12,870 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 176 transitions. [2025-04-13 23:23:12,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:12,870 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 176 transitions. [2025-04-13 23:23:12,871 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:12,871 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:12,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:12,871 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:23:12,871 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:23:12,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:12,872 INFO L85 PathProgramCache]: Analyzing trace with hash 519012595, now seen corresponding path program 3 times [2025-04-13 23:23:12,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:12,872 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236551780] [2025-04-13 23:23:12,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:12,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:12,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:12,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:12,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:23:12,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:13,024 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:23:13,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:13,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236551780] [2025-04-13 23:23:13,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236551780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:13,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:13,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:13,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297675939] [2025-04-13 23:23:13,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:13,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:13,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:13,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:13,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:13,025 INFO L87 Difference]: Start difference. First operand 76 states and 176 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:13,200 INFO L93 Difference]: Finished difference Result 94 states and 206 transitions. [2025-04-13 23:23:13,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:13,200 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:13,200 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:13,201 INFO L225 Difference]: With dead ends: 94 [2025-04-13 23:23:13,201 INFO L226 Difference]: Without dead ends: 78 [2025-04-13 23:23:13,201 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:23:13,202 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:13,202 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 10 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-13 23:23:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-04-13 23:23:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.324675324675325) internal successors, (179), 77 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have 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:23:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 179 transitions. [2025-04-13 23:23:13,213 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 179 transitions. Word has length 16 [2025-04-13 23:23:13,214 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:13,214 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 179 transitions. [2025-04-13 23:23:13,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:13,214 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 179 transitions. [2025-04-13 23:23:13,214 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:13,214 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:13,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:13,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:23:13,215 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:23:13,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:13,215 INFO L85 PathProgramCache]: Analyzing trace with hash 353373461, now seen corresponding path program 4 times [2025-04-13 23:23:13,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:13,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293827885] [2025-04-13 23:23:13,218 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:13,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:13,222 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:23:13,227 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:23:13,227 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:13,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:13,396 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:23:13,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:13,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293827885] [2025-04-13 23:23:13,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293827885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:13,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:13,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:13,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156379370] [2025-04-13 23:23:13,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:13,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:13,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:13,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:13,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:13,398 INFO L87 Difference]: Start difference. First operand 78 states and 179 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:13,616 INFO L93 Difference]: Finished difference Result 115 states and 266 transitions. [2025-04-13 23:23:13,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:13,616 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:13,617 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:13,617 INFO L225 Difference]: With dead ends: 115 [2025-04-13 23:23:13,617 INFO L226 Difference]: Without dead ends: 96 [2025-04-13 23:23:13,618 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:23:13,618 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:13,618 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 9 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:23:13,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-04-13 23:23:13,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2025-04-13 23:23:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 2.367816091954023) internal successors, (206), 87 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have 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:23:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 206 transitions. [2025-04-13 23:23:13,635 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 206 transitions. Word has length 16 [2025-04-13 23:23:13,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:13,635 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 206 transitions. [2025-04-13 23:23:13,635 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:13,635 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 206 transitions. [2025-04-13 23:23:13,636 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:13,636 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:13,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:13,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:23:13,636 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:23:13,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:13,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1641010435, now seen corresponding path program 5 times [2025-04-13 23:23:13,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:13,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204367953] [2025-04-13 23:23:13,637 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:13,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:13,643 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:13,652 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:13,652 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:13,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:13,772 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:23:13,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:13,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204367953] [2025-04-13 23:23:13,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204367953] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:13,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:13,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:13,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475471514] [2025-04-13 23:23:13,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:13,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:13,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:13,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:13,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:13,774 INFO L87 Difference]: Start difference. First operand 88 states and 206 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:13,975 INFO L93 Difference]: Finished difference Result 123 states and 286 transitions. [2025-04-13 23:23:13,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:13,976 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:13,976 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:13,977 INFO L225 Difference]: With dead ends: 123 [2025-04-13 23:23:13,977 INFO L226 Difference]: Without dead ends: 106 [2025-04-13 23:23:13,977 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:13,977 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:13,978 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-13 23:23:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2025-04-13 23:23:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.4395604395604398) internal successors, (222), 91 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have 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:23:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 222 transitions. [2025-04-13 23:23:13,993 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 222 transitions. Word has length 16 [2025-04-13 23:23:13,995 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:13,995 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 222 transitions. [2025-04-13 23:23:13,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:13,996 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 222 transitions. [2025-04-13 23:23:13,996 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:13,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:13,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:13,997 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:23:13,997 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:23:13,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:13,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1627158165, now seen corresponding path program 6 times [2025-04-13 23:23:13,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:13,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680443980] [2025-04-13 23:23:13,997 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:13,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:14,002 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:14,004 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:14,005 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:23:14,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:14,127 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:23:14,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:14,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680443980] [2025-04-13 23:23:14,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680443980] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:14,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:14,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:14,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536052536] [2025-04-13 23:23:14,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:14,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:14,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:14,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:14,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:14,129 INFO L87 Difference]: Start difference. First operand 92 states and 222 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:14,309 INFO L93 Difference]: Finished difference Result 114 states and 264 transitions. [2025-04-13 23:23:14,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:14,309 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:14,309 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:14,310 INFO L225 Difference]: With dead ends: 114 [2025-04-13 23:23:14,310 INFO L226 Difference]: Without dead ends: 98 [2025-04-13 23:23:14,310 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:14,311 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:14,311 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 6 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:14,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-13 23:23:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2025-04-13 23:23:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.4157303370786516) internal successors, (215), 89 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 215 transitions. [2025-04-13 23:23:14,319 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 215 transitions. Word has length 16 [2025-04-13 23:23:14,319 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:14,319 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 215 transitions. [2025-04-13 23:23:14,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:14,319 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 215 transitions. [2025-04-13 23:23:14,320 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:14,320 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:14,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:14,320 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:23:14,320 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:23:14,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:14,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1792797299, now seen corresponding path program 7 times [2025-04-13 23:23:14,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:14,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112491809] [2025-04-13 23:23:14,321 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:14,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:14,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:14,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:14,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:14,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:14,426 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:23:14,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:14,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112491809] [2025-04-13 23:23:14,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112491809] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:14,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:14,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:14,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811023140] [2025-04-13 23:23:14,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:14,427 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:14,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:14,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:14,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:14,428 INFO L87 Difference]: Start difference. First operand 90 states and 215 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:14,613 INFO L93 Difference]: Finished difference Result 115 states and 264 transitions. [2025-04-13 23:23:14,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:14,614 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:14,614 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:14,615 INFO L225 Difference]: With dead ends: 115 [2025-04-13 23:23:14,615 INFO L226 Difference]: Without dead ends: 96 [2025-04-13 23:23:14,615 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:14,616 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:14,616 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 5 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-04-13 23:23:14,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2025-04-13 23:23:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.4157303370786516) internal successors, (215), 89 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 215 transitions. [2025-04-13 23:23:14,628 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 215 transitions. Word has length 16 [2025-04-13 23:23:14,628 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:14,628 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 215 transitions. [2025-04-13 23:23:14,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:14,629 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 215 transitions. [2025-04-13 23:23:14,629 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:14,629 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:14,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:14,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:23:14,630 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:23:14,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:14,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2069595255, now seen corresponding path program 8 times [2025-04-13 23:23:14,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:14,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805313922] [2025-04-13 23:23:14,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:14,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:14,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:14,640 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:14,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:14,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:14,732 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:23:14,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:14,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805313922] [2025-04-13 23:23:14,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805313922] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:14,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:14,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:14,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140764325] [2025-04-13 23:23:14,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:14,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:14,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:14,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:14,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:14,734 INFO L87 Difference]: Start difference. First operand 90 states and 215 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:14,893 INFO L93 Difference]: Finished difference Result 118 states and 272 transitions. [2025-04-13 23:23:14,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:14,894 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:14,894 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:14,895 INFO L225 Difference]: With dead ends: 118 [2025-04-13 23:23:14,896 INFO L226 Difference]: Without dead ends: 102 [2025-04-13 23:23:14,896 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:14,896 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 25 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:14,897 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-04-13 23:23:14,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2025-04-13 23:23:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.4210526315789473) internal successors, (230), 95 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have 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:23:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 230 transitions. [2025-04-13 23:23:14,905 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 230 transitions. Word has length 16 [2025-04-13 23:23:14,906 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:14,906 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 230 transitions. [2025-04-13 23:23:14,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:14,906 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 230 transitions. [2025-04-13 23:23:14,906 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:14,906 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:14,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:14,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:23:14,907 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:23:14,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:14,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2096354325, now seen corresponding path program 9 times [2025-04-13 23:23:14,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:14,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20023595] [2025-04-13 23:23:14,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:14,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:14,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:14,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:14,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:23:14,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:15,006 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:23:15,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:15,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20023595] [2025-04-13 23:23:15,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20023595] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:15,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:15,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:15,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247583917] [2025-04-13 23:23:15,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:15,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:15,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:15,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:15,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:15,007 INFO L87 Difference]: Start difference. First operand 96 states and 230 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:15,161 INFO L93 Difference]: Finished difference Result 114 states and 260 transitions. [2025-04-13 23:23:15,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:15,161 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:15,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:15,162 INFO L225 Difference]: With dead ends: 114 [2025-04-13 23:23:15,162 INFO L226 Difference]: Without dead ends: 98 [2025-04-13 23:23:15,162 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:15,163 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:15,163 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 6 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-13 23:23:15,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-04-13 23:23:15,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.4210526315789473) internal successors, (230), 95 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have 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:23:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 230 transitions. [2025-04-13 23:23:15,179 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 230 transitions. Word has length 16 [2025-04-13 23:23:15,179 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:15,179 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 230 transitions. [2025-04-13 23:23:15,179 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:15,179 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 230 transitions. [2025-04-13 23:23:15,180 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:15,180 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:15,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:15,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:23:15,180 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:23:15,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:15,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1930715191, now seen corresponding path program 10 times [2025-04-13 23:23:15,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:15,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261995945] [2025-04-13 23:23:15,181 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:15,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:15,186 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:23:15,190 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:23:15,190 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:15,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:15,309 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:23:15,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:15,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261995945] [2025-04-13 23:23:15,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261995945] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:15,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:15,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:15,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595551940] [2025-04-13 23:23:15,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:15,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:15,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:15,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:15,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:15,310 INFO L87 Difference]: Start difference. First operand 96 states and 230 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:15,460 INFO L93 Difference]: Finished difference Result 148 states and 352 transitions. [2025-04-13 23:23:15,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:23:15,461 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:15,461 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:15,462 INFO L225 Difference]: With dead ends: 148 [2025-04-13 23:23:15,462 INFO L226 Difference]: Without dead ends: 129 [2025-04-13 23:23:15,462 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:23:15,463 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:15,463 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 8 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-04-13 23:23:15,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 100. [2025-04-13 23:23:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.4646464646464645) internal successors, (244), 99 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have 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:23:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 244 transitions. [2025-04-13 23:23:15,470 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 244 transitions. Word has length 16 [2025-04-13 23:23:15,470 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:15,470 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 244 transitions. [2025-04-13 23:23:15,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:15,470 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 244 transitions. [2025-04-13 23:23:15,471 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:15,471 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:15,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:15,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:23:15,471 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:23:15,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:15,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1053265113, now seen corresponding path program 11 times [2025-04-13 23:23:15,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:15,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773936853] [2025-04-13 23:23:15,471 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:15,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:15,474 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:15,476 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:15,476 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:15,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:15,571 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:23:15,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:15,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773936853] [2025-04-13 23:23:15,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773936853] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:15,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:15,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:15,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446294092] [2025-04-13 23:23:15,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:15,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:15,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:15,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:15,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:15,572 INFO L87 Difference]: Start difference. First operand 100 states and 244 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:15,737 INFO L93 Difference]: Finished difference Result 135 states and 324 transitions. [2025-04-13 23:23:15,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:15,737 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:15,737 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:15,738 INFO L225 Difference]: With dead ends: 135 [2025-04-13 23:23:15,738 INFO L226 Difference]: Without dead ends: 118 [2025-04-13 23:23:15,738 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:15,739 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:15,739 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 10 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-04-13 23:23:15,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104. [2025-04-13 23:23:15,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.5242718446601944) internal successors, (260), 103 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have 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:23:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 260 transitions. [2025-04-13 23:23:15,746 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 260 transitions. Word has length 16 [2025-04-13 23:23:15,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:15,746 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 260 transitions. [2025-04-13 23:23:15,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:15,746 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 260 transitions. [2025-04-13 23:23:15,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:15,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:15,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:15,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 23:23:15,747 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:23:15,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:15,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1039412843, now seen corresponding path program 12 times [2025-04-13 23:23:15,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:15,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342879112] [2025-04-13 23:23:15,747 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:15,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:15,750 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:15,751 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:15,752 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:23:15,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:15,838 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:23:15,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:15,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342879112] [2025-04-13 23:23:15,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342879112] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:15,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:15,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:15,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629187929] [2025-04-13 23:23:15,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:15,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:15,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:15,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:15,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:15,840 INFO L87 Difference]: Start difference. First operand 104 states and 260 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:16,004 INFO L93 Difference]: Finished difference Result 126 states and 302 transitions. [2025-04-13 23:23:16,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:16,004 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:16,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:16,005 INFO L225 Difference]: With dead ends: 126 [2025-04-13 23:23:16,005 INFO L226 Difference]: Without dead ends: 110 [2025-04-13 23:23:16,005 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:16,006 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:16,006 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:16,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-13 23:23:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2025-04-13 23:23:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.504950495049505) internal successors, (253), 101 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have 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:23:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 253 transitions. [2025-04-13 23:23:16,012 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 253 transitions. Word has length 16 [2025-04-13 23:23:16,012 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:16,012 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 253 transitions. [2025-04-13 23:23:16,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:16,012 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 253 transitions. [2025-04-13 23:23:16,013 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:16,013 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:16,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:16,013 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 23:23:16,013 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:23:16,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:16,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1205051977, now seen corresponding path program 13 times [2025-04-13 23:23:16,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:16,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824287663] [2025-04-13 23:23:16,013 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:16,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:16,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:16,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:16,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:16,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:16,098 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:23:16,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:16,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824287663] [2025-04-13 23:23:16,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824287663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:16,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:16,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:16,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146167723] [2025-04-13 23:23:16,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:16,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:16,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:16,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:16,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:16,099 INFO L87 Difference]: Start difference. First operand 102 states and 253 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:16,228 INFO L93 Difference]: Finished difference Result 127 states and 302 transitions. [2025-04-13 23:23:16,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:16,229 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:16,229 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:16,229 INFO L225 Difference]: With dead ends: 127 [2025-04-13 23:23:16,230 INFO L226 Difference]: Without dead ends: 108 [2025-04-13 23:23:16,230 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:16,230 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:16,230 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 9 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-13 23:23:16,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2025-04-13 23:23:16,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.504950495049505) internal successors, (253), 101 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have 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:23:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 253 transitions. [2025-04-13 23:23:16,238 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 253 transitions. Word has length 16 [2025-04-13 23:23:16,238 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:16,238 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 253 transitions. [2025-04-13 23:23:16,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:16,238 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 253 transitions. [2025-04-13 23:23:16,238 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:16,238 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:16,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:16,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 23:23:16,239 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:23:16,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1637626719, now seen corresponding path program 14 times [2025-04-13 23:23:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:16,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618234022] [2025-04-13 23:23:16,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:16,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:16,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:16,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:16,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:16,321 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:23:16,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:16,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618234022] [2025-04-13 23:23:16,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618234022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:16,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:16,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:16,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036940120] [2025-04-13 23:23:16,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:16,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:16,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:16,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:16,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:16,323 INFO L87 Difference]: Start difference. First operand 102 states and 253 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:16,481 INFO L93 Difference]: Finished difference Result 136 states and 327 transitions. [2025-04-13 23:23:16,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:16,482 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:16,482 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:16,483 INFO L225 Difference]: With dead ends: 136 [2025-04-13 23:23:16,483 INFO L226 Difference]: Without dead ends: 120 [2025-04-13 23:23:16,483 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:16,483 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:16,483 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-13 23:23:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2025-04-13 23:23:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.5242718446601944) internal successors, (260), 103 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have 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:23:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 260 transitions. [2025-04-13 23:23:16,500 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 260 transitions. Word has length 16 [2025-04-13 23:23:16,501 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:16,501 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 260 transitions. [2025-04-13 23:23:16,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:16,501 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 260 transitions. [2025-04-13 23:23:16,501 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:16,501 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:16,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:16,501 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 23:23:16,502 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:23:16,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:16,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1610867649, now seen corresponding path program 15 times [2025-04-13 23:23:16,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:16,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252887798] [2025-04-13 23:23:16,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:16,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:16,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:16,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:16,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:23:16,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:16,591 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:23:16,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:16,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252887798] [2025-04-13 23:23:16,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252887798] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:16,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:16,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:16,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068446990] [2025-04-13 23:23:16,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:16,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:16,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:16,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:16,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:16,592 INFO L87 Difference]: Start difference. First operand 104 states and 260 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:16,721 INFO L93 Difference]: Finished difference Result 128 states and 307 transitions. [2025-04-13 23:23:16,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:16,721 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:16,722 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:16,722 INFO L225 Difference]: With dead ends: 128 [2025-04-13 23:23:16,722 INFO L226 Difference]: Without dead ends: 112 [2025-04-13 23:23:16,725 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:16,725 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:16,725 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-04-13 23:23:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2025-04-13 23:23:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.4646464646464645) internal successors, (244), 99 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have 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:23:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 244 transitions. [2025-04-13 23:23:16,733 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 244 transitions. Word has length 16 [2025-04-13 23:23:16,733 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:16,733 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 244 transitions. [2025-04-13 23:23:16,733 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:16,733 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 244 transitions. [2025-04-13 23:23:16,734 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:16,735 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:16,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:16,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 23:23:16,735 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:23:16,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:16,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1776506783, now seen corresponding path program 16 times [2025-04-13 23:23:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:16,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552273750] [2025-04-13 23:23:16,736 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:16,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:16,739 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:23:16,743 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:23:16,744 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:16,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:16,831 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:23:16,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:16,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552273750] [2025-04-13 23:23:16,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552273750] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:16,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:16,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:16,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327401293] [2025-04-13 23:23:16,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:16,832 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:16,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:16,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:16,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:16,832 INFO L87 Difference]: Start difference. First operand 100 states and 244 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:17,011 INFO L93 Difference]: Finished difference Result 166 states and 409 transitions. [2025-04-13 23:23:17,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:23:17,012 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:17,012 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:17,013 INFO L225 Difference]: With dead ends: 166 [2025-04-13 23:23:17,013 INFO L226 Difference]: Without dead ends: 147 [2025-04-13 23:23:17,013 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:23:17,013 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:17,014 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 13 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-13 23:23:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 108. [2025-04-13 23:23:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.485981308411215) internal successors, (266), 107 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have 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:23:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 266 transitions. [2025-04-13 23:23:17,021 INFO L79 Accepts]: Start accepts. Automaton has 108 states and 266 transitions. Word has length 16 [2025-04-13 23:23:17,021 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:17,021 INFO L485 AbstractCegarLoop]: Abstraction has 108 states and 266 transitions. [2025-04-13 23:23:17,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:17,021 INFO L278 IsEmpty]: Start isEmpty. Operand 108 states and 266 transitions. [2025-04-13 23:23:17,022 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:17,022 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:17,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:17,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 23:23:17,022 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:23:17,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash 208562419, now seen corresponding path program 17 times [2025-04-13 23:23:17,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:17,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130699574] [2025-04-13 23:23:17,023 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:17,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:17,025 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:17,027 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:17,027 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:17,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:17,100 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:23:17,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:17,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130699574] [2025-04-13 23:23:17,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130699574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:17,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:17,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:17,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826537321] [2025-04-13 23:23:17,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:17,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:17,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:17,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:17,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:17,101 INFO L87 Difference]: Start difference. First operand 108 states and 266 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:17,239 INFO L93 Difference]: Finished difference Result 128 states and 303 transitions. [2025-04-13 23:23:17,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:17,240 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:17,240 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:17,240 INFO L225 Difference]: With dead ends: 128 [2025-04-13 23:23:17,241 INFO L226 Difference]: Without dead ends: 112 [2025-04-13 23:23:17,241 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:23:17,245 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:17,245 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 12 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:17,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-04-13 23:23:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2025-04-13 23:23:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.485981308411215) internal successors, (266), 107 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have 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:23:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 266 transitions. [2025-04-13 23:23:17,261 INFO L79 Accepts]: Start accepts. Automaton has 108 states and 266 transitions. Word has length 16 [2025-04-13 23:23:17,261 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:17,261 INFO L485 AbstractCegarLoop]: Abstraction has 108 states and 266 transitions. [2025-04-13 23:23:17,261 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:17,262 INFO L278 IsEmpty]: Start isEmpty. Operand 108 states and 266 transitions. [2025-04-13 23:23:17,262 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:17,262 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:17,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:17,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 23:23:17,262 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:23:17,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:17,263 INFO L85 PathProgramCache]: Analyzing trace with hash -561915563, now seen corresponding path program 18 times [2025-04-13 23:23:17,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:17,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78931567] [2025-04-13 23:23:17,263 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:17,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:17,269 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:17,271 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:17,272 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:23:17,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:17,353 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:23:17,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:17,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78931567] [2025-04-13 23:23:17,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78931567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:17,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:17,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:17,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184037159] [2025-04-13 23:23:17,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:17,353 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:17,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:17,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:17,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:17,354 INFO L87 Difference]: Start difference. First operand 108 states and 266 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:17,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:17,520 INFO L93 Difference]: Finished difference Result 136 states and 323 transitions. [2025-04-13 23:23:17,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:17,521 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:17,521 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:17,522 INFO L225 Difference]: With dead ends: 136 [2025-04-13 23:23:17,522 INFO L226 Difference]: Without dead ends: 120 [2025-04-13 23:23:17,522 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:23:17,522 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:17,523 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 7 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-13 23:23:17,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2025-04-13 23:23:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.5045871559633026) internal successors, (273), 109 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have 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:23:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 273 transitions. [2025-04-13 23:23:17,534 INFO L79 Accepts]: Start accepts. Automaton has 110 states and 273 transitions. Word has length 16 [2025-04-13 23:23:17,535 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:17,535 INFO L485 AbstractCegarLoop]: Abstraction has 110 states and 273 transitions. [2025-04-13 23:23:17,535 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:17,535 INFO L278 IsEmpty]: Start isEmpty. Operand 110 states and 273 transitions. [2025-04-13 23:23:17,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:23:17,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:17,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:17,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 23:23:17,535 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:23:17,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash -535156493, now seen corresponding path program 19 times [2025-04-13 23:23:17,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:17,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656241502] [2025-04-13 23:23:17,536 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:17,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:17,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:23:17,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:23:17,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:17,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:17,645 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:23:17,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:17,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656241502] [2025-04-13 23:23:17,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656241502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:17,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:17,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:23:17,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665143593] [2025-04-13 23:23:17,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:17,646 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:17,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:17,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:17,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:17,646 INFO L87 Difference]: Start difference. First operand 110 states and 273 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:17,809 INFO L93 Difference]: Finished difference Result 128 states and 303 transitions. [2025-04-13 23:23:17,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:17,809 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:17,809 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:17,810 INFO L225 Difference]: With dead ends: 128 [2025-04-13 23:23:17,810 INFO L226 Difference]: Without dead ends: 110 [2025-04-13 23:23:17,810 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:23:17,811 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:17,811 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-13 23:23:17,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2025-04-13 23:23:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.4854368932038833) internal successors, (256), 103 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have 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:23:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 256 transitions. [2025-04-13 23:23:17,820 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 256 transitions. Word has length 16 [2025-04-13 23:23:17,820 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:17,820 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 256 transitions. [2025-04-13 23:23:17,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:23:17,821 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 256 transitions. [2025-04-13 23:23:17,821 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:23:17,821 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:17,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:17,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 23:23:17,821 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:23:17,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:17,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1201636029, now seen corresponding path program 1 times [2025-04-13 23:23:17,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:17,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464706] [2025-04-13 23:23:17,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:23:17,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:17,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 23:23:17,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:23:17,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:17,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:17,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:17,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464706] [2025-04-13 23:23:17,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:17,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:17,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:23:17,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483640446] [2025-04-13 23:23:17,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:17,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:23:17,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:17,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:23:17,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:23:17,856 INFO L87 Difference]: Start difference. First operand 104 states and 256 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:17,963 INFO L93 Difference]: Finished difference Result 205 states and 481 transitions. [2025-04-13 23:23:17,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:23:17,963 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:23:17,963 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:17,964 INFO L225 Difference]: With dead ends: 205 [2025-04-13 23:23:17,964 INFO L226 Difference]: Without dead ends: 155 [2025-04-13 23:23:17,964 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:23:17,965 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 39 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:17,965 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 9 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-04-13 23:23:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 100. [2025-04-13 23:23:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.4545454545454546) internal successors, (243), 99 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have 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:23:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 243 transitions. [2025-04-13 23:23:17,973 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 243 transitions. Word has length 17 [2025-04-13 23:23:17,973 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:17,973 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 243 transitions. [2025-04-13 23:23:17,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:17,973 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 243 transitions. [2025-04-13 23:23:17,974 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:23:17,974 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:17,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:17,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 23:23:17,974 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:23:17,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:17,974 INFO L85 PathProgramCache]: Analyzing trace with hash -367192422, now seen corresponding path program 1 times [2025-04-13 23:23:17,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:17,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760002427] [2025-04-13 23:23:17,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:23:17,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:17,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 23:23:17,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:23:17,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:17,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:18,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:18,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760002427] [2025-04-13 23:23:18,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760002427] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:18,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449588504] [2025-04-13 23:23:18,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:23:18,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:18,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:18,004 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:23:18,006 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:23:18,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 23:23:18,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:23:18,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:18,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:18,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 23:23:18,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:18,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:18,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449588504] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:18,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:23:18,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6 [2025-04-13 23:23:18,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357888603] [2025-04-13 23:23:18,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:18,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:23:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:18,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:23:18,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:23:18,086 INFO L87 Difference]: Start difference. First operand 100 states and 243 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:18,171 INFO L93 Difference]: Finished difference Result 193 states and 465 transitions. [2025-04-13 23:23:18,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:23:18,171 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:23:18,171 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:18,172 INFO L225 Difference]: With dead ends: 193 [2025-04-13 23:23:18,172 INFO L226 Difference]: Without dead ends: 156 [2025-04-13 23:23:18,173 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:23:18,173 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:18,173 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 8 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:18,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-04-13 23:23:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 100. [2025-04-13 23:23:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.4545454545454546) internal successors, (243), 99 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have 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:23:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 243 transitions. [2025-04-13 23:23:18,182 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 243 transitions. Word has length 17 [2025-04-13 23:23:18,182 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:18,182 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 243 transitions. [2025-04-13 23:23:18,182 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:18,182 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 243 transitions. [2025-04-13 23:23:18,182 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:23:18,182 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:18,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:18,200 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:23:18,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-13 23:23:18,383 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:23:18,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash 444477187, now seen corresponding path program 2 times [2025-04-13 23:23:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:18,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530732744] [2025-04-13 23:23:18,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:18,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:18,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:18,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:23:18,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:18,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:18,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:18,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530732744] [2025-04-13 23:23:18,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530732744] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:18,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785620499] [2025-04-13 23:23:18,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:18,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:18,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:18,428 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:23:18,429 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:23:18,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:18,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:23:18,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:18,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:18,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 23:23:18,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:18,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:18,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785620499] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:18,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:23:18,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2025-04-13 23:23:18,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901532905] [2025-04-13 23:23:18,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:18,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:23:18,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:18,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:23:18,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:23:18,508 INFO L87 Difference]: Start difference. First operand 100 states and 243 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:18,619 INFO L93 Difference]: Finished difference Result 278 states and 633 transitions. [2025-04-13 23:23:18,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:23:18,619 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:23:18,619 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:18,621 INFO L225 Difference]: With dead ends: 278 [2025-04-13 23:23:18,621 INFO L226 Difference]: Without dead ends: 248 [2025-04-13 23:23:18,621 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:23:18,622 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:18,623 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 5 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-04-13 23:23:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 104. [2025-04-13 23:23:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.5145631067961167) internal successors, (259), 103 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have 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:23:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 259 transitions. [2025-04-13 23:23:18,641 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 259 transitions. Word has length 17 [2025-04-13 23:23:18,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:18,642 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 259 transitions. [2025-04-13 23:23:18,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:18,642 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 259 transitions. [2025-04-13 23:23:18,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:23:18,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:18,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:18,650 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:23:18,843 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,SelfDestructingSolverStorable21 [2025-04-13 23:23:18,843 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:23:18,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:18,844 INFO L85 PathProgramCache]: Analyzing trace with hash -631233969, now seen corresponding path program 3 times [2025-04-13 23:23:18,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:18,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25547163] [2025-04-13 23:23:18,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:18,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:18,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:18,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:23:18,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:23:18,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:18,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:18,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25547163] [2025-04-13 23:23:18,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25547163] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:18,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:18,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:23:18,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663335839] [2025-04-13 23:23:18,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:18,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:23:18,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:18,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:23:18,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:23:18,867 INFO L87 Difference]: Start difference. First operand 104 states and 259 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:18,990 INFO L93 Difference]: Finished difference Result 221 states and 513 transitions. [2025-04-13 23:23:18,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:23:18,990 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:23:18,990 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:18,991 INFO L225 Difference]: With dead ends: 221 [2025-04-13 23:23:18,991 INFO L226 Difference]: Without dead ends: 184 [2025-04-13 23:23:18,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:18,992 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 55 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:18,992 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 5 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-04-13 23:23:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 102. [2025-04-13 23:23:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.4752475247524752) internal successors, (250), 101 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have 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:23:19,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 250 transitions. [2025-04-13 23:23:19,002 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 250 transitions. Word has length 17 [2025-04-13 23:23:19,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:19,002 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 250 transitions. [2025-04-13 23:23:19,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:19,002 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 250 transitions. [2025-04-13 23:23:19,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:23:19,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:19,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:19,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 23:23:19,003 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:23:19,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1427044712, now seen corresponding path program 2 times [2025-04-13 23:23:19,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:19,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993304144] [2025-04-13 23:23:19,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:19,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:19,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:19,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:23:19,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:19,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:19,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:19,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993304144] [2025-04-13 23:23:19,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993304144] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:19,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281010101] [2025-04-13 23:23:19,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:19,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:19,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:19,028 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:23:19,030 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:23:19,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:19,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:23:19,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:19,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:19,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 23:23:19,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:19,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:19,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281010101] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:19,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:23:19,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2025-04-13 23:23:19,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929482532] [2025-04-13 23:23:19,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:19,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:23:19,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:19,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:23:19,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:23:19,105 INFO L87 Difference]: Start difference. First operand 102 states and 250 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:19,206 INFO L93 Difference]: Finished difference Result 223 states and 518 transitions. [2025-04-13 23:23:19,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:23:19,206 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:23:19,206 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:19,207 INFO L225 Difference]: With dead ends: 223 [2025-04-13 23:23:19,207 INFO L226 Difference]: Without dead ends: 194 [2025-04-13 23:23:19,207 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:19,208 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 42 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:19,208 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-13 23:23:19,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 104. [2025-04-13 23:23:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.495145631067961) internal successors, (257), 103 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have 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:23:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 257 transitions. [2025-04-13 23:23:19,219 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 257 transitions. Word has length 17 [2025-04-13 23:23:19,219 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:19,219 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 257 transitions. [2025-04-13 23:23:19,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:19,219 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 257 transitions. [2025-04-13 23:23:19,219 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:23:19,219 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:19,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:19,226 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:23:19,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:19,424 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:23:19,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:19,424 INFO L85 PathProgramCache]: Analyzing trace with hash 561939320, now seen corresponding path program 3 times [2025-04-13 23:23:19,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:19,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501258224] [2025-04-13 23:23:19,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:19,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:19,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:19,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:23:19,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:23:19,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:19,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:19,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501258224] [2025-04-13 23:23:19,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501258224] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:19,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:19,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:23:19,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388911244] [2025-04-13 23:23:19,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:19,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:23:19,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:19,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:23:19,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:23:19,449 INFO L87 Difference]: Start difference. First operand 104 states and 257 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:19,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:19,539 INFO L93 Difference]: Finished difference Result 176 states and 406 transitions. [2025-04-13 23:23:19,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:23:19,540 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:23:19,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:19,540 INFO L225 Difference]: With dead ends: 176 [2025-04-13 23:23:19,540 INFO L226 Difference]: Without dead ends: 141 [2025-04-13 23:23:19,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:23:19,541 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 39 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:19,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 5 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-04-13 23:23:19,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 104. [2025-04-13 23:23:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.4757281553398056) internal successors, (255), 103 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have 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:23:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 255 transitions. [2025-04-13 23:23:19,567 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 255 transitions. Word has length 17 [2025-04-13 23:23:19,567 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:19,567 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 255 transitions. [2025-04-13 23:23:19,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:19,567 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 255 transitions. [2025-04-13 23:23:19,567 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:23:19,567 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:19,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:19,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 23:23:19,568 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:23:19,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:19,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1851659071, now seen corresponding path program 4 times [2025-04-13 23:23:19,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:19,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280364992] [2025-04-13 23:23:19,568 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:19,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:19,571 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:19,573 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:23:19,574 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:19,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:19,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:19,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280364992] [2025-04-13 23:23:19,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280364992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:19,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729151778] [2025-04-13 23:23:19,594 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:19,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:19,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:19,595 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:23:19,597 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:23:19,620 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:19,629 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:23:19,629 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:19,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:19,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 23:23:19,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:19,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:19,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729151778] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:19,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:23:19,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2025-04-13 23:23:19,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566770456] [2025-04-13 23:23:19,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:19,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:23:19,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:19,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:23:19,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:23:19,668 INFO L87 Difference]: Start difference. First operand 104 states and 255 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:19,749 INFO L93 Difference]: Finished difference Result 201 states and 479 transitions. [2025-04-13 23:23:19,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:23:19,749 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:23:19,749 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:19,750 INFO L225 Difference]: With dead ends: 201 [2025-04-13 23:23:19,750 INFO L226 Difference]: Without dead ends: 162 [2025-04-13 23:23:19,750 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:23:19,751 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:19,751 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 9 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-04-13 23:23:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 96. [2025-04-13 23:23:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.431578947368421) internal successors, (231), 95 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have 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:23:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 231 transitions. [2025-04-13 23:23:19,764 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 231 transitions. Word has length 17 [2025-04-13 23:23:19,764 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:19,764 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 231 transitions. [2025-04-13 23:23:19,764 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:19,764 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 231 transitions. [2025-04-13 23:23:19,764 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:23:19,764 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:19,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:19,771 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:23:19,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 23:23:19,968 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:23:19,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:19,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1484712985, now seen corresponding path program 5 times [2025-04-13 23:23:19,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:19,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684611273] [2025-04-13 23:23:19,969 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:19,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:19,972 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:19,974 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:23:19,974 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:19,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:19,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:19,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:19,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684611273] [2025-04-13 23:23:19,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684611273] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:19,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921780104] [2025-04-13 23:23:19,996 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:19,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:19,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:19,998 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:23:20,000 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:23:20,025 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:20,035 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:23:20,035 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:20,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:20,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 23:23:20,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:20,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:20,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921780104] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:20,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:23:20,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2025-04-13 23:23:20,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302860157] [2025-04-13 23:23:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:20,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:23:20,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:20,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:23:20,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:23:20,076 INFO L87 Difference]: Start difference. First operand 96 states and 231 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:20,172 INFO L93 Difference]: Finished difference Result 210 states and 484 transitions. [2025-04-13 23:23:20,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:23:20,173 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:23:20,173 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:20,174 INFO L225 Difference]: With dead ends: 210 [2025-04-13 23:23:20,174 INFO L226 Difference]: Without dead ends: 180 [2025-04-13 23:23:20,174 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:20,174 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 40 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:20,174 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-04-13 23:23:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 96. [2025-04-13 23:23:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.431578947368421) internal successors, (231), 95 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have 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:23:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 231 transitions. [2025-04-13 23:23:20,189 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 231 transitions. Word has length 17 [2025-04-13 23:23:20,190 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:20,190 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 231 transitions. [2025-04-13 23:23:20,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:20,190 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 231 transitions. [2025-04-13 23:23:20,190 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:23:20,190 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:20,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:20,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 23:23:20,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 23:23:20,391 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:23:20,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:20,391 INFO L85 PathProgramCache]: Analyzing trace with hash 409001829, now seen corresponding path program 6 times [2025-04-13 23:23:20,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:20,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940731601] [2025-04-13 23:23:20,392 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:20,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:20,394 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:20,396 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:23:20,396 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:23:20,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:20,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:20,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940731601] [2025-04-13 23:23:20,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940731601] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:20,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:20,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:23:20,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772999181] [2025-04-13 23:23:20,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:20,419 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:23:20,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:20,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:23:20,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:23:20,420 INFO L87 Difference]: Start difference. First operand 96 states and 231 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:20,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:20,528 INFO L93 Difference]: Finished difference Result 170 states and 387 transitions. [2025-04-13 23:23:20,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:23:20,528 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:23:20,528 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:20,529 INFO L225 Difference]: With dead ends: 170 [2025-04-13 23:23:20,529 INFO L226 Difference]: Without dead ends: 133 [2025-04-13 23:23:20,529 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:23:20,529 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 41 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:20,529 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 5 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-04-13 23:23:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 92. [2025-04-13 23:23:20,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.3626373626373627) internal successors, (215), 91 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 215 transitions. [2025-04-13 23:23:20,541 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 215 transitions. Word has length 17 [2025-04-13 23:23:20,541 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:20,541 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 215 transitions. [2025-04-13 23:23:20,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:20,541 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 215 transitions. [2025-04-13 23:23:20,542 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:23:20,542 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:20,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:20,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 23:23:20,542 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:23:20,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:20,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1827686786, now seen corresponding path program 4 times [2025-04-13 23:23:20,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:20,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039688534] [2025-04-13 23:23:20,542 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:20,546 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:20,547 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:23:20,548 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:20,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:20,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:20,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039688534] [2025-04-13 23:23:20,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039688534] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:20,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981559632] [2025-04-13 23:23:20,570 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:20,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:20,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:20,572 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:23:20,574 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:23:20,595 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:20,604 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:23:20,604 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:20,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:20,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 23:23:20,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:20,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:20,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981559632] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:20,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:23:20,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2025-04-13 23:23:20,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928875438] [2025-04-13 23:23:20,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:20,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:23:20,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:20,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:23:20,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:20,650 INFO L87 Difference]: Start difference. First operand 92 states and 215 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:20,757 INFO L93 Difference]: Finished difference Result 219 states and 496 transitions. [2025-04-13 23:23:20,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:23:20,758 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:23:20,758 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:20,759 INFO L225 Difference]: With dead ends: 219 [2025-04-13 23:23:20,759 INFO L226 Difference]: Without dead ends: 190 [2025-04-13 23:23:20,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:23:20,760 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:20,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 6 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-04-13 23:23:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 96. [2025-04-13 23:23:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.4105263157894736) internal successors, (229), 95 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:23:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 229 transitions. [2025-04-13 23:23:20,785 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 229 transitions. Word has length 17 [2025-04-13 23:23:20,785 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:20,785 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 229 transitions. [2025-04-13 23:23:20,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:20,785 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 229 transitions. [2025-04-13 23:23:20,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:23:20,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:20,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:20,794 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:23:20,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 23:23:20,989 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:23:20,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:20,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1602175118, now seen corresponding path program 5 times [2025-04-13 23:23:20,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:20,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944745935] [2025-04-13 23:23:20,990 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:20,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:20,992 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:20,994 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:23:20,994 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:20,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:21,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:21,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944745935] [2025-04-13 23:23:21,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944745935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:21,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:21,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:23:21,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157716512] [2025-04-13 23:23:21,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:21,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:23:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:21,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:23:21,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:23:21,015 INFO L87 Difference]: Start difference. First operand 96 states and 229 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:21,144 INFO L93 Difference]: Finished difference Result 211 states and 470 transitions. [2025-04-13 23:23:21,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:23:21,144 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:23:21,144 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:21,145 INFO L225 Difference]: With dead ends: 211 [2025-04-13 23:23:21,145 INFO L226 Difference]: Without dead ends: 176 [2025-04-13 23:23:21,145 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:21,146 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 50 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:21,146 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-04-13 23:23:21,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 94. [2025-04-13 23:23:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.3870967741935485) internal successors, (222), 93 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have 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:23:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 222 transitions. [2025-04-13 23:23:21,161 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 222 transitions. Word has length 17 [2025-04-13 23:23:21,161 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:21,161 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 222 transitions. [2025-04-13 23:23:21,161 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:21,161 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 222 transitions. [2025-04-13 23:23:21,161 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:23:21,162 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:21,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:21,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 23:23:21,162 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:23:21,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1295503748, now seen corresponding path program 6 times [2025-04-13 23:23:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:21,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372842189] [2025-04-13 23:23:21,163 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:21,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:21,165 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:23:21,168 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:23:21,168 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:23:21,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:21,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:21,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372842189] [2025-04-13 23:23:21,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372842189] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:21,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:21,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:23:21,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151668120] [2025-04-13 23:23:21,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:21,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:23:21,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:21,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:23:21,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:23:21,188 INFO L87 Difference]: Start difference. First operand 94 states and 222 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:21,271 INFO L93 Difference]: Finished difference Result 135 states and 307 transitions. [2025-04-13 23:23:21,271 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:23:21,271 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:23:21,271 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:21,272 INFO L225 Difference]: With dead ends: 135 [2025-04-13 23:23:21,272 INFO L226 Difference]: Without dead ends: 94 [2025-04-13 23:23:21,272 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:23:21,272 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 28 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:21,273 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 8 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:21,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-04-13 23:23:21,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-04-13 23:23:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.3655913978494625) internal successors, (220), 93 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have 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:23:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 220 transitions. [2025-04-13 23:23:21,284 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 220 transitions. Word has length 17 [2025-04-13 23:23:21,284 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:21,284 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 220 transitions. [2025-04-13 23:23:21,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:21,284 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 220 transitions. [2025-04-13 23:23:21,284 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:21,284 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:21,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:21,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 23:23:21,285 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:21,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2064341922, now seen corresponding path program 1 times [2025-04-13 23:23:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:21,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458102000] [2025-04-13 23:23:21,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:23:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:21,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:23:21,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:21,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:21,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:21,371 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:23:21,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:21,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458102000] [2025-04-13 23:23:21,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458102000] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:21,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761467626] [2025-04-13 23:23:21,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:23:21,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:21,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:21,373 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:23:21,375 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:23:21,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:23:21,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:21,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:21,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:21,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:21,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:21,514 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:23:21,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:21,768 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:23:21,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761467626] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:21,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:21,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 23:23:21,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150044780] [2025-04-13 23:23:21,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:21,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:23:21,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:21,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:23:21,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:23:21,770 INFO L87 Difference]: Start difference. First operand 94 states and 220 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:22,824 INFO L93 Difference]: Finished difference Result 303 states and 685 transitions. [2025-04-13 23:23:22,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 23:23:22,824 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:23:22,824 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:22,826 INFO L225 Difference]: With dead ends: 303 [2025-04-13 23:23:22,826 INFO L226 Difference]: Without dead ends: 222 [2025-04-13 23:23:22,827 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=508, Invalid=2042, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 23:23:22,827 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 202 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:22,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 31 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:23:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-04-13 23:23:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 80. [2025-04-13 23:23:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 2.3164556962025316) internal successors, (183), 79 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have 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:23:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 183 transitions. [2025-04-13 23:23:22,849 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 183 transitions. Word has length 18 [2025-04-13 23:23:22,849 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:22,849 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 183 transitions. [2025-04-13 23:23:22,849 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:22,849 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 183 transitions. [2025-04-13 23:23:22,850 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:22,850 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:22,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:22,858 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:23:23,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:23,053 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:23,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:23,053 INFO L85 PathProgramCache]: Analyzing trace with hash 612844258, now seen corresponding path program 2 times [2025-04-13 23:23:23,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:23,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617200311] [2025-04-13 23:23:23,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:23,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:23,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:23,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:23,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:23,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:23,152 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:23:23,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:23,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617200311] [2025-04-13 23:23:23,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617200311] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:23,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131038668] [2025-04-13 23:23:23,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:23,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:23,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:23,155 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:23:23,156 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:23:23,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:23,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:23,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:23,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:23,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:23,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:23,279 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:23:23,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:23,453 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:23:23,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131038668] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:23,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:23,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 23:23:23,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074961540] [2025-04-13 23:23:23,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:23,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:23:23,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:23,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:23:23,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:23:23,455 INFO L87 Difference]: Start difference. First operand 80 states and 183 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:23,863 INFO L93 Difference]: Finished difference Result 147 states and 325 transitions. [2025-04-13 23:23:23,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:23:23,864 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:23:23,864 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:23,865 INFO L225 Difference]: With dead ends: 147 [2025-04-13 23:23:23,865 INFO L226 Difference]: Without dead ends: 125 [2025-04-13 23:23:23,865 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:23:23,866 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 79 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:23,866 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 8 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:23:23,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-13 23:23:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 86. [2025-04-13 23:23:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 2.4) internal successors, (204), 85 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have 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:23:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 204 transitions. [2025-04-13 23:23:23,880 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 204 transitions. Word has length 18 [2025-04-13 23:23:23,880 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:23,880 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 204 transitions. [2025-04-13 23:23:23,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:23,880 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 204 transitions. [2025-04-13 23:23:23,880 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:23,880 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:23,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:23,887 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:23:24,081 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,SelfDestructingSolverStorable32 [2025-04-13 23:23:24,081 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:24,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash 626696528, now seen corresponding path program 3 times [2025-04-13 23:23:24,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:24,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057106043] [2025-04-13 23:23:24,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:24,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:24,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:24,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:24,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:23:24,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:24,177 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:23:24,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:24,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057106043] [2025-04-13 23:23:24,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057106043] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:24,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333754262] [2025-04-13 23:23:24,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:24,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:24,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:24,179 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:23:24,181 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:23:24,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:24,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:24,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:23:24,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:24,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:24,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:24,313 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:23:24,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:24,472 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:23:24,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333754262] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:24,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:24,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 23:23:24,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023697323] [2025-04-13 23:23:24,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:24,472 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:23:24,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:24,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:23:24,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:23:24,473 INFO L87 Difference]: Start difference. First operand 86 states and 204 transitions. Second operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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:23:24,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:24,866 INFO L93 Difference]: Finished difference Result 140 states and 313 transitions. [2025-04-13 23:23:24,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:23:24,866 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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 18 [2025-04-13 23:23:24,866 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:24,867 INFO L225 Difference]: With dead ends: 140 [2025-04-13 23:23:24,867 INFO L226 Difference]: Without dead ends: 120 [2025-04-13 23:23:24,868 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:23:24,868 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 96 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:24,868 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 20 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:23:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-13 23:23:24,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 90. [2025-04-13 23:23:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.404494382022472) internal successors, (214), 89 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have 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:23:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 214 transitions. [2025-04-13 23:23:24,884 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 214 transitions. Word has length 18 [2025-04-13 23:23:24,884 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:24,884 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 214 transitions. [2025-04-13 23:23:24,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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:23:24,884 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 214 transitions. [2025-04-13 23:23:24,884 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:24,884 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:24,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:24,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 23:23:25,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:25,088 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:25,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:25,088 INFO L85 PathProgramCache]: Analyzing trace with hash 461057394, now seen corresponding path program 4 times [2025-04-13 23:23:25,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:25,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197307101] [2025-04-13 23:23:25,089 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:25,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:25,091 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:25,092 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:25,092 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:25,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:25,220 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:23:25,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:25,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197307101] [2025-04-13 23:23:25,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197307101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:25,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55146920] [2025-04-13 23:23:25,220 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:25,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:25,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:25,223 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:23:25,225 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:23:25,247 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:25,257 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:25,258 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:25,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:25,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:25,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:25,373 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:23:25,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:25,525 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:23:25,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55146920] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:25,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:25,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 23:23:25,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066801711] [2025-04-13 23:23:25,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:25,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:23:25,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:25,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:23:25,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:23:25,526 INFO L87 Difference]: Start difference. First operand 90 states and 214 transitions. Second operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:25,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:25,988 INFO L93 Difference]: Finished difference Result 137 states and 301 transitions. [2025-04-13 23:23:25,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:23:25,988 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:23:25,988 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:25,989 INFO L225 Difference]: With dead ends: 137 [2025-04-13 23:23:25,989 INFO L226 Difference]: Without dead ends: 108 [2025-04-13 23:23:25,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:23:25,990 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 81 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:25,990 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 11 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:23:25,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-13 23:23:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 78. [2025-04-13 23:23:26,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.324675324675325) internal successors, (179), 77 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have 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:23:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 179 transitions. [2025-04-13 23:23:26,011 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 179 transitions. Word has length 18 [2025-04-13 23:23:26,011 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:26,011 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 179 transitions. [2025-04-13 23:23:26,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:26,011 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 179 transitions. [2025-04-13 23:23:26,012 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:26,012 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:26,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:26,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 23:23:26,212 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,SelfDestructingSolverStorable34 [2025-04-13 23:23:26,212 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:26,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:26,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1652651554, now seen corresponding path program 5 times [2025-04-13 23:23:26,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:26,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335245633] [2025-04-13 23:23:26,213 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:26,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:26,216 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:26,217 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:26,217 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:26,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:26,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:26,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335245633] [2025-04-13 23:23:26,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335245633] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:26,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242147050] [2025-04-13 23:23:26,281 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:26,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:26,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:26,283 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:23:26,285 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:23:26,308 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:26,317 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:26,318 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:26,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:26,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 23:23:26,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:26,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:23:26,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242147050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:26,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:23:26,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-04-13 23:23:26,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759048828] [2025-04-13 23:23:26,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:26,380 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:26,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:26,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:26,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:26,380 INFO L87 Difference]: Start difference. First operand 78 states and 179 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:23:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:26,465 INFO L93 Difference]: Finished difference Result 113 states and 252 transitions. [2025-04-13 23:23:26,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:26,465 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:23:26,469 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:26,470 INFO L225 Difference]: With dead ends: 113 [2025-04-13 23:23:26,470 INFO L226 Difference]: Without dead ends: 91 [2025-04-13 23:23:26,471 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:26,471 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:26,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:26,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-13 23:23:26,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2025-04-13 23:23:26,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.3580246913580245) internal successors, (191), 81 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have 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:23:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 191 transitions. [2025-04-13 23:23:26,488 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 191 transitions. Word has length 18 [2025-04-13 23:23:26,488 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:26,489 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 191 transitions. [2025-04-13 23:23:26,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:23:26,489 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 191 transitions. [2025-04-13 23:23:26,489 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:26,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:26,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:26,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 23:23:26,693 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,SelfDestructingSolverStorable35 [2025-04-13 23:23:26,693 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:26,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1666503824, now seen corresponding path program 6 times [2025-04-13 23:23:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:26,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49019498] [2025-04-13 23:23:26,694 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:26,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:26,697 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:26,700 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:26,700 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:23:26,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:26,782 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:23:26,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:26,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49019498] [2025-04-13 23:23:26,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49019498] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:26,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780628670] [2025-04-13 23:23:26,783 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:26,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:26,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:26,785 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:23:26,788 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:23:26,808 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:26,817 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:26,818 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:23:26,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:26,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:26,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:26,893 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:23:26,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:27,062 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:23:27,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780628670] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:27,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:27,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-04-13 23:23:27,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80633928] [2025-04-13 23:23:27,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:27,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 23:23:27,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:27,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 23:23:27,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-04-13 23:23:27,064 INFO L87 Difference]: Start difference. First operand 82 states and 191 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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:23:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:27,488 INFO L93 Difference]: Finished difference Result 236 states and 563 transitions. [2025-04-13 23:23:27,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 23:23:27,489 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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 18 [2025-04-13 23:23:27,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:27,490 INFO L225 Difference]: With dead ends: 236 [2025-04-13 23:23:27,490 INFO L226 Difference]: Without dead ends: 188 [2025-04-13 23:23:27,490 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:23:27,490 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 92 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:27,491 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 3 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:23:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-04-13 23:23:27,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 116. [2025-04-13 23:23:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.643478260869565) internal successors, (304), 115 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have 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:23:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 304 transitions. [2025-04-13 23:23:27,519 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 304 transitions. Word has length 18 [2025-04-13 23:23:27,519 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:27,519 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 304 transitions. [2025-04-13 23:23:27,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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:23:27,520 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 304 transitions. [2025-04-13 23:23:27,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:27,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:27,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:27,526 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:23:27,721 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,SelfDestructingSolverStorable36 [2025-04-13 23:23:27,721 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:27,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:27,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1500864690, now seen corresponding path program 7 times [2025-04-13 23:23:27,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:27,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645003249] [2025-04-13 23:23:27,721 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:27,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:23:27,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:27,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:27,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:27,802 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:23:27,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:27,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645003249] [2025-04-13 23:23:27,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645003249] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:27,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899279097] [2025-04-13 23:23:27,802 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:27,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:27,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:27,804 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:23:27,806 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:23:27,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:23:27,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:27,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:27,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:27,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:27,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:27,903 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:23:27,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:28,067 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:23:28,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899279097] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:28,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:28,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-04-13 23:23:28,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987973710] [2025-04-13 23:23:28,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:28,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 23:23:28,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:28,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 23:23:28,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-04-13 23:23:28,068 INFO L87 Difference]: Start difference. First operand 116 states and 304 transitions. Second operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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:23:28,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:28,568 INFO L93 Difference]: Finished difference Result 193 states and 471 transitions. [2025-04-13 23:23:28,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 23:23:28,569 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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 18 [2025-04-13 23:23:28,569 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:28,570 INFO L225 Difference]: With dead ends: 193 [2025-04-13 23:23:28,570 INFO L226 Difference]: Without dead ends: 168 [2025-04-13 23:23:28,571 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=1017, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 23:23:28,571 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:28,571 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:23:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-04-13 23:23:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 110. [2025-04-13 23:23:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.596330275229358) internal successors, (283), 109 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have 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:23:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 283 transitions. [2025-04-13 23:23:28,596 INFO L79 Accepts]: Start accepts. Automaton has 110 states and 283 transitions. Word has length 18 [2025-04-13 23:23:28,596 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:28,596 INFO L485 AbstractCegarLoop]: Abstraction has 110 states and 283 transitions. [2025-04-13 23:23:28,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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:23:28,596 INFO L278 IsEmpty]: Start isEmpty. Operand 110 states and 283 transitions. [2025-04-13 23:23:28,596 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:28,596 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:28,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:28,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 23:23:28,797 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,SelfDestructingSolverStorable37 [2025-04-13 23:23:28,797 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:28,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:28,797 INFO L85 PathProgramCache]: Analyzing trace with hash 787546162, now seen corresponding path program 8 times [2025-04-13 23:23:28,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:28,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60932936] [2025-04-13 23:23:28,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:28,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:28,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:28,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:28,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:28,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:28,885 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:23:28,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:28,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60932936] [2025-04-13 23:23:28,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60932936] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:28,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298671799] [2025-04-13 23:23:28,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:28,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:28,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:28,887 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:23:28,889 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:23:28,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:28,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:28,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:28,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:28,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:28,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:28,967 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:23:28,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:29,148 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:23:29,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298671799] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:29,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:29,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-04-13 23:23:29,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717844753] [2025-04-13 23:23:29,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:29,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 23:23:29,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:29,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 23:23:29,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:23:29,150 INFO L87 Difference]: Start difference. First operand 110 states and 283 transitions. Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:29,753 INFO L93 Difference]: Finished difference Result 225 states and 537 transitions. [2025-04-13 23:23:29,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 23:23:29,753 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:23:29,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:29,754 INFO L225 Difference]: With dead ends: 225 [2025-04-13 23:23:29,754 INFO L226 Difference]: Without dead ends: 169 [2025-04-13 23:23:29,755 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=932, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:23:29,755 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 101 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:29,755 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 6 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:23:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-04-13 23:23:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 134. [2025-04-13 23:23:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.593984962406015) internal successors, (345), 133 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have 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:23:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 345 transitions. [2025-04-13 23:23:29,787 INFO L79 Accepts]: Start accepts. Automaton has 134 states and 345 transitions. Word has length 18 [2025-04-13 23:23:29,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:29,787 INFO L485 AbstractCegarLoop]: Abstraction has 134 states and 345 transitions. [2025-04-13 23:23:29,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:29,787 INFO L278 IsEmpty]: Start isEmpty. Operand 134 states and 345 transitions. [2025-04-13 23:23:29,788 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:29,788 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:29,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:29,794 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:23:29,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:29,992 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:29,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:29,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1077880812, now seen corresponding path program 9 times [2025-04-13 23:23:29,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:29,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22856070] [2025-04-13 23:23:29,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:29,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:29,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:29,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:29,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:23:29,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:30,077 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:23:30,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:30,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22856070] [2025-04-13 23:23:30,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22856070] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:30,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537284019] [2025-04-13 23:23:30,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:30,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:30,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:30,079 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:23:30,081 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:23:30,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:30,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:30,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:23:30,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:30,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:30,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:30,160 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:23:30,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:30,373 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:23:30,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537284019] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:30,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:30,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-13 23:23:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253763892] [2025-04-13 23:23:30,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:30,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 23:23:30,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:30,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 23:23:30,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-04-13 23:23:30,375 INFO L87 Difference]: Start difference. First operand 134 states and 345 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:30,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:30,925 INFO L93 Difference]: Finished difference Result 204 states and 475 transitions. [2025-04-13 23:23:30,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 23:23:30,926 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:23:30,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:30,927 INFO L225 Difference]: With dead ends: 204 [2025-04-13 23:23:30,927 INFO L226 Difference]: Without dead ends: 169 [2025-04-13 23:23:30,928 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 23:23:30,928 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 97 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:30,928 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 3 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:23:30,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-04-13 23:23:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 138. [2025-04-13 23:23:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.576642335766423) internal successors, (353), 137 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:23:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 353 transitions. [2025-04-13 23:23:30,963 INFO L79 Accepts]: Start accepts. Automaton has 138 states and 353 transitions. Word has length 18 [2025-04-13 23:23:30,963 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:30,963 INFO L485 AbstractCegarLoop]: Abstraction has 138 states and 353 transitions. [2025-04-13 23:23:30,963 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:30,963 INFO L278 IsEmpty]: Start isEmpty. Operand 138 states and 353 transitions. [2025-04-13 23:23:30,964 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:30,964 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:30,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:30,969 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:23:31,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 23:23:31,164 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:31,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:31,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1216760876, now seen corresponding path program 10 times [2025-04-13 23:23:31,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:31,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405119312] [2025-04-13 23:23:31,165 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:31,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:31,167 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:31,168 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:31,168 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:31,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:31,242 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:23:31,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:31,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405119312] [2025-04-13 23:23:31,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405119312] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:31,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791517105] [2025-04-13 23:23:31,242 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:31,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:31,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:31,244 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:23:31,245 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:23:31,265 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:31,273 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:31,273 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:31,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:31,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:31,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:31,364 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:23:31,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:31,510 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:23:31,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791517105] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:31,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:31,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 23:23:31,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559267797] [2025-04-13 23:23:31,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:31,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:23:31,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:31,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:23:31,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:23:31,512 INFO L87 Difference]: Start difference. First operand 138 states and 353 transitions. Second operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:32,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:32,416 INFO L93 Difference]: Finished difference Result 212 states and 507 transitions. [2025-04-13 23:23:32,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 23:23:32,417 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:23:32,417 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:32,418 INFO L225 Difference]: With dead ends: 212 [2025-04-13 23:23:32,418 INFO L226 Difference]: Without dead ends: 182 [2025-04-13 23:23:32,419 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=551, Invalid=2419, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 23:23:32,419 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:32,420 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 2 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:23:32,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-04-13 23:23:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 140. [2025-04-13 23:23:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.5899280575539567) internal successors, (360), 139 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have 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:23:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 360 transitions. [2025-04-13 23:23:32,465 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 360 transitions. Word has length 18 [2025-04-13 23:23:32,465 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:32,465 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 360 transitions. [2025-04-13 23:23:32,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:32,465 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 360 transitions. [2025-04-13 23:23:32,465 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:32,465 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:32,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:32,475 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:23:32,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:32,666 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:32,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:32,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1064906232, now seen corresponding path program 11 times [2025-04-13 23:23:32,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:32,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346924270] [2025-04-13 23:23:32,667 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:32,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:32,669 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:32,670 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:32,670 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:32,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:32,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:32,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346924270] [2025-04-13 23:23:32,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346924270] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:32,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056988879] [2025-04-13 23:23:32,729 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:32,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:32,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:32,731 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:23:32,732 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:23:32,751 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:32,758 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:32,758 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:32,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:32,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 23:23:32,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:32,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:23:32,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056988879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:32,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:23:32,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-04-13 23:23:32,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187419765] [2025-04-13 23:23:32,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:32,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:32,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:32,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:32,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:32,806 INFO L87 Difference]: Start difference. First operand 140 states and 360 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:23:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:32,921 INFO L93 Difference]: Finished difference Result 178 states and 443 transitions. [2025-04-13 23:23:32,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:32,921 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:23:32,921 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:32,922 INFO L225 Difference]: With dead ends: 178 [2025-04-13 23:23:32,922 INFO L226 Difference]: Without dead ends: 154 [2025-04-13 23:23:32,922 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:32,922 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:32,923 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:32,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-04-13 23:23:32,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 123. [2025-04-13 23:23:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.540983606557377) internal successors, (310), 122 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have 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:23:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 310 transitions. [2025-04-13 23:23:32,951 INFO L79 Accepts]: Start accepts. Automaton has 123 states and 310 transitions. Word has length 18 [2025-04-13 23:23:32,951 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:32,951 INFO L485 AbstractCegarLoop]: Abstraction has 123 states and 310 transitions. [2025-04-13 23:23:32,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:23:32,951 INFO L278 IsEmpty]: Start isEmpty. Operand 123 states and 310 transitions. [2025-04-13 23:23:32,951 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:32,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:32,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:32,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 23:23:33,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:33,152 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:33,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash 480544626, now seen corresponding path program 12 times [2025-04-13 23:23:33,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:33,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956026686] [2025-04-13 23:23:33,153 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:33,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:33,155 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:33,157 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:33,158 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:23:33,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:33,238 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:23:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:33,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956026686] [2025-04-13 23:23:33,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956026686] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:33,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102814629] [2025-04-13 23:23:33,239 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:33,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:33,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:33,241 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:23:33,242 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:23:33,265 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:33,272 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:33,273 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:23:33,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:33,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:33,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:33,337 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:23:33,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:33,488 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:23:33,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102814629] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:33,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:33,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 23:23:33,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437664898] [2025-04-13 23:23:33,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:33,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 23:23:33,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:33,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 23:23:33,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:23:33,489 INFO L87 Difference]: Start difference. First operand 123 states and 310 transitions. Second operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 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:23:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:33,772 INFO L93 Difference]: Finished difference Result 198 states and 475 transitions. [2025-04-13 23:23:33,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:23:33,772 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 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 18 [2025-04-13 23:23:33,772 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:33,773 INFO L225 Difference]: With dead ends: 198 [2025-04-13 23:23:33,773 INFO L226 Difference]: Without dead ends: 164 [2025-04-13 23:23:33,774 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:23:33,774 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 60 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:33,774 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 12 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-04-13 23:23:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 141. [2025-04-13 23:23:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.5357142857142856) internal successors, (355), 140 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:23:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 355 transitions. [2025-04-13 23:23:33,812 INFO L79 Accepts]: Start accepts. Automaton has 141 states and 355 transitions. Word has length 18 [2025-04-13 23:23:33,812 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:33,812 INFO L485 AbstractCegarLoop]: Abstraction has 141 states and 355 transitions. [2025-04-13 23:23:33,813 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 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:23:33,813 INFO L278 IsEmpty]: Start isEmpty. Operand 141 states and 355 transitions. [2025-04-13 23:23:33,813 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:33,813 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:33,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:33,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 23:23:34,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:34,014 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:34,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:34,015 INFO L85 PathProgramCache]: Analyzing trace with hash 341664562, now seen corresponding path program 13 times [2025-04-13 23:23:34,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:34,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720679240] [2025-04-13 23:23:34,015 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:34,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:34,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:23:34,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:34,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:34,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:34,091 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:23:34,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:34,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720679240] [2025-04-13 23:23:34,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720679240] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:34,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639194762] [2025-04-13 23:23:34,091 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:34,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:34,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:34,093 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:23:34,094 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:23:34,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:23:34,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:34,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:34,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:34,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:34,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:34,193 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:23:34,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:34,337 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:23:34,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639194762] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:34,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:34,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 23:23:34,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142107481] [2025-04-13 23:23:34,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:34,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 23:23:34,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:34,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 23:23:34,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:23:34,338 INFO L87 Difference]: Start difference. First operand 141 states and 355 transitions. Second operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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:23:34,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:34,631 INFO L93 Difference]: Finished difference Result 164 states and 395 transitions. [2025-04-13 23:23:34,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:23:34,631 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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 18 [2025-04-13 23:23:34,631 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:34,632 INFO L225 Difference]: With dead ends: 164 [2025-04-13 23:23:34,632 INFO L226 Difference]: Without dead ends: 123 [2025-04-13 23:23:34,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2025-04-13 23:23:34,633 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 48 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:34,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 7 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-04-13 23:23:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2025-04-13 23:23:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 2.5084745762711864) internal successors, (296), 118 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have 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:23:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 296 transitions. [2025-04-13 23:23:34,668 INFO L79 Accepts]: Start accepts. Automaton has 119 states and 296 transitions. Word has length 18 [2025-04-13 23:23:34,668 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:34,668 INFO L485 AbstractCegarLoop]: Abstraction has 119 states and 296 transitions. [2025-04-13 23:23:34,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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:23:34,668 INFO L278 IsEmpty]: Start isEmpty. Operand 119 states and 296 transitions. [2025-04-13 23:23:34,668 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:34,668 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:34,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:34,675 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:23:34,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:34,869 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:34,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash 151411852, now seen corresponding path program 14 times [2025-04-13 23:23:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:34,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379469481] [2025-04-13 23:23:34,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:34,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:34,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:34,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:34,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:34,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:34,956 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:23:34,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:34,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379469481] [2025-04-13 23:23:34,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379469481] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:34,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171230345] [2025-04-13 23:23:34,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:34,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:34,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:34,959 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:23:34,960 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:23:34,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:34,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:34,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:34,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:34,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:34,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:35,076 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:23:35,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:35,205 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:23:35,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171230345] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:35,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:35,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 23:23:35,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668036825] [2025-04-13 23:23:35,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:35,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:23:35,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:35,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:23:35,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:23:35,206 INFO L87 Difference]: Start difference. First operand 119 states and 296 transitions. Second operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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:23:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:35,498 INFO L93 Difference]: Finished difference Result 179 states and 415 transitions. [2025-04-13 23:23:35,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:23:35,499 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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 18 [2025-04-13 23:23:35,499 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:35,500 INFO L225 Difference]: With dead ends: 179 [2025-04-13 23:23:35,500 INFO L226 Difference]: Without dead ends: 163 [2025-04-13 23:23:35,501 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:23:35,501 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:35,501 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 5 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:23:35,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-04-13 23:23:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2025-04-13 23:23:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.5080645161290325) internal successors, (311), 124 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:23:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 311 transitions. [2025-04-13 23:23:35,539 INFO L79 Accepts]: Start accepts. Automaton has 125 states and 311 transitions. Word has length 18 [2025-04-13 23:23:35,539 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:35,539 INFO L485 AbstractCegarLoop]: Abstraction has 125 states and 311 transitions. [2025-04-13 23:23:35,539 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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:23:35,539 INFO L278 IsEmpty]: Start isEmpty. Operand 125 states and 311 transitions. [2025-04-13 23:23:35,540 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:35,540 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:35,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:35,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-13 23:23:35,740 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,SelfDestructingSolverStorable44 [2025-04-13 23:23:35,740 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:35,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:35,741 INFO L85 PathProgramCache]: Analyzing trace with hash -14227282, now seen corresponding path program 15 times [2025-04-13 23:23:35,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:35,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12207673] [2025-04-13 23:23:35,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:35,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:35,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:35,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:35,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:23:35,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:35,810 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:23:35,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:35,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12207673] [2025-04-13 23:23:35,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12207673] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:35,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393872460] [2025-04-13 23:23:35,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:35,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:35,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:35,812 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:23:35,814 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:23:35,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:35,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:35,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:23:35,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:35,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:35,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:35,994 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:23:35,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:36,132 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:23:36,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393872460] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:36,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:36,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 23:23:36,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116583425] [2025-04-13 23:23:36,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:36,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:23:36,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:36,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:23:36,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:23:36,133 INFO L87 Difference]: Start difference. First operand 125 states and 311 transitions. Second operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:36,366 INFO L93 Difference]: Finished difference Result 158 states and 378 transitions. [2025-04-13 23:23:36,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:23:36,366 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:23:36,367 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:36,367 INFO L225 Difference]: With dead ends: 158 [2025-04-13 23:23:36,367 INFO L226 Difference]: Without dead ends: 137 [2025-04-13 23:23:36,368 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2025-04-13 23:23:36,368 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:36,368 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-04-13 23:23:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2025-04-13 23:23:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.456140350877193) internal successors, (280), 114 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have 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:23:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 280 transitions. [2025-04-13 23:23:36,394 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 280 transitions. Word has length 18 [2025-04-13 23:23:36,394 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:36,394 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 280 transitions. [2025-04-13 23:23:36,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:36,394 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 280 transitions. [2025-04-13 23:23:36,394 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:36,394 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:36,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:36,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-13 23:23:36,599 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,SelfDestructingSolverStorable45 [2025-04-13 23:23:36,599 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:36,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:36,599 INFO L85 PathProgramCache]: Analyzing trace with hash -446802024, now seen corresponding path program 16 times [2025-04-13 23:23:36,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:36,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976465145] [2025-04-13 23:23:36,599 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:36,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:36,601 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:36,603 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:36,603 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:36,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:36,678 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:23:36,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:36,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976465145] [2025-04-13 23:23:36,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976465145] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:36,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376103082] [2025-04-13 23:23:36,678 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:36,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:36,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:36,680 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:23:36,681 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:23:36,701 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:36,709 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:36,709 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:36,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:36,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:36,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:36,795 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:23:36,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:36,928 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:23:36,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376103082] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:36,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:36,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 23:23:36,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263253080] [2025-04-13 23:23:36,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:36,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 23:23:36,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:36,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 23:23:36,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:23:36,930 INFO L87 Difference]: Start difference. First operand 115 states and 280 transitions. Second operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:37,213 INFO L93 Difference]: Finished difference Result 199 states and 457 transitions. [2025-04-13 23:23:37,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:23:37,214 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:23:37,214 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:37,215 INFO L225 Difference]: With dead ends: 199 [2025-04-13 23:23:37,215 INFO L226 Difference]: Without dead ends: 159 [2025-04-13 23:23:37,215 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=979, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:23:37,215 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 90 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:37,216 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 4 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-04-13 23:23:37,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2025-04-13 23:23:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.425) internal successors, (291), 120 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have 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:23:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 291 transitions. [2025-04-13 23:23:37,246 INFO L79 Accepts]: Start accepts. Automaton has 121 states and 291 transitions. Word has length 18 [2025-04-13 23:23:37,246 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:37,246 INFO L485 AbstractCegarLoop]: Abstraction has 121 states and 291 transitions. [2025-04-13 23:23:37,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:37,246 INFO L278 IsEmpty]: Start isEmpty. Operand 121 states and 291 transitions. [2025-04-13 23:23:37,246 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:37,246 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:37,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:37,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 23:23:37,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:37,447 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:37,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:37,447 INFO L85 PathProgramCache]: Analyzing trace with hash -420042954, now seen corresponding path program 17 times [2025-04-13 23:23:37,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:37,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117777988] [2025-04-13 23:23:37,447 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:37,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:37,449 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:37,450 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:37,450 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:37,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:37,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:37,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117777988] [2025-04-13 23:23:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117777988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:37,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419457218] [2025-04-13 23:23:37,504 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:37,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:37,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:37,507 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:23:37,508 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:23:37,529 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:37,536 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:37,536 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:37,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:37,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 23:23:37,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:37,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:23:37,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419457218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:37,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:23:37,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-04-13 23:23:37,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264270556] [2025-04-13 23:23:37,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:37,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:37,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:37,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:37,597 INFO L87 Difference]: Start difference. First operand 121 states and 291 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:23:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:37,708 INFO L93 Difference]: Finished difference Result 152 states and 349 transitions. [2025-04-13 23:23:37,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:37,709 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:23:37,709 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:37,710 INFO L225 Difference]: With dead ends: 152 [2025-04-13 23:23:37,710 INFO L226 Difference]: Without dead ends: 134 [2025-04-13 23:23:37,710 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:37,710 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:37,710 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-04-13 23:23:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 127. [2025-04-13 23:23:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.3968253968253967) internal successors, (302), 126 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have 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:23:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 302 transitions. [2025-04-13 23:23:37,750 INFO L79 Accepts]: Start accepts. Automaton has 127 states and 302 transitions. Word has length 18 [2025-04-13 23:23:37,750 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:37,750 INFO L485 AbstractCegarLoop]: Abstraction has 127 states and 302 transitions. [2025-04-13 23:23:37,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:23:37,750 INFO L278 IsEmpty]: Start isEmpty. Operand 127 states and 302 transitions. [2025-04-13 23:23:37,750 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:37,750 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:37,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:37,758 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:23:37,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:37,955 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:37,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash -585682088, now seen corresponding path program 18 times [2025-04-13 23:23:37,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:37,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680661015] [2025-04-13 23:23:37,955 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:37,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:37,957 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:37,958 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:37,959 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:23:37,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:38,019 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:23:38,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:38,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680661015] [2025-04-13 23:23:38,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680661015] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:38,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602022854] [2025-04-13 23:23:38,019 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:38,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:38,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:38,021 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:23:38,022 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:23:38,042 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:38,048 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:38,049 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:23:38,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:38,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:38,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:38,119 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:23:38,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:38,235 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:23:38,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602022854] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:38,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:38,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 23:23:38,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188702042] [2025-04-13 23:23:38,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:38,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:23:38,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:38,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:23:38,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:23:38,236 INFO L87 Difference]: Start difference. First operand 127 states and 302 transitions. Second operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:38,467 INFO L93 Difference]: Finished difference Result 170 states and 375 transitions. [2025-04-13 23:23:38,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:23:38,467 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:23:38,468 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:38,468 INFO L225 Difference]: With dead ends: 170 [2025-04-13 23:23:38,468 INFO L226 Difference]: Without dead ends: 133 [2025-04-13 23:23:38,469 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:23:38,469 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 67 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:38,469 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 7 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-04-13 23:23:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 99. [2025-04-13 23:23:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 2.2244897959183674) internal successors, (218), 98 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have 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:23:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 218 transitions. [2025-04-13 23:23:38,492 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 218 transitions. Word has length 18 [2025-04-13 23:23:38,492 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:38,492 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 218 transitions. [2025-04-13 23:23:38,492 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:38,492 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 218 transitions. [2025-04-13 23:23:38,492 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:38,493 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:38,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:38,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 23:23:38,693 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,SelfDestructingSolverStorable48 [2025-04-13 23:23:38,693 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:38,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1728753582, now seen corresponding path program 19 times [2025-04-13 23:23:38,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:38,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997201995] [2025-04-13 23:23:38,694 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:38,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:38,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:23:38,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:38,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:38,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:38,768 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:23:38,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:38,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997201995] [2025-04-13 23:23:38,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997201995] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:38,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534372342] [2025-04-13 23:23:38,768 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:38,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:38,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:38,770 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:23:38,770 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:23:38,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:23:38,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:38,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:38,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:38,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:38,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:38,871 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:23:38,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:38,997 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:23:38,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534372342] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:38,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:38,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 23:23:38,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156057382] [2025-04-13 23:23:38,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:38,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:23:38,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:38,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:23:38,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:23:38,998 INFO L87 Difference]: Start difference. First operand 99 states and 218 transitions. Second operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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:23:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:39,231 INFO L93 Difference]: Finished difference Result 121 states and 254 transitions. [2025-04-13 23:23:39,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:23:39,232 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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 18 [2025-04-13 23:23:39,232 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:39,232 INFO L225 Difference]: With dead ends: 121 [2025-04-13 23:23:39,232 INFO L226 Difference]: Without dead ends: 97 [2025-04-13 23:23:39,233 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:23:39,233 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 51 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:39,233 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 5 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-13 23:23:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2025-04-13 23:23:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.2065217391304346) internal successors, (203), 92 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 203 transitions. [2025-04-13 23:23:39,252 INFO L79 Accepts]: Start accepts. Automaton has 93 states and 203 transitions. Word has length 18 [2025-04-13 23:23:39,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:39,252 INFO L485 AbstractCegarLoop]: Abstraction has 93 states and 203 transitions. [2025-04-13 23:23:39,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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:23:39,252 INFO L278 IsEmpty]: Start isEmpty. Operand 93 states and 203 transitions. [2025-04-13 23:23:39,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:39,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:39,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:39,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 23:23:39,453 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,SelfDestructingSolverStorable49 [2025-04-13 23:23:39,453 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:39,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash 669742620, now seen corresponding path program 20 times [2025-04-13 23:23:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:39,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440569688] [2025-04-13 23:23:39,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:39,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:39,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:39,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:39,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:39,528 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:23:39,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:39,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440569688] [2025-04-13 23:23:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440569688] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:39,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950936055] [2025-04-13 23:23:39,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:39,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:39,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:39,530 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:23:39,531 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:23:39,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:39,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:39,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:39,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:39,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:39,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:39,629 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:23:39,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:39,763 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:23:39,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950936055] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:39,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:39,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 23:23:39,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296616008] [2025-04-13 23:23:39,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:39,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:23:39,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:39,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:23:39,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:23:39,764 INFO L87 Difference]: Start difference. First operand 93 states and 203 transitions. Second operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:40,358 INFO L93 Difference]: Finished difference Result 246 states and 512 transitions. [2025-04-13 23:23:40,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 23:23:40,358 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:23:40,358 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:40,359 INFO L225 Difference]: With dead ends: 246 [2025-04-13 23:23:40,359 INFO L226 Difference]: Without dead ends: 167 [2025-04-13 23:23:40,360 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 23:23:40,360 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 97 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:40,360 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 22 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:23:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-04-13 23:23:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 77. [2025-04-13 23:23:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 2.039473684210526) internal successors, (155), 76 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have 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:23:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 155 transitions. [2025-04-13 23:23:40,375 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 155 transitions. Word has length 18 [2025-04-13 23:23:40,375 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:40,375 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 155 transitions. [2025-04-13 23:23:40,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:40,375 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 155 transitions. [2025-04-13 23:23:40,375 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:40,376 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:40,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:40,382 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:23:40,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2025-04-13 23:23:40,576 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:40,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:40,576 INFO L85 PathProgramCache]: Analyzing trace with hash 689301980, now seen corresponding path program 21 times [2025-04-13 23:23:40,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:40,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579616310] [2025-04-13 23:23:40,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:40,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:40,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:40,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:40,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:23:40,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:40,665 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:23:40,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:40,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579616310] [2025-04-13 23:23:40,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579616310] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:40,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462789067] [2025-04-13 23:23:40,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:40,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:40,667 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:23:40,668 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:23:40,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:40,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:40,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:23:40,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:40,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:40,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:40,779 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:23:40,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:40,898 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:23:40,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462789067] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:40,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:40,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 23:23:40,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008858111] [2025-04-13 23:23:40,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:40,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:23:40,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:40,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:23:40,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:23:40,899 INFO L87 Difference]: Start difference. First operand 77 states and 155 transitions. Second operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:41,116 INFO L93 Difference]: Finished difference Result 120 states and 228 transitions. [2025-04-13 23:23:41,116 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:23:41,116 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:23:41,116 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:41,117 INFO L225 Difference]: With dead ends: 120 [2025-04-13 23:23:41,117 INFO L226 Difference]: Without dead ends: 100 [2025-04-13 23:23:41,117 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:23:41,118 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 49 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:41,118 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 4 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:41,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-13 23:23:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 77. [2025-04-13 23:23:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 2.013157894736842) internal successors, (153), 76 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have 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:23:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 153 transitions. [2025-04-13 23:23:41,133 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 153 transitions. Word has length 18 [2025-04-13 23:23:41,133 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:41,133 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 153 transitions. [2025-04-13 23:23:41,133 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:41,133 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 153 transitions. [2025-04-13 23:23:41,133 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:41,133 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:41,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:41,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 23:23:41,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:41,334 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:41,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:41,334 INFO L85 PathProgramCache]: Analyzing trace with hash 716061050, now seen corresponding path program 22 times [2025-04-13 23:23:41,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:41,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424489079] [2025-04-13 23:23:41,334 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:41,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:41,336 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:41,337 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:41,337 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:41,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:41,402 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:23:41,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:41,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424489079] [2025-04-13 23:23:41,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424489079] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:41,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341409417] [2025-04-13 23:23:41,402 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:41,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:41,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:41,404 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:23:41,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 23:23:41,425 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:41,432 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:41,433 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:41,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:41,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:41,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:41,529 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:23:41,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:41,679 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:23:41,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341409417] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:41,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:41,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 23:23:41,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135890762] [2025-04-13 23:23:41,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:41,679 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:23:41,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:41,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:23:41,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:23:41,680 INFO L87 Difference]: Start difference. First operand 77 states and 153 transitions. Second operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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:23:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:41,859 INFO L93 Difference]: Finished difference Result 112 states and 210 transitions. [2025-04-13 23:23:41,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:23:41,859 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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 18 [2025-04-13 23:23:41,859 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:41,860 INFO L225 Difference]: With dead ends: 112 [2025-04-13 23:23:41,860 INFO L226 Difference]: Without dead ends: 94 [2025-04-13 23:23:41,860 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2025-04-13 23:23:41,861 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:41,861 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 10 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-04-13 23:23:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2025-04-13 23:23:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 2.0) internal successors, (148), 74 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have 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:23:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 148 transitions. [2025-04-13 23:23:41,875 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 148 transitions. Word has length 18 [2025-04-13 23:23:41,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:41,875 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 148 transitions. [2025-04-13 23:23:41,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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:23:41,875 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 148 transitions. [2025-04-13 23:23:41,875 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:41,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:41,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:41,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 23:23:42,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:42,076 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:42,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:42,076 INFO L85 PathProgramCache]: Analyzing trace with hash 550421916, now seen corresponding path program 23 times [2025-04-13 23:23:42,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:42,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049402466] [2025-04-13 23:23:42,076 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:42,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:42,078 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:42,079 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:42,079 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:42,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:42,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:42,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049402466] [2025-04-13 23:23:42,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049402466] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:42,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8321847] [2025-04-13 23:23:42,130 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:42,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:42,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:42,132 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:23:42,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 23:23:42,154 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:42,160 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:42,161 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:42,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:42,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 23:23:42,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:42,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:23:42,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8321847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:42,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:23:42,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2025-04-13 23:23:42,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476350312] [2025-04-13 23:23:42,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:42,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:42,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:42,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:23:42,206 INFO L87 Difference]: Start difference. First operand 75 states and 148 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:23:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:42,294 INFO L93 Difference]: Finished difference Result 94 states and 178 transitions. [2025-04-13 23:23:42,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:42,294 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:23:42,294 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:42,295 INFO L225 Difference]: With dead ends: 94 [2025-04-13 23:23:42,295 INFO L226 Difference]: Without dead ends: 57 [2025-04-13 23:23:42,295 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:23:42,295 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:42,295 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 7 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-13 23:23:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-04-13 23:23:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.9107142857142858) internal successors, (107), 56 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have 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:23:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 107 transitions. [2025-04-13 23:23:42,304 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 107 transitions. Word has length 18 [2025-04-13 23:23:42,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:42,304 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 107 transitions. [2025-04-13 23:23:42,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:23:42,304 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 107 transitions. [2025-04-13 23:23:42,305 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:42,305 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:42,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:42,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 23:23:42,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:42,505 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:42,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1033670128, now seen corresponding path program 24 times [2025-04-13 23:23:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:42,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814489111] [2025-04-13 23:23:42,506 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:42,507 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:42,509 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:42,509 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:23:42,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:42,584 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:23:42,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:42,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814489111] [2025-04-13 23:23:42,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814489111] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:42,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036822081] [2025-04-13 23:23:42,585 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:42,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:42,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:42,587 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:23:42,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 23:23:42,609 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:42,617 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:42,617 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:23:42,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:42,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:42,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:42,706 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:23:42,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:42,828 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:23:42,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036822081] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:42,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:42,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 23:23:42,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975847192] [2025-04-13 23:23:42,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:42,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 23:23:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:42,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 23:23:42,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:23:42,829 INFO L87 Difference]: Start difference. First operand 57 states and 107 transitions. Second operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:43,165 INFO L93 Difference]: Finished difference Result 156 states and 290 transitions. [2025-04-13 23:23:43,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:23:43,165 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:23:43,165 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:43,166 INFO L225 Difference]: With dead ends: 156 [2025-04-13 23:23:43,166 INFO L226 Difference]: Without dead ends: 116 [2025-04-13 23:23:43,167 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=1020, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:23:43,167 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:43,167 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 2 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:23:43,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-13 23:23:43,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2025-04-13 23:23:43,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 2.013888888888889) internal successors, (145), 72 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have 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:23:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 145 transitions. [2025-04-13 23:23:43,180 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 145 transitions. Word has length 18 [2025-04-13 23:23:43,180 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:43,180 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 145 transitions. [2025-04-13 23:23:43,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:43,180 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 145 transitions. [2025-04-13 23:23:43,180 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:43,180 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:43,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:43,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 23:23:43,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-04-13 23:23:43,381 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:43,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1199309262, now seen corresponding path program 25 times [2025-04-13 23:23:43,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:43,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528569652] [2025-04-13 23:23:43,381 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:43,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:43,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:23:43,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:43,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:43,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:43,441 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:23:43,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:43,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528569652] [2025-04-13 23:23:43,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528569652] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:43,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519385262] [2025-04-13 23:23:43,442 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:43,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:43,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:43,444 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:23:43,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 23:23:43,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:23:43,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:43,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:43,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:43,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:43,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:43,533 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:23:43,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:43,667 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:23:43,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519385262] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:43,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:43,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-04-13 23:23:43,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777091739] [2025-04-13 23:23:43,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:43,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 23:23:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:43,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 23:23:43,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-04-13 23:23:43,668 INFO L87 Difference]: Start difference. First operand 73 states and 145 transitions. Second operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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:23:43,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:43,966 INFO L93 Difference]: Finished difference Result 111 states and 216 transitions. [2025-04-13 23:23:43,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:23:43,966 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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 18 [2025-04-13 23:23:43,966 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:43,967 INFO L225 Difference]: With dead ends: 111 [2025-04-13 23:23:43,967 INFO L226 Difference]: Without dead ends: 81 [2025-04-13 23:23:43,967 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=250, Invalid=872, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:23:43,967 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:43,967 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:43,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-04-13 23:23:43,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2025-04-13 23:23:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 72 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have 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:23:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 143 transitions. [2025-04-13 23:23:43,981 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 143 transitions. Word has length 18 [2025-04-13 23:23:43,981 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:43,981 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 143 transitions. [2025-04-13 23:23:43,981 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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:23:43,981 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 143 transitions. [2025-04-13 23:23:43,981 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:23:43,981 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:43,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:43,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 23:23:44,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:44,182 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:44,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:44,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1631884004, now seen corresponding path program 26 times [2025-04-13 23:23:44,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:44,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351427280] [2025-04-13 23:23:44,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:44,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:44,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:44,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:44,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:44,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:44,241 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:23:44,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:44,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351427280] [2025-04-13 23:23:44,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351427280] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:44,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352210183] [2025-04-13 23:23:44,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:44,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:44,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:44,243 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:23:44,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 23:23:44,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:23:44,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:23:44,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:44,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:44,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:23:44,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:44,352 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:23:44,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:44,468 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:23:44,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352210183] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:44,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:44,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 23:23:44,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686401751] [2025-04-13 23:23:44,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:44,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 23:23:44,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:44,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 23:23:44,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:23:44,469 INFO L87 Difference]: Start difference. First operand 73 states and 143 transitions. Second operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:44,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:44,829 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2025-04-13 23:23:44,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 23:23:44,829 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:23:44,829 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:44,830 INFO L225 Difference]: With dead ends: 137 [2025-04-13 23:23:44,830 INFO L226 Difference]: Without dead ends: 90 [2025-04-13 23:23:44,830 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 23:23:44,830 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 96 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:44,831 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 4 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:23:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-13 23:23:44,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 69. [2025-04-13 23:23:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 68 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have 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:23:44,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 129 transitions. [2025-04-13 23:23:44,842 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 129 transitions. Word has length 18 [2025-04-13 23:23:44,842 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:44,842 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 129 transitions. [2025-04-13 23:23:44,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:44,842 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 129 transitions. [2025-04-13 23:23:44,843 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 23:23:44,843 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:44,843 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:44,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 23:23:45,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:45,043 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:45,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:45,044 INFO L85 PathProgramCache]: Analyzing trace with hash -290142608, now seen corresponding path program 27 times [2025-04-13 23:23:45,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:45,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126088871] [2025-04-13 23:23:45,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:45,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:45,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 23:23:45,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:23:45,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:23:45,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:45,079 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:23:45,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:45,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126088871] [2025-04-13 23:23:45,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126088871] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:45,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322648076] [2025-04-13 23:23:45,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:45,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:45,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:45,081 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:23:45,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 23:23:45,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 23:23:45,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:23:45,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:23:45,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:45,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:23:45,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:45,122 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:23:45,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:45,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:45,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322648076] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:45,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:45,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-04-13 23:23:45,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032832926] [2025-04-13 23:23:45,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:45,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:23:45,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:45,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:23:45,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:45,160 INFO L87 Difference]: Start difference. First operand 69 states and 129 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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:23:45,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:45,253 INFO L93 Difference]: Finished difference Result 110 states and 207 transitions. [2025-04-13 23:23:45,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:23:45,253 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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 19 [2025-04-13 23:23:45,253 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:45,254 INFO L225 Difference]: With dead ends: 110 [2025-04-13 23:23:45,254 INFO L226 Difference]: Without dead ends: 73 [2025-04-13 23:23:45,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:23:45,255 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 41 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:45,255 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-13 23:23:45,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-04-13 23:23:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 72 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have 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:23:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 136 transitions. [2025-04-13 23:23:45,266 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 136 transitions. Word has length 19 [2025-04-13 23:23:45,266 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:45,266 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 136 transitions. [2025-04-13 23:23:45,266 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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:23:45,267 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 136 transitions. [2025-04-13 23:23:45,267 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:23:45,267 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:45,267 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:45,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 23:23:45,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-04-13 23:23:45,467 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:45,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:45,468 INFO L85 PathProgramCache]: Analyzing trace with hash -421817653, now seen corresponding path program 28 times [2025-04-13 23:23:45,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:45,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249945709] [2025-04-13 23:23:45,468 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:45,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:45,470 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:23:45,471 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:23:45,471 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:45,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:45,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:45,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249945709] [2025-04-13 23:23:45,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249945709] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:45,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002586296] [2025-04-13 23:23:45,551 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:45,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:45,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:45,553 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:23:45,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 23:23:45,573 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:23:45,582 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:23:45,582 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:45,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:45,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:23:45,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:45,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:45,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002586296] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:45,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:45,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-04-13 23:23:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026028327] [2025-04-13 23:23:45,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:45,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 23:23:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:45,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 23:23:45,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-04-13 23:23:45,898 INFO L87 Difference]: Start difference. First operand 73 states and 136 transitions. Second operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:46,110 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2025-04-13 23:23:46,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:46,110 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:23:46,111 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:46,111 INFO L225 Difference]: With dead ends: 105 [2025-04-13 23:23:46,111 INFO L226 Difference]: Without dead ends: 89 [2025-04-13 23:23:46,111 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 23:23:46,112 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:46,112 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-13 23:23:46,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2025-04-13 23:23:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.9) internal successors, (133), 70 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have 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:23:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 133 transitions. [2025-04-13 23:23:46,124 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 133 transitions. Word has length 20 [2025-04-13 23:23:46,124 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:46,124 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 133 transitions. [2025-04-13 23:23:46,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:46,125 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 133 transitions. [2025-04-13 23:23:46,125 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:23:46,125 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:46,125 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:46,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 23:23:46,325 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-13 23:23:46,325 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:46,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:46,326 INFO L85 PathProgramCache]: Analyzing trace with hash -587456787, now seen corresponding path program 29 times [2025-04-13 23:23:46,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:46,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466583650] [2025-04-13 23:23:46,326 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:46,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:46,328 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:23:46,329 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:23:46,329 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:46,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:23:46,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:46,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466583650] [2025-04-13 23:23:46,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466583650] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:46,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699026022] [2025-04-13 23:23:46,373 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:46,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:46,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:46,374 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:23:46,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 23:23:46,395 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:23:46,402 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:23:46,403 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:46,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:46,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 23:23:46,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:23:46,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:23:46,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699026022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:46,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:23:46,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-04-13 23:23:46,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201054747] [2025-04-13 23:23:46,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:46,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:23:46,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:46,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:23:46,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:46,454 INFO L87 Difference]: Start difference. First operand 71 states and 133 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:23:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:46,515 INFO L93 Difference]: Finished difference Result 90 states and 163 transitions. [2025-04-13 23:23:46,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:46,516 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:23:46,516 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:46,516 INFO L225 Difference]: With dead ends: 90 [2025-04-13 23:23:46,516 INFO L226 Difference]: Without dead ends: 69 [2025-04-13 23:23:46,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:23:46,517 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:46,517 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:23:46,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-13 23:23:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-04-13 23:23:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 68 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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:23:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 126 transitions. [2025-04-13 23:23:46,528 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 126 transitions. Word has length 20 [2025-04-13 23:23:46,528 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:46,528 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 126 transitions. [2025-04-13 23:23:46,529 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:23:46,529 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 126 transitions. [2025-04-13 23:23:46,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:23:46,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:46,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:46,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-04-13 23:23:46,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-04-13 23:23:46,730 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:46,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:46,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1020031529, now seen corresponding path program 30 times [2025-04-13 23:23:46,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:46,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033333194] [2025-04-13 23:23:46,730 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:46,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:46,732 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:23:46,733 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:23:46,733 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:23:46,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:46,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:46,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033333194] [2025-04-13 23:23:46,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033333194] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:46,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702434806] [2025-04-13 23:23:46,809 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:46,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:46,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:46,811 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:23:46,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 23:23:46,831 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:23:46,837 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:23:46,838 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:23:46,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:46,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:23:46,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:46,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:47,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702434806] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:47,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:47,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 23:23:47,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012814010] [2025-04-13 23:23:47,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:47,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 23:23:47,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:47,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 23:23:47,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2025-04-13 23:23:47,087 INFO L87 Difference]: Start difference. First operand 69 states and 126 transitions. Second operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:47,326 INFO L93 Difference]: Finished difference Result 97 states and 168 transitions. [2025-04-13 23:23:47,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:47,326 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:23:47,326 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:47,327 INFO L225 Difference]: With dead ends: 97 [2025-04-13 23:23:47,327 INFO L226 Difference]: Without dead ends: 77 [2025-04-13 23:23:47,328 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:23:47,328 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:47,328 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:47,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-13 23:23:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2025-04-13 23:23:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.8125) internal successors, (116), 64 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 116 transitions. [2025-04-13 23:23:47,341 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 116 transitions. Word has length 20 [2025-04-13 23:23:47,341 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:47,341 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 116 transitions. [2025-04-13 23:23:47,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:47,342 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 116 transitions. [2025-04-13 23:23:47,342 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:23:47,342 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:47,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:47,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 23:23:47,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:47,543 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:47,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:47,543 INFO L85 PathProgramCache]: Analyzing trace with hash -993272459, now seen corresponding path program 31 times [2025-04-13 23:23:47,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:47,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114622706] [2025-04-13 23:23:47,543 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:47,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:47,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 23:23:47,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:23:47,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:47,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:47,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:47,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114622706] [2025-04-13 23:23:47,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114622706] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:47,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764233764] [2025-04-13 23:23:47,631 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:47,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:47,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:47,634 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:23:47,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 23:23:47,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 23:23:47,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:23:47,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:47,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:47,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:23:47,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:47,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:47,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764233764] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:47,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:47,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 23:23:47,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108675755] [2025-04-13 23:23:47,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:47,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 23:23:47,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:47,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 23:23:47,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2025-04-13 23:23:47,990 INFO L87 Difference]: Start difference. First operand 65 states and 116 transitions. Second operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:23:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:48,236 INFO L93 Difference]: Finished difference Result 77 states and 133 transitions. [2025-04-13 23:23:48,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:23:48,239 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:23:48,239 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:48,240 INFO L225 Difference]: With dead ends: 77 [2025-04-13 23:23:48,240 INFO L226 Difference]: Without dead ends: 61 [2025-04-13 23:23:48,240 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=1005, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:23:48,240 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:48,240 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-13 23:23:48,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2025-04-13 23:23:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 52 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 92 transitions. [2025-04-13 23:23:48,249 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 92 transitions. Word has length 20 [2025-04-13 23:23:48,249 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:48,249 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 92 transitions. [2025-04-13 23:23:48,249 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:23:48,249 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 92 transitions. [2025-04-13 23:23:48,249 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:23:48,249 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:48,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:48,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 23:23:48,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:48,452 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:23:48,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1158911593, now seen corresponding path program 32 times [2025-04-13 23:23:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:48,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655146786] [2025-04-13 23:23:48,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:48,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:23:48,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:23:48,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:48,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:48,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:48,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655146786] [2025-04-13 23:23:48,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655146786] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:48,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60746556] [2025-04-13 23:23:48,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:48,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:48,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:48,573 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:23:48,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 23:23:48,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:23:48,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:23:48,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:48,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:48,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:23:48,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:48,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:48,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60746556] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:48,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:48,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 23:23:48,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121805812] [2025-04-13 23:23:48,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:48,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 23:23:48,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:48,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 23:23:48,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2025-04-13 23:23:48,879 INFO L87 Difference]: Start difference. First operand 53 states and 92 transitions. Second operand has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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:23:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:49,082 INFO L93 Difference]: Finished difference Result 55 states and 95 transitions. [2025-04-13 23:23:49,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:23:49,083 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:23:49,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:49,083 INFO L225 Difference]: With dead ends: 55 [2025-04-13 23:23:49,083 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 23:23:49,084 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=1016, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:23:49,084 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:49,084 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:49,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 23:23:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 23:23:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 23:23:49,084 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2025-04-13 23:23:49,084 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:49,084 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 23:23:49,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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:23:49,084 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 23:23:49,085 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 23:23:49,087 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 23:23:49,087 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 23:23:49,087 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 23:23:49,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-04-13 23:23:49,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2025-04-13 23:23:49,290 INFO L422 BasicCegarLoop]: Path program histogram: [32, 19, 6, 6] [2025-04-13 23:23:49,291 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:23:49,291 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:23:49,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:23:49 BasicIcfg [2025-04-13 23:23:49,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:23:49,293 INFO L158 Benchmark]: Toolchain (without parser) took 38520.14ms. Allocated memory was 125.8MB in the beginning and 184.5MB in the end (delta: 58.7MB). Free memory was 88.0MB in the beginning and 140.2MB in the end (delta: -52.2MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. [2025-04-13 23:23:49,294 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:23:49,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.36ms. Allocated memory is still 125.8MB. Free memory was 88.0MB in the beginning and 73.8MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 23:23:49,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.58ms. Allocated memory is still 125.8MB. Free memory was 73.8MB in the beginning and 72.4MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:23:49,294 INFO L158 Benchmark]: Boogie Preprocessor took 30.37ms. Allocated memory is still 125.8MB. Free memory was 72.4MB in the beginning and 70.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:23:49,294 INFO L158 Benchmark]: IcfgBuilder took 363.43ms. Allocated memory is still 125.8MB. Free memory was 70.5MB in the beginning and 49.5MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 23:23:49,294 INFO L158 Benchmark]: TraceAbstraction took 37846.63ms. Allocated memory was 125.8MB in the beginning and 184.5MB in the end (delta: 58.7MB). Free memory was 49.5MB in the beginning and 140.2MB in the end (delta: -90.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:23:49,294 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.36ms. Allocated memory is still 125.8MB. Free memory was 88.0MB in the beginning and 73.8MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.58ms. Allocated memory is still 125.8MB. Free memory was 73.8MB in the beginning and 72.4MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.37ms. Allocated memory is still 125.8MB. Free memory was 72.4MB in the beginning and 70.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 363.43ms. Allocated memory is still 125.8MB. Free memory was 70.5MB in the beginning and 49.5MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 37846.63ms. Allocated memory was 125.8MB in the beginning and 184.5MB in the end (delta: 58.7MB). Free memory was 49.5MB in the beginning and 140.2MB in the end (delta: -90.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 74]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 32 locations, 35 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 37.8s, OverallIterations: 63, TraceHistogramMax: 2, PathProgramHistogramMax: 32, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3177 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3177 mSDsluCounter, 410 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 684 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21140 IncrementalHoareTripleChecker+Invalid, 21824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 684 mSolverCounterUnsat, 105 mSDtfsCounter, 21140 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2136 GetRequests, 913 SyntacticMatches, 9 SemanticMatches, 1214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8347 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=43, InterpolantAutomatonStates: 781, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 63 MinimizatonAttempts, 1962 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 1784 NumberOfCodeBlocks, 1784 NumberOfCodeBlocksAsserted, 171 NumberOfCheckSat, 2247 ConstructedInterpolants, 0 QuantifiedInterpolants, 12876 SizeOfPredicates, 121 NumberOfNonLiveVariables, 3663 ConjunctsInSsa, 467 ConjunctsInUnsatCore, 134 InterpolantComputations, 36 PerfectInterpolantSequences, 50/293 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 23:23:49,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...