./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:13:39,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:13:39,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:13:39,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:13:39,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:13:39,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:13:39,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:13:39,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:13:39,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:13:39,258 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:13:39,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:13:39,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:13:39,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:13:39,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:13:39,260 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:13:39,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:13:39,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:13:39,260 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:13:39,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:13:39,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:13:39,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:13:39,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:13:39,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:13:39,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:13:39,260 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:13:39,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:13:39,260 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:13:39,261 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:13:39,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:13:39,261 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b [2025-02-05 16:13:39,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:13:39,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:13:39,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:13:39,524 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:13:39,524 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:13:39,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2025-02-05 16:13:40,619 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c518c99b5/4b3a5ceb830c4886bb2c93c1459db1eb/FLAG4586bc007 [2025-02-05 16:13:40,838 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:13:40,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2025-02-05 16:13:40,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c518c99b5/4b3a5ceb830c4886bb2c93c1459db1eb/FLAG4586bc007 [2025-02-05 16:13:40,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c518c99b5/4b3a5ceb830c4886bb2c93c1459db1eb [2025-02-05 16:13:40,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:13:40,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:13:40,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:13:40,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:13:40,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:13:40,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:13:40" (1/1) ... [2025-02-05 16:13:40,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b657fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:40, skipping insertion in model container [2025-02-05 16:13:40,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:13:40" (1/1) ... [2025-02-05 16:13:40,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:13:41,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2025-02-05 16:13:41,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:13:41,089 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:13:41,115 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2025-02-05 16:13:41,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:13:41,127 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:13:41,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:41 WrapperNode [2025-02-05 16:13:41,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:13:41,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:13:41,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:13:41,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:13:41,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:41" (1/1) ... [2025-02-05 16:13:41,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:41" (1/1) ... [2025-02-05 16:13:41,158 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2025-02-05 16:13:41,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:13:41,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:13:41,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:13:41,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:13:41,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:41" (1/1) ... [2025-02-05 16:13:41,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:41" (1/1) ... [2025-02-05 16:13:41,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:41" (1/1) ... [2025-02-05 16:13:41,177 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-02-05 16:13:41,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:41" (1/1) ... [2025-02-05 16:13:41,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:41" (1/1) ... [2025-02-05 16:13:41,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:41" (1/1) ... [2025-02-05 16:13:41,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:41" (1/1) ... [2025-02-05 16:13:41,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:41" (1/1) ... [2025-02-05 16:13:41,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:41" (1/1) ... [2025-02-05 16:13:41,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:13:41,190 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:13:41,190 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:13:41,190 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:13:41,191 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:41" (1/1) ... [2025-02-05 16:13:41,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:13:41,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:13:41,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:13:41,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:13:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:13:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:13:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:13:41,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:13:41,312 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:13:41,314 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:13:41,576 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-05 16:13:41,577 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:13:41,584 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:13:41,585 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:13:41,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:13:41 BoogieIcfgContainer [2025-02-05 16:13:41,585 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:13:41,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:13:41,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:13:41,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:13:41,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:13:40" (1/3) ... [2025-02-05 16:13:41,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5419f9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:13:41, skipping insertion in model container [2025-02-05 16:13:41,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:41" (2/3) ... [2025-02-05 16:13:41,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5419f9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:13:41, skipping insertion in model container [2025-02-05 16:13:41,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:13:41" (3/3) ... [2025-02-05 16:13:41,592 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2025-02-05 16:13:41,604 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:13:41,606 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c that has 1 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:13:41,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:13:41,660 INFO L333 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=PETRI_NET, 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;@176820f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:13:41,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:13:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 64 states have (on average 1.703125) internal successors, (109), 65 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:41,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 16:13:41,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:41,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:41,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:41,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:41,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1703050643, now seen corresponding path program 1 times [2025-02-05 16:13:41,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:41,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985356097] [2025-02-05 16:13:41,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:41,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:41,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 16:13:41,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 16:13:41,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:41,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:41,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:41,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985356097] [2025-02-05 16:13:41,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985356097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:41,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:41,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:13:41,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837809161] [2025-02-05 16:13:41,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:41,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:13:41,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:41,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:13:41,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:13:41,892 INFO L87 Difference]: Start difference. First operand has 66 states, 64 states have (on average 1.703125) internal successors, (109), 65 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:41,907 INFO L93 Difference]: Finished difference Result 110 states and 178 transitions. [2025-02-05 16:13:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:13:41,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 16:13:41,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:41,916 INFO L225 Difference]: With dead ends: 110 [2025-02-05 16:13:41,916 INFO L226 Difference]: Without dead ends: 63 [2025-02-05 16:13:41,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:13:41,921 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:41,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-05 16:13:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-05 16:13:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 62 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 104 transitions. [2025-02-05 16:13:41,947 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 104 transitions. Word has length 25 [2025-02-05 16:13:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:41,948 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 104 transitions. [2025-02-05 16:13:41,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2025-02-05 16:13:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 16:13:41,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:41,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:41,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:13:41,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:41,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1294226418, now seen corresponding path program 1 times [2025-02-05 16:13:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:41,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648740649] [2025-02-05 16:13:41,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:41,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:41,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 16:13:41,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 16:13:41,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:41,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:42,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:42,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648740649] [2025-02-05 16:13:42,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648740649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:42,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:42,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:42,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686889639] [2025-02-05 16:13:42,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:42,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:42,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:42,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:42,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:42,144 INFO L87 Difference]: Start difference. First operand 63 states and 104 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:42,211 INFO L93 Difference]: Finished difference Result 147 states and 236 transitions. [2025-02-05 16:13:42,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:42,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 16:13:42,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:42,212 INFO L225 Difference]: With dead ends: 147 [2025-02-05 16:13:42,213 INFO L226 Difference]: Without dead ends: 103 [2025-02-05 16:13:42,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:42,213 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 63 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:42,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 377 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-05 16:13:42,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 63. [2025-02-05 16:13:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2025-02-05 16:13:42,217 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 25 [2025-02-05 16:13:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:42,218 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2025-02-05 16:13:42,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2025-02-05 16:13:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 16:13:42,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:42,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:42,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:13:42,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:42,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:42,219 INFO L85 PathProgramCache]: Analyzing trace with hash -76370206, now seen corresponding path program 1 times [2025-02-05 16:13:42,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:42,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109801350] [2025-02-05 16:13:42,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:42,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:42,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 16:13:42,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 16:13:42,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:42,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:42,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:42,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109801350] [2025-02-05 16:13:42,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109801350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:42,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:42,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:42,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097087433] [2025-02-05 16:13:42,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:42,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:42,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:42,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:42,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:42,298 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:42,322 INFO L93 Difference]: Finished difference Result 135 states and 201 transitions. [2025-02-05 16:13:42,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:42,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-05 16:13:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:42,323 INFO L225 Difference]: With dead ends: 135 [2025-02-05 16:13:42,323 INFO L226 Difference]: Without dead ends: 95 [2025-02-05 16:13:42,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:42,324 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:42,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 194 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:42,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-05 16:13:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-02-05 16:13:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 92 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-02-05 16:13:42,333 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 41 [2025-02-05 16:13:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:42,333 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-02-05 16:13:42,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-02-05 16:13:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 16:13:42,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:42,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:42,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:13:42,334 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:42,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:42,335 INFO L85 PathProgramCache]: Analyzing trace with hash 112567055, now seen corresponding path program 1 times [2025-02-05 16:13:42,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:42,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759096479] [2025-02-05 16:13:42,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:42,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:42,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 16:13:42,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 16:13:42,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:42,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:42,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:42,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759096479] [2025-02-05 16:13:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759096479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:42,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:42,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23624267] [2025-02-05 16:13:42,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:42,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:42,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:42,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:42,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:42,446 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:42,520 INFO L93 Difference]: Finished difference Result 373 states and 583 transitions. [2025-02-05 16:13:42,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:42,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-05 16:13:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:42,525 INFO L225 Difference]: With dead ends: 373 [2025-02-05 16:13:42,525 INFO L226 Difference]: Without dead ends: 303 [2025-02-05 16:13:42,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:13:42,526 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 362 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:42,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 291 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-05 16:13:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 161. [2025-02-05 16:13:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.5125) internal successors, (242), 160 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 242 transitions. [2025-02-05 16:13:42,543 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 242 transitions. Word has length 41 [2025-02-05 16:13:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:42,543 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 242 transitions. [2025-02-05 16:13:42,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 242 transitions. [2025-02-05 16:13:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 16:13:42,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:42,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:42,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:13:42,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:42,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:42,546 INFO L85 PathProgramCache]: Analyzing trace with hash -775774379, now seen corresponding path program 1 times [2025-02-05 16:13:42,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:42,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441935456] [2025-02-05 16:13:42,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:42,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:42,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 16:13:42,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 16:13:42,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:42,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:42,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:42,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441935456] [2025-02-05 16:13:42,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441935456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:42,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:42,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:13:42,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341333885] [2025-02-05 16:13:42,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:42,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:13:42,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:42,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:13:42,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:13:42,815 INFO L87 Difference]: Start difference. First operand 161 states and 242 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:42,862 INFO L93 Difference]: Finished difference Result 175 states and 259 transitions. [2025-02-05 16:13:42,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:13:42,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-05 16:13:42,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:42,863 INFO L225 Difference]: With dead ends: 175 [2025-02-05 16:13:42,864 INFO L226 Difference]: Without dead ends: 173 [2025-02-05 16:13:42,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:13:42,864 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:42,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 552 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-05 16:13:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-02-05 16:13:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.4767441860465116) internal successors, (254), 172 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 254 transitions. [2025-02-05 16:13:42,874 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 254 transitions. Word has length 42 [2025-02-05 16:13:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:42,875 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 254 transitions. [2025-02-05 16:13:42,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 254 transitions. [2025-02-05 16:13:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 16:13:42,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:42,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:42,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:13:42,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:42,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:42,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1809517583, now seen corresponding path program 1 times [2025-02-05 16:13:42,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:42,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701040537] [2025-02-05 16:13:42,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:42,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:42,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 16:13:42,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 16:13:42,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:42,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:42,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:42,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701040537] [2025-02-05 16:13:42,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701040537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:42,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:42,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208696665] [2025-02-05 16:13:42,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:42,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:42,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:42,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:42,970 INFO L87 Difference]: Start difference. First operand 173 states and 254 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:42,988 INFO L93 Difference]: Finished difference Result 394 states and 593 transitions. [2025-02-05 16:13:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:42,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-05 16:13:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:42,990 INFO L225 Difference]: With dead ends: 394 [2025-02-05 16:13:42,990 INFO L226 Difference]: Without dead ends: 244 [2025-02-05 16:13:42,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:42,990 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 37 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:42,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-02-05 16:13:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2025-02-05 16:13:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.4896265560165975) internal successors, (359), 241 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2025-02-05 16:13:43,003 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 43 [2025-02-05 16:13:43,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:43,005 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2025-02-05 16:13:43,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2025-02-05 16:13:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 16:13:43,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:43,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:43,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:13:43,007 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:43,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:43,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1295937826, now seen corresponding path program 1 times [2025-02-05 16:13:43,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:43,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292377665] [2025-02-05 16:13:43,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:43,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:43,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 16:13:43,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 16:13:43,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:43,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:43,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:43,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292377665] [2025-02-05 16:13:43,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292377665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:43,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:43,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:43,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120978652] [2025-02-05 16:13:43,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:43,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:43,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:43,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:43,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:43,076 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:43,094 INFO L93 Difference]: Finished difference Result 628 states and 943 transitions. [2025-02-05 16:13:43,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:43,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-05 16:13:43,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:43,097 INFO L225 Difference]: With dead ends: 628 [2025-02-05 16:13:43,098 INFO L226 Difference]: Without dead ends: 411 [2025-02-05 16:13:43,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:43,099 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 44 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:43,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-05 16:13:43,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2025-02-05 16:13:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 1.4754901960784315) internal successors, (602), 408 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 602 transitions. [2025-02-05 16:13:43,114 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 602 transitions. Word has length 44 [2025-02-05 16:13:43,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:43,115 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 602 transitions. [2025-02-05 16:13:43,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 602 transitions. [2025-02-05 16:13:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 16:13:43,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:43,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:43,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:13:43,118 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:43,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash 137261936, now seen corresponding path program 1 times [2025-02-05 16:13:43,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:43,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408609820] [2025-02-05 16:13:43,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:43,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:43,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 16:13:43,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 16:13:43,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:43,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408609820] [2025-02-05 16:13:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408609820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:43,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:43,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:43,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163458750] [2025-02-05 16:13:43,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:43,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:43,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:43,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:43,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:43,160 INFO L87 Difference]: Start difference. First operand 409 states and 602 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:43,180 INFO L93 Difference]: Finished difference Result 1081 states and 1588 transitions. [2025-02-05 16:13:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:43,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-05 16:13:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:43,182 INFO L225 Difference]: With dead ends: 1081 [2025-02-05 16:13:43,182 INFO L226 Difference]: Without dead ends: 697 [2025-02-05 16:13:43,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:43,183 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 48 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:43,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-02-05 16:13:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 695. [2025-02-05 16:13:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.4380403458213256) internal successors, (998), 694 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 998 transitions. [2025-02-05 16:13:43,198 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 998 transitions. Word has length 44 [2025-02-05 16:13:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:43,198 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 998 transitions. [2025-02-05 16:13:43,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 998 transitions. [2025-02-05 16:13:43,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:13:43,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:43,200 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:43,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:13:43,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:43,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:43,200 INFO L85 PathProgramCache]: Analyzing trace with hash -90192710, now seen corresponding path program 1 times [2025-02-05 16:13:43,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:43,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407747318] [2025-02-05 16:13:43,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:43,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:43,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:13:43,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:13:43,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:43,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:43,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:43,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407747318] [2025-02-05 16:13:43,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407747318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:43,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:43,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:43,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497783895] [2025-02-05 16:13:43,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:43,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:43,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:43,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:43,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:43,311 INFO L87 Difference]: Start difference. First operand 695 states and 998 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:43,332 INFO L93 Difference]: Finished difference Result 1367 states and 1972 transitions. [2025-02-05 16:13:43,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:43,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-02-05 16:13:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:43,335 INFO L225 Difference]: With dead ends: 1367 [2025-02-05 16:13:43,335 INFO L226 Difference]: Without dead ends: 697 [2025-02-05 16:13:43,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:43,336 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 41 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:43,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-02-05 16:13:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 695. [2025-02-05 16:13:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.420749279538905) internal successors, (986), 694 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 986 transitions. [2025-02-05 16:13:43,363 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 986 transitions. Word has length 62 [2025-02-05 16:13:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:43,364 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 986 transitions. [2025-02-05 16:13:43,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 986 transitions. [2025-02-05 16:13:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:13:43,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:43,365 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:43,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:13:43,366 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:43,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:43,366 INFO L85 PathProgramCache]: Analyzing trace with hash -389830323, now seen corresponding path program 1 times [2025-02-05 16:13:43,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:43,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033454757] [2025-02-05 16:13:43,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:43,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:43,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:13:43,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:13:43,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:43,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:43,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:43,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033454757] [2025-02-05 16:13:43,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033454757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:43,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:43,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:43,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533984322] [2025-02-05 16:13:43,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:43,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:43,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:43,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:43,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:43,449 INFO L87 Difference]: Start difference. First operand 695 states and 986 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:43,465 INFO L93 Difference]: Finished difference Result 1033 states and 1468 transitions. [2025-02-05 16:13:43,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:43,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-02-05 16:13:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:43,467 INFO L225 Difference]: With dead ends: 1033 [2025-02-05 16:13:43,467 INFO L226 Difference]: Without dead ends: 363 [2025-02-05 16:13:43,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:43,470 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:43,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:43,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-05 16:13:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2025-02-05 16:13:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.3888888888888888) internal successors, (500), 360 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 500 transitions. [2025-02-05 16:13:43,481 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 500 transitions. Word has length 62 [2025-02-05 16:13:43,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:43,481 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 500 transitions. [2025-02-05 16:13:43,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 500 transitions. [2025-02-05 16:13:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:13:43,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:43,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:43,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:13:43,482 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:43,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:43,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1008808096, now seen corresponding path program 1 times [2025-02-05 16:13:43,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:43,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107710774] [2025-02-05 16:13:43,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:43,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:43,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:13:43,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:13:43,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:43,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:45,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:45,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107710774] [2025-02-05 16:13:45,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107710774] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:13:45,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067612340] [2025-02-05 16:13:45,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:45,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:13:45,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:13:45,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:13:45,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:13:45,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:13:45,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:13:45,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:45,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:45,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:13:45,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:13:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:45,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:13:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:46,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067612340] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:13:46,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:13:46,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 24 [2025-02-05 16:13:46,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324688093] [2025-02-05 16:13:46,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:13:46,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 16:13:46,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:46,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 16:13:46,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-02-05 16:13:46,267 INFO L87 Difference]: Start difference. First operand 361 states and 500 transitions. Second operand has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:53,933 INFO L93 Difference]: Finished difference Result 3546 states and 4902 transitions. [2025-02-05 16:13:53,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-02-05 16:13:53,933 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 0 states have call successors, (0), 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 62 [2025-02-05 16:13:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:53,943 INFO L225 Difference]: With dead ends: 3546 [2025-02-05 16:13:53,943 INFO L226 Difference]: Without dead ends: 3210 [2025-02-05 16:13:53,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6353 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=3071, Invalid=14221, Unknown=0, NotChecked=0, Total=17292 [2025-02-05 16:13:53,949 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 4195 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4195 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:53,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4195 Valid, 1175 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:13:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2025-02-05 16:13:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 2172. [2025-02-05 16:13:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 2171 states have (on average 1.3735605711653616) internal successors, (2982), 2171 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 2982 transitions. [2025-02-05 16:13:54,006 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 2982 transitions. Word has length 62 [2025-02-05 16:13:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:54,007 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 2982 transitions. [2025-02-05 16:13:54,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2982 transitions. [2025-02-05 16:13:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:13:54,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:54,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:54,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:13:54,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 16:13:54,208 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:54,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:54,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2023061580, now seen corresponding path program 1 times [2025-02-05 16:13:54,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:54,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786698045] [2025-02-05 16:13:54,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:54,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:54,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:13:54,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:13:54,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:54,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:13:54,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:54,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786698045] [2025-02-05 16:13:54,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786698045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:54,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:54,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:54,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312495224] [2025-02-05 16:13:54,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:54,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:54,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:54,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:54,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:54,279 INFO L87 Difference]: Start difference. First operand 2172 states and 2982 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:54,369 INFO L93 Difference]: Finished difference Result 5241 states and 7261 transitions. [2025-02-05 16:13:54,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:54,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 63 [2025-02-05 16:13:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:54,379 INFO L225 Difference]: With dead ends: 5241 [2025-02-05 16:13:54,379 INFO L226 Difference]: Without dead ends: 4226 [2025-02-05 16:13:54,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:13:54,381 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 216 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:54,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 425 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4226 states. [2025-02-05 16:13:54,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4226 to 3133. [2025-02-05 16:13:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 3132 states have (on average 1.3690932311621966) internal successors, (4288), 3132 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 4288 transitions. [2025-02-05 16:13:54,503 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 4288 transitions. Word has length 63 [2025-02-05 16:13:54,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:54,503 INFO L471 AbstractCegarLoop]: Abstraction has 3133 states and 4288 transitions. [2025-02-05 16:13:54,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4288 transitions. [2025-02-05 16:13:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:13:54,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:54,504 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:54,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:13:54,504 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:54,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1882956040, now seen corresponding path program 1 times [2025-02-05 16:13:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:54,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297216693] [2025-02-05 16:13:54,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:54,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:13:54,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:13:54,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:54,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:13:54,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:54,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297216693] [2025-02-05 16:13:54,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297216693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:54,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:54,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:54,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675067575] [2025-02-05 16:13:54,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:54,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:54,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:54,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:54,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:54,577 INFO L87 Difference]: Start difference. First operand 3133 states and 4288 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:54,667 INFO L93 Difference]: Finished difference Result 6253 states and 8638 transitions. [2025-02-05 16:13:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:54,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:13:54,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:54,682 INFO L225 Difference]: With dead ends: 6253 [2025-02-05 16:13:54,682 INFO L226 Difference]: Without dead ends: 5178 [2025-02-05 16:13:54,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:13:54,686 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 218 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:54,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 366 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2025-02-05 16:13:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 4152. [2025-02-05 16:13:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 4151 states have (on average 1.3659359190556493) internal successors, (5670), 4151 states have internal predecessors, (5670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 5670 transitions. [2025-02-05 16:13:54,821 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 5670 transitions. Word has length 63 [2025-02-05 16:13:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:54,821 INFO L471 AbstractCegarLoop]: Abstraction has 4152 states and 5670 transitions. [2025-02-05 16:13:54,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 5670 transitions. [2025-02-05 16:13:54,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:13:54,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:54,822 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:54,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:13:54,822 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:54,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1249229689, now seen corresponding path program 1 times [2025-02-05 16:13:54,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:54,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520980835] [2025-02-05 16:13:54,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:54,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:54,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:13:54,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:13:54,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:54,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:54,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:54,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520980835] [2025-02-05 16:13:54,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520980835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:54,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:54,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454443277] [2025-02-05 16:13:54,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:54,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:54,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:54,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:54,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:54,856 INFO L87 Difference]: Start difference. First operand 4152 states and 5670 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:54,960 INFO L93 Difference]: Finished difference Result 12024 states and 16282 transitions. [2025-02-05 16:13:54,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:54,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:13:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:54,982 INFO L225 Difference]: With dead ends: 12024 [2025-02-05 16:13:54,982 INFO L226 Difference]: Without dead ends: 7999 [2025-02-05 16:13:54,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:54,990 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 37 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:54,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 212 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:54,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7999 states. [2025-02-05 16:13:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7999 to 7997. [2025-02-05 16:13:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7997 states, 7996 states have (on average 1.3267883941970986) internal successors, (10609), 7996 states have internal predecessors, (10609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:55,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7997 states to 7997 states and 10609 transitions. [2025-02-05 16:13:55,213 INFO L78 Accepts]: Start accepts. Automaton has 7997 states and 10609 transitions. Word has length 64 [2025-02-05 16:13:55,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:55,213 INFO L471 AbstractCegarLoop]: Abstraction has 7997 states and 10609 transitions. [2025-02-05 16:13:55,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 7997 states and 10609 transitions. [2025-02-05 16:13:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:13:55,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:55,215 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:55,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:13:55,216 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:55,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash 111310681, now seen corresponding path program 1 times [2025-02-05 16:13:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:55,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481060165] [2025-02-05 16:13:55,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:55,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:13:55,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:13:55,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:55,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:55,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:55,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481060165] [2025-02-05 16:13:55,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481060165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:55,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:55,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:55,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093419979] [2025-02-05 16:13:55,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:55,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:55,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:55,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:55,254 INFO L87 Difference]: Start difference. First operand 7997 states and 10609 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:55,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:55,472 INFO L93 Difference]: Finished difference Result 20910 states and 27654 transitions. [2025-02-05 16:13:55,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:55,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:13:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:55,505 INFO L225 Difference]: With dead ends: 20910 [2025-02-05 16:13:55,505 INFO L226 Difference]: Without dead ends: 13180 [2025-02-05 16:13:55,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:55,512 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 40 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:55,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 164 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13180 states. [2025-02-05 16:13:55,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13180 to 13178. [2025-02-05 16:13:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13178 states, 13177 states have (on average 1.301434317371177) internal successors, (17149), 13177 states have internal predecessors, (17149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13178 states to 13178 states and 17149 transitions. [2025-02-05 16:13:55,858 INFO L78 Accepts]: Start accepts. Automaton has 13178 states and 17149 transitions. Word has length 64 [2025-02-05 16:13:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:55,859 INFO L471 AbstractCegarLoop]: Abstraction has 13178 states and 17149 transitions. [2025-02-05 16:13:55,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 13178 states and 17149 transitions. [2025-02-05 16:13:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:13:55,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:55,860 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:55,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:13:55,860 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:55,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:55,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1534170157, now seen corresponding path program 1 times [2025-02-05 16:13:55,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:55,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881911690] [2025-02-05 16:13:55,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:55,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:55,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:13:55,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:13:55,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:55,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:55,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:55,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881911690] [2025-02-05 16:13:55,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881911690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:55,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:55,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:55,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977577074] [2025-02-05 16:13:55,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:55,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:55,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:55,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:55,905 INFO L87 Difference]: Start difference. First operand 13178 states and 17149 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:56,280 INFO L93 Difference]: Finished difference Result 30431 states and 39637 transitions. [2025-02-05 16:13:56,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:56,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:13:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:56,313 INFO L225 Difference]: With dead ends: 30431 [2025-02-05 16:13:56,314 INFO L226 Difference]: Without dead ends: 17634 [2025-02-05 16:13:56,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:56,327 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 40 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:56,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 171 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17634 states. [2025-02-05 16:13:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17634 to 17632. [2025-02-05 16:13:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17632 states, 17631 states have (on average 1.2780897283194375) internal successors, (22534), 17631 states have internal predecessors, (22534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17632 states to 17632 states and 22534 transitions. [2025-02-05 16:13:56,902 INFO L78 Accepts]: Start accepts. Automaton has 17632 states and 22534 transitions. Word has length 64 [2025-02-05 16:13:56,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:56,902 INFO L471 AbstractCegarLoop]: Abstraction has 17632 states and 22534 transitions. [2025-02-05 16:13:56,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 17632 states and 22534 transitions. [2025-02-05 16:13:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:13:56,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:56,904 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:56,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:13:56,904 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:56,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:56,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2081628779, now seen corresponding path program 1 times [2025-02-05 16:13:56,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:56,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941160051] [2025-02-05 16:13:56,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:56,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:56,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:13:56,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:13:56,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:56,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:13:56,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:56,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941160051] [2025-02-05 16:13:56,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941160051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:56,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:56,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:56,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867087677] [2025-02-05 16:13:56,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:56,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:56,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:56,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:56,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:56,961 INFO L87 Difference]: Start difference. First operand 17632 states and 22534 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:57,263 INFO L93 Difference]: Finished difference Result 29143 states and 37579 transitions. [2025-02-05 16:13:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:57,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:13:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:57,303 INFO L225 Difference]: With dead ends: 29143 [2025-02-05 16:13:57,303 INFO L226 Difference]: Without dead ends: 23154 [2025-02-05 16:13:57,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:13:57,317 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 220 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:57,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 388 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:57,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23154 states. [2025-02-05 16:13:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23154 to 21691. [2025-02-05 16:13:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21691 states, 21690 states have (on average 1.2714153988012908) internal successors, (27577), 21690 states have internal predecessors, (27577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21691 states to 21691 states and 27577 transitions. [2025-02-05 16:13:57,809 INFO L78 Accepts]: Start accepts. Automaton has 21691 states and 27577 transitions. Word has length 64 [2025-02-05 16:13:57,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:57,809 INFO L471 AbstractCegarLoop]: Abstraction has 21691 states and 27577 transitions. [2025-02-05 16:13:57,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 21691 states and 27577 transitions. [2025-02-05 16:13:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:13:57,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:57,811 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:57,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:13:57,812 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:57,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:57,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1778418228, now seen corresponding path program 1 times [2025-02-05 16:13:57,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:57,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569548551] [2025-02-05 16:13:57,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:57,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:13:57,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:13:57,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:57,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:58,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:58,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569548551] [2025-02-05 16:13:58,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569548551] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:13:58,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570191789] [2025-02-05 16:13:58,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:58,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:13:58,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:13:58,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:13:58,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:13:58,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:13:58,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:13:58,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:58,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:58,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 16:13:58,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:13:58,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:58,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:13:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:59,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570191789] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:13:59,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:13:59,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 16] total 36 [2025-02-05 16:13:59,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160945908] [2025-02-05 16:13:59,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:13:59,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 16:13:59,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:59,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 16:13:59,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 16:13:59,454 INFO L87 Difference]: Start difference. First operand 21691 states and 27577 transitions. Second operand has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 36 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-02-05 16:14:07,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:07,575 INFO L93 Difference]: Finished difference Result 101387 states and 129532 transitions. [2025-02-05 16:14:07,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2025-02-05 16:14:07,575 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 36 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) Word has length 66 [2025-02-05 16:14:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:07,698 INFO L225 Difference]: With dead ends: 101387 [2025-02-05 16:14:07,699 INFO L226 Difference]: Without dead ends: 79869 [2025-02-05 16:14:07,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14190 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=6751, Invalid=30305, Unknown=0, NotChecked=0, Total=37056 [2025-02-05 16:14:07,728 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 5420 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5420 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:07,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5420 Valid, 1811 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:14:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79869 states. [2025-02-05 16:14:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79869 to 66123. [2025-02-05 16:14:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66123 states, 66122 states have (on average 1.2577810713529536) internal successors, (83167), 66122 states have internal predecessors, (83167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66123 states to 66123 states and 83167 transitions. [2025-02-05 16:14:09,431 INFO L78 Accepts]: Start accepts. Automaton has 66123 states and 83167 transitions. Word has length 66 [2025-02-05 16:14:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:09,431 INFO L471 AbstractCegarLoop]: Abstraction has 66123 states and 83167 transitions. [2025-02-05 16:14:09,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 36 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-02-05 16:14:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 66123 states and 83167 transitions. [2025-02-05 16:14:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:14:09,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:09,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:09,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:14:09,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 16:14:09,634 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:09,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:09,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1455892199, now seen corresponding path program 1 times [2025-02-05 16:14:09,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:09,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848976432] [2025-02-05 16:14:09,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:09,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:09,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:14:09,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:14:09,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:09,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:09,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848976432] [2025-02-05 16:14:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848976432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:09,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:09,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:14:09,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748638080] [2025-02-05 16:14:09,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:09,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:14:09,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:09,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:14:09,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:09,669 INFO L87 Difference]: Start difference. First operand 66123 states and 83167 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:10,579 INFO L93 Difference]: Finished difference Result 89431 states and 112179 transitions. [2025-02-05 16:14:10,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:14:10,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-02-05 16:14:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:10,640 INFO L225 Difference]: With dead ends: 89431 [2025-02-05 16:14:10,640 INFO L226 Difference]: Without dead ends: 48061 [2025-02-05 16:14:10,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:10,661 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 37 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:10,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 206 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:14:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48061 states. [2025-02-05 16:14:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48061 to 42407. [2025-02-05 16:14:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42407 states, 42406 states have (on average 1.241168702542093) internal successors, (52633), 42406 states have internal predecessors, (52633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42407 states to 42407 states and 52633 transitions. [2025-02-05 16:14:12,155 INFO L78 Accepts]: Start accepts. Automaton has 42407 states and 52633 transitions. Word has length 67 [2025-02-05 16:14:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:12,155 INFO L471 AbstractCegarLoop]: Abstraction has 42407 states and 52633 transitions. [2025-02-05 16:14:12,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 42407 states and 52633 transitions. [2025-02-05 16:14:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:14:12,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:12,158 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:12,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:14:12,158 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:12,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:12,159 INFO L85 PathProgramCache]: Analyzing trace with hash -300852910, now seen corresponding path program 1 times [2025-02-05 16:14:12,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:12,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444907341] [2025-02-05 16:14:12,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:12,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:14:12,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:14:12,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:12,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:12,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:12,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444907341] [2025-02-05 16:14:12,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444907341] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:14:12,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250418571] [2025-02-05 16:14:12,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:12,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:12,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:14:12,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:14:12,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:14:12,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:14:12,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:14:12,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:12,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:12,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 16:14:12,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:14:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:13,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:14:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:14,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250418571] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:14:14,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:14:14,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 16] total 43 [2025-02-05 16:14:14,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982296754] [2025-02-05 16:14:14,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:14:14,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-05 16:14:14,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:14,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-05 16:14:14,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1623, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 16:14:14,801 INFO L87 Difference]: Start difference. First operand 42407 states and 52633 transitions. Second operand has 43 states, 43 states have (on average 4.395348837209302) internal successors, (189), 43 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:40,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:40,313 INFO L93 Difference]: Finished difference Result 211360 states and 259930 transitions. [2025-02-05 16:14:40,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 299 states. [2025-02-05 16:14:40,314 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.395348837209302) internal successors, (189), 43 states have internal predecessors, (189), 0 states have call successors, (0), 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 68 [2025-02-05 16:14:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:40,522 INFO L225 Difference]: With dead ends: 211360 [2025-02-05 16:14:40,522 INFO L226 Difference]: Without dead ends: 169306 [2025-02-05 16:14:40,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49494 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=20975, Invalid=94285, Unknown=0, NotChecked=0, Total=115260 [2025-02-05 16:14:40,569 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 9460 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9460 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:40,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9460 Valid, 2324 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:14:40,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169306 states. [2025-02-05 16:14:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169306 to 73458. [2025-02-05 16:14:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73458 states, 73457 states have (on average 1.2417060321004125) internal successors, (91212), 73457 states have internal predecessors, (91212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73458 states to 73458 states and 91212 transitions. [2025-02-05 16:14:43,747 INFO L78 Accepts]: Start accepts. Automaton has 73458 states and 91212 transitions. Word has length 68 [2025-02-05 16:14:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:43,747 INFO L471 AbstractCegarLoop]: Abstraction has 73458 states and 91212 transitions. [2025-02-05 16:14:43,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.395348837209302) internal successors, (189), 43 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 73458 states and 91212 transitions. [2025-02-05 16:14:43,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 16:14:43,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:43,759 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:43,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:14:43,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:43,960 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:43,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:43,960 INFO L85 PathProgramCache]: Analyzing trace with hash -510167271, now seen corresponding path program 1 times [2025-02-05 16:14:43,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:43,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862964142] [2025-02-05 16:14:43,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:43,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:43,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:14:43,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:14:43,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:43,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 16:14:44,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:44,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862964142] [2025-02-05 16:14:44,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862964142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:44,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:44,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:14:44,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903397104] [2025-02-05 16:14:44,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:44,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:14:44,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:44,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:14:44,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:44,022 INFO L87 Difference]: Start difference. First operand 73458 states and 91212 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:46,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:46,507 INFO L93 Difference]: Finished difference Result 114608 states and 141788 transitions. [2025-02-05 16:14:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:14:46,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 108 [2025-02-05 16:14:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:46,583 INFO L225 Difference]: With dead ends: 114608 [2025-02-05 16:14:46,584 INFO L226 Difference]: Without dead ends: 68407 [2025-02-05 16:14:46,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:46,624 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:46,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 213 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:14:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68407 states. [2025-02-05 16:14:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68407 to 64403. [2025-02-05 16:14:48,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64403 states, 64402 states have (on average 1.220893761063321) internal successors, (78628), 64402 states have internal predecessors, (78628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64403 states to 64403 states and 78628 transitions. [2025-02-05 16:14:48,726 INFO L78 Accepts]: Start accepts. Automaton has 64403 states and 78628 transitions. Word has length 108 [2025-02-05 16:14:48,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:48,727 INFO L471 AbstractCegarLoop]: Abstraction has 64403 states and 78628 transitions. [2025-02-05 16:14:48,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:48,727 INFO L276 IsEmpty]: Start isEmpty. Operand 64403 states and 78628 transitions. [2025-02-05 16:14:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 16:14:48,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:48,735 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:48,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:14:48,735 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:48,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:48,736 INFO L85 PathProgramCache]: Analyzing trace with hash -71756424, now seen corresponding path program 1 times [2025-02-05 16:14:48,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:48,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244088520] [2025-02-05 16:14:48,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:48,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:14:48,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:14:48,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:48,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 16:14:48,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:48,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244088520] [2025-02-05 16:14:48,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244088520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:48,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:48,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:14:48,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197662874] [2025-02-05 16:14:48,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:48,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:14:48,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:48,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:14:48,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:48,784 INFO L87 Difference]: Start difference. First operand 64403 states and 78628 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:49,897 INFO L93 Difference]: Finished difference Result 81372 states and 98869 transitions. [2025-02-05 16:14:49,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:14:49,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 108 [2025-02-05 16:14:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:50,153 INFO L225 Difference]: With dead ends: 81372 [2025-02-05 16:14:50,155 INFO L226 Difference]: Without dead ends: 49855 [2025-02-05 16:14:50,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:50,176 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 22 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:50,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 176 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:14:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49855 states. [2025-02-05 16:14:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49855 to 49853. [2025-02-05 16:14:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49853 states, 49852 states have (on average 1.1971234855171307) internal successors, (59679), 49852 states have internal predecessors, (59679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49853 states to 49853 states and 59679 transitions. [2025-02-05 16:14:51,681 INFO L78 Accepts]: Start accepts. Automaton has 49853 states and 59679 transitions. Word has length 108 [2025-02-05 16:14:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:51,682 INFO L471 AbstractCegarLoop]: Abstraction has 49853 states and 59679 transitions. [2025-02-05 16:14:51,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 49853 states and 59679 transitions. [2025-02-05 16:14:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 16:14:51,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:51,688 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:51,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:14:51,689 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:51,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:51,689 INFO L85 PathProgramCache]: Analyzing trace with hash -452148463, now seen corresponding path program 1 times [2025-02-05 16:14:51,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:51,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886909987] [2025-02-05 16:14:51,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:51,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:51,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:14:51,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:14:51,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:51,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 16:14:51,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:51,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886909987] [2025-02-05 16:14:51,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886909987] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:14:51,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572298585] [2025-02-05 16:14:51,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:51,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:51,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:14:51,997 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:14:51,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:14:52,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:14:52,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:14:52,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:52,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:52,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 16:14:52,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:14:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 50 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:52,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:14:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 35 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:53,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572298585] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:14:53,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:14:53,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 26 [2025-02-05 16:14:53,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53091607] [2025-02-05 16:14:53,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:14:53,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 16:14:53,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:53,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 16:14:53,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:14:53,908 INFO L87 Difference]: Start difference. First operand 49853 states and 59679 transitions. Second operand has 26 states, 26 states have (on average 9.807692307692308) internal successors, (255), 26 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-02-05 16:14:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:58,478 INFO L93 Difference]: Finished difference Result 162307 states and 193573 transitions. [2025-02-05 16:14:58,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 16:14:58,479 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.807692307692308) internal successors, (255), 26 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) Word has length 109 [2025-02-05 16:14:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:58,618 INFO L225 Difference]: With dead ends: 162307 [2025-02-05 16:14:58,618 INFO L226 Difference]: Without dead ends: 116961 [2025-02-05 16:14:58,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=515, Invalid=1837, Unknown=0, NotChecked=0, Total=2352 [2025-02-05 16:14:58,647 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 1396 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:58,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 1196 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:14:58,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116961 states. [2025-02-05 16:15:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116961 to 98520. [2025-02-05 16:15:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98520 states, 98519 states have (on average 1.1896283965529493) internal successors, (117201), 98519 states have internal predecessors, (117201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98520 states to 98520 states and 117201 transitions. [2025-02-05 16:15:02,134 INFO L78 Accepts]: Start accepts. Automaton has 98520 states and 117201 transitions. Word has length 109 [2025-02-05 16:15:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:02,134 INFO L471 AbstractCegarLoop]: Abstraction has 98520 states and 117201 transitions. [2025-02-05 16:15:02,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.807692307692308) internal successors, (255), 26 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-02-05 16:15:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 98520 states and 117201 transitions. [2025-02-05 16:15:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 16:15:02,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:02,144 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:02,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:15:02,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-05 16:15:02,348 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:02,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:02,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1704431523, now seen corresponding path program 1 times [2025-02-05 16:15:02,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:02,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700157820] [2025-02-05 16:15:02,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:02,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:02,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 16:15:02,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 16:15:02,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:02,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 26 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:03,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:03,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700157820] [2025-02-05 16:15:03,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700157820] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:15:03,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90156080] [2025-02-05 16:15:03,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:03,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:15:03,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:15:03,129 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:15:03,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:15:03,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 16:15:03,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 16:15:03,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:03,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:03,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-05 16:15:03,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:15:04,370 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:04,370 INFO L312 TraceCheckSpWp]: Computing backward predicates...