./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-19.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-19.i -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 8782992ede62a00cd83cf50ccb00b62cd9fb02bef3f9a0721eb7de82bc29451b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:32:44,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:32:44,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:32:44,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:32:44,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:32:44,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:32:44,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:32:44,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:32:44,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:32:44,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:32:44,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:32:44,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:32:44,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:32:44,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:32:44,808 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:32:44,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:32:44,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:32:44,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:32:44,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:32:44,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:32:44,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:32:44,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:32:44,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:32:44,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:32:44,809 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:32:44,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:32:44,809 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:32:44,809 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:32:44,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:32:44,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:32:44,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:32:44,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:32:44,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:32:44,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:32:44,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:32:44,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:32:44,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:32:44,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:32:44,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:32:44,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:32:44,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:32:44,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:32:44,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:32:44,811 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 -> 8782992ede62a00cd83cf50ccb00b62cd9fb02bef3f9a0721eb7de82bc29451b [2025-02-05 21:32:45,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:32:45,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:32:45,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:32:45,022 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:32:45,023 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:32:45,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-19.i [2025-02-05 21:32:46,193 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27c504a6a/8c343b85e44549d58c318da9e3afd32a/FLAGc9f85db19 [2025-02-05 21:32:46,417 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:32:46,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-19.i [2025-02-05 21:32:46,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27c504a6a/8c343b85e44549d58c318da9e3afd32a/FLAGc9f85db19 [2025-02-05 21:32:46,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27c504a6a/8c343b85e44549d58c318da9e3afd32a [2025-02-05 21:32:46,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:32:46,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:32:46,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:32:46,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:32:46,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:32:46,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:32:46" (1/1) ... [2025-02-05 21:32:46,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@617ec9ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:46, skipping insertion in model container [2025-02-05 21:32:46,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:32:46" (1/1) ... [2025-02-05 21:32:46,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:32:46,883 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-19.i[916,929] [2025-02-05 21:32:47,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:32:47,027 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:32:47,034 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-19.i[916,929] [2025-02-05 21:32:47,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:32:47,121 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:32:47,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:47 WrapperNode [2025-02-05 21:32:47,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:32:47,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:32:47,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:32:47,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:32:47,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:47" (1/1) ... [2025-02-05 21:32:47,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 09:32:47" (1/1) ... [2025-02-05 21:32:47,197 INFO L138 Inliner]: procedures = 26, calls = 95, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 576 [2025-02-05 21:32:47,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:32:47,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:32:47,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:32:47,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:32:47,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:47" (1/1) ... [2025-02-05 21:32:47,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:47" (1/1) ... [2025-02-05 21:32:47,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:47" (1/1) ... [2025-02-05 21:32:47,271 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 21:32:47,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:47" (1/1) ... [2025-02-05 21:32:47,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:47" (1/1) ... [2025-02-05 21:32:47,290 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:47" (1/1) ... [2025-02-05 21:32:47,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:47" (1/1) ... [2025-02-05 21:32:47,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:47" (1/1) ... [2025-02-05 21:32:47,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:47" (1/1) ... [2025-02-05 21:32:47,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:32:47,311 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:32:47,311 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:32:47,311 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:32:47,312 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:47" (1/1) ... [2025-02-05 21:32:47,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:32:47,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:32:47,338 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 21:32:47,341 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 21:32:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:32:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:32:47,358 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:32:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:32:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:32:47,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:32:47,465 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:32:47,466 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:32:48,199 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 21:32:48,199 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:32:48,224 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:32:48,224 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:32:48,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:32:48 BoogieIcfgContainer [2025-02-05 21:32:48,225 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:32:48,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:32:48,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:32:48,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:32:48,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:32:46" (1/3) ... [2025-02-05 21:32:48,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61acfddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:32:48, skipping insertion in model container [2025-02-05 21:32:48,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:47" (2/3) ... [2025-02-05 21:32:48,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61acfddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:32:48, skipping insertion in model container [2025-02-05 21:32:48,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:32:48" (3/3) ... [2025-02-05 21:32:48,231 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-19.i [2025-02-05 21:32:48,241 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:32:48,244 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-19.i that has 2 procedures, 238 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:32:48,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:32:48,298 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;@5e5faef1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:32:48,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:32:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 238 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 154 states have internal predecessors, (231), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 21:32:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-02-05 21:32:48,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:48,317 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:48,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:48,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:48,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1714756022, now seen corresponding path program 1 times [2025-02-05 21:32:48,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:48,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500505148] [2025-02-05 21:32:48,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:48,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:48,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-05 21:32:48,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-05 21:32:48,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:48,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-02-05 21:32:48,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:48,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500505148] [2025-02-05 21:32:48,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500505148] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:32:48,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303336649] [2025-02-05 21:32:48,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:48,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:32:48,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:32:48,827 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 21:32:48,828 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 21:32:48,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-05 21:32:49,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-05 21:32:49,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:49,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:49,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:32:49,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:32:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-02-05 21:32:49,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:32:49,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303336649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:49,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:32:49,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:32:49,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527531241] [2025-02-05 21:32:49,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:49,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:32:49,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:49,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:32:49,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:32:49,180 INFO L87 Difference]: Start difference. First operand has 238 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 154 states have internal predecessors, (231), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) Second operand has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-05 21:32:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:49,241 INFO L93 Difference]: Finished difference Result 469 states and 865 transitions. [2025-02-05 21:32:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:32:49,243 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) Word has length 520 [2025-02-05 21:32:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:49,251 INFO L225 Difference]: With dead ends: 469 [2025-02-05 21:32:49,251 INFO L226 Difference]: Without dead ends: 234 [2025-02-05 21:32:49,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 521 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 21:32:49,260 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:49,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:32:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-05 21:32:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-02-05 21:32:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 150 states have (on average 1.48) internal successors, (222), 150 states have internal predecessors, (222), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 21:32:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 386 transitions. [2025-02-05 21:32:49,316 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 386 transitions. Word has length 520 [2025-02-05 21:32:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:49,317 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 386 transitions. [2025-02-05 21:32:49,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-05 21:32:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 386 transitions. [2025-02-05 21:32:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-02-05 21:32:49,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:49,326 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:49,334 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 21:32:49,527 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,SelfDestructingSolverStorable0 [2025-02-05 21:32:49,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:49,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2096822204, now seen corresponding path program 1 times [2025-02-05 21:32:49,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:49,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050023858] [2025-02-05 21:32:49,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:49,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-05 21:32:49,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-05 21:32:49,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:49,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:32:50,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:50,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050023858] [2025-02-05 21:32:50,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050023858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:50,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:50,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:32:50,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384613455] [2025-02-05 21:32:50,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:50,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:32:50,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:50,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:32:50,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:32:50,348 INFO L87 Difference]: Start difference. First operand 234 states and 386 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:50,855 INFO L93 Difference]: Finished difference Result 696 states and 1152 transitions. [2025-02-05 21:32:50,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:32:50,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-02-05 21:32:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:50,860 INFO L225 Difference]: With dead ends: 696 [2025-02-05 21:32:50,860 INFO L226 Difference]: Without dead ends: 465 [2025-02-05 21:32:50,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:32:50,861 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 626 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:50,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 689 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:32:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-02-05 21:32:50,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 241. [2025-02-05 21:32:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 157 states have (on average 1.4904458598726114) internal successors, (234), 157 states have internal predecessors, (234), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 21:32:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 398 transitions. [2025-02-05 21:32:50,910 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 398 transitions. Word has length 520 [2025-02-05 21:32:50,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:50,912 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 398 transitions. [2025-02-05 21:32:50,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:50,913 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 398 transitions. [2025-02-05 21:32:50,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-02-05 21:32:50,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:50,917 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:50,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:32:50,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:50,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:50,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2076484829, now seen corresponding path program 1 times [2025-02-05 21:32:50,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:50,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380323659] [2025-02-05 21:32:50,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:50,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:50,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-05 21:32:51,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-05 21:32:51,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:51,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:32:51,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:51,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380323659] [2025-02-05 21:32:51,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380323659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:51,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:51,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:32:51,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770833104] [2025-02-05 21:32:51,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:51,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:32:51,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:51,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:32:51,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:32:51,280 INFO L87 Difference]: Start difference. First operand 241 states and 398 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:51,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:51,380 INFO L93 Difference]: Finished difference Result 626 states and 1037 transitions. [2025-02-05 21:32:51,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:32:51,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-02-05 21:32:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:51,386 INFO L225 Difference]: With dead ends: 626 [2025-02-05 21:32:51,386 INFO L226 Difference]: Without dead ends: 388 [2025-02-05 21:32:51,397 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 21:32:51,398 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 219 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:51,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 800 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:32:51,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-05 21:32:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 385. [2025-02-05 21:32:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 271 states have (on average 1.5166051660516606) internal successors, (411), 272 states have internal predecessors, (411), 111 states have call successors, (111), 2 states have call predecessors, (111), 2 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-02-05 21:32:51,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 633 transitions. [2025-02-05 21:32:51,454 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 633 transitions. Word has length 520 [2025-02-05 21:32:51,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:51,457 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 633 transitions. [2025-02-05 21:32:51,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 633 transitions. [2025-02-05 21:32:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-02-05 21:32:51,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:51,461 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:51,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:32:51,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:51,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:51,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1248901444, now seen corresponding path program 1 times [2025-02-05 21:32:51,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:51,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137029872] [2025-02-05 21:32:51,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:51,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:51,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-05 21:32:51,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-05 21:32:51,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:51,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:32:53,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:53,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137029872] [2025-02-05 21:32:53,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137029872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:53,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:53,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 21:32:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793936629] [2025-02-05 21:32:53,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:53,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:32:53,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:53,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:32:53,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:32:53,890 INFO L87 Difference]: Start difference. First operand 385 states and 633 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:59,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:59,283 INFO L93 Difference]: Finished difference Result 1950 states and 3164 transitions. [2025-02-05 21:32:59,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:32:59,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-02-05 21:32:59,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:59,297 INFO L225 Difference]: With dead ends: 1950 [2025-02-05 21:32:59,297 INFO L226 Difference]: Without dead ends: 1568 [2025-02-05 21:32:59,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2025-02-05 21:32:59,299 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 2160 mSDsluCounter, 2561 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 3137 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:59,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 3137 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-02-05 21:32:59,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2025-02-05 21:32:59,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1253. [2025-02-05 21:32:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 889 states have (on average 1.5118110236220472) internal successors, (1344), 896 states have internal predecessors, (1344), 349 states have call successors, (349), 14 states have call predecessors, (349), 14 states have return successors, (349), 342 states have call predecessors, (349), 349 states have call successors, (349) [2025-02-05 21:32:59,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2042 transitions. [2025-02-05 21:32:59,516 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2042 transitions. Word has length 520 [2025-02-05 21:32:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:59,517 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 2042 transitions. [2025-02-05 21:32:59,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:59,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2042 transitions. [2025-02-05 21:32:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-02-05 21:32:59,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:59,531 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:59,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:32:59,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:59,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1181894691, now seen corresponding path program 1 times [2025-02-05 21:32:59,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:59,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118860957] [2025-02-05 21:32:59,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:59,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:59,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-05 21:32:59,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-05 21:32:59,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:59,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:33:00,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:00,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118860957] [2025-02-05 21:33:00,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118860957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:00,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:00,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:33:00,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860380267] [2025-02-05 21:33:00,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:00,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:33:00,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:00,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:33:00,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:33:00,287 INFO L87 Difference]: Start difference. First operand 1253 states and 2042 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:33:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:00,881 INFO L93 Difference]: Finished difference Result 3859 states and 6281 transitions. [2025-02-05 21:33:00,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:33:00,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-02-05 21:33:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:00,896 INFO L225 Difference]: With dead ends: 3859 [2025-02-05 21:33:00,896 INFO L226 Difference]: Without dead ends: 2609 [2025-02-05 21:33:00,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:33:00,903 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 343 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:00,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1127 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:33:00,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2025-02-05 21:33:01,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2501. [2025-02-05 21:33:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 1774 states have (on average 1.503945885005637) internal successors, (2668), 1788 states have internal predecessors, (2668), 698 states have call successors, (698), 28 states have call predecessors, (698), 28 states have return successors, (698), 684 states have call predecessors, (698), 698 states have call successors, (698) [2025-02-05 21:33:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 4064 transitions. [2025-02-05 21:33:01,236 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 4064 transitions. Word has length 520 [2025-02-05 21:33:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:01,237 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 4064 transitions. [2025-02-05 21:33:01,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:33:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 4064 transitions. [2025-02-05 21:33:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-02-05 21:33:01,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:01,243 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:33:01,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:33:01,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:01,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:01,246 INFO L85 PathProgramCache]: Analyzing trace with hash 676336066, now seen corresponding path program 1 times [2025-02-05 21:33:01,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:01,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556160248] [2025-02-05 21:33:01,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:01,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:01,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-05 21:33:01,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-05 21:33:01,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:01,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:33:01,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:01,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556160248] [2025-02-05 21:33:01,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556160248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:01,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:01,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:33:01,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928710644] [2025-02-05 21:33:01,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:01,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:33:01,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:01,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:33:01,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:33:01,639 INFO L87 Difference]: Start difference. First operand 2501 states and 4064 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:33:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:01,992 INFO L93 Difference]: Finished difference Result 6249 states and 10164 transitions. [2025-02-05 21:33:01,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:33:01,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-02-05 21:33:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:02,013 INFO L225 Difference]: With dead ends: 6249 [2025-02-05 21:33:02,014 INFO L226 Difference]: Without dead ends: 3751 [2025-02-05 21:33:02,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 21:33:02,021 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 204 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:02,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 740 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:33:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2025-02-05 21:33:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 3749. [2025-02-05 21:33:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3749 states, 2659 states have (on average 1.4952989845806695) internal successors, (3976), 2680 states have internal predecessors, (3976), 1047 states have call successors, (1047), 42 states have call predecessors, (1047), 42 states have return successors, (1047), 1026 states have call predecessors, (1047), 1047 states have call successors, (1047) [2025-02-05 21:33:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3749 states to 3749 states and 6070 transitions. [2025-02-05 21:33:02,677 INFO L78 Accepts]: Start accepts. Automaton has 3749 states and 6070 transitions. Word has length 520 [2025-02-05 21:33:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:02,679 INFO L471 AbstractCegarLoop]: Abstraction has 3749 states and 6070 transitions. [2025-02-05 21:33:02,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:33:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3749 states and 6070 transitions. [2025-02-05 21:33:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-02-05 21:33:02,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:02,683 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:33:02,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:33:02,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:02,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash 382933059, now seen corresponding path program 1 times [2025-02-05 21:33:02,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:02,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602242077] [2025-02-05 21:33:02,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:02,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:02,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-05 21:33:02,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-05 21:33:02,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:02,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 156 proven. 87 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-02-05 21:33:03,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:03,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602242077] [2025-02-05 21:33:03,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602242077] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:33:03,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829015224] [2025-02-05 21:33:03,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:03,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:33:03,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:33:03,342 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 21:33:03,343 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 21:33:03,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-05 21:33:03,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-05 21:33:03,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:03,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:03,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:33:03,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:33:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 2031 proven. 18 refuted. 0 times theorem prover too weak. 11235 trivial. 0 not checked. [2025-02-05 21:33:03,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:33:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 225 proven. 18 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-02-05 21:33:04,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829015224] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:33:04,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:33:04,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-02-05 21:33:04,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369930455] [2025-02-05 21:33:04,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:33:04,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:33:04,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:04,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:33:04,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:33:04,031 INFO L87 Difference]: Start difference. First operand 3749 states and 6070 transitions. Second operand has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) [2025-02-05 21:33:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:06,272 INFO L93 Difference]: Finished difference Result 10539 states and 16798 transitions. [2025-02-05 21:33:06,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 21:33:06,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) Word has length 520 [2025-02-05 21:33:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:06,308 INFO L225 Difference]: With dead ends: 10539 [2025-02-05 21:33:06,308 INFO L226 Difference]: Without dead ends: 6793 [2025-02-05 21:33:06,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1063 GetRequests, 1039 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2025-02-05 21:33:06,321 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 844 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:06,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 1525 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 21:33:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6793 states. [2025-02-05 21:33:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6793 to 5340. [2025-02-05 21:33:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5340 states, 3768 states have (on average 1.4721337579617835) internal successors, (5547), 3802 states have internal predecessors, (5547), 1503 states have call successors, (1503), 68 states have call predecessors, (1503), 68 states have return successors, (1503), 1469 states have call predecessors, (1503), 1503 states have call successors, (1503) [2025-02-05 21:33:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5340 states to 5340 states and 8553 transitions. [2025-02-05 21:33:07,245 INFO L78 Accepts]: Start accepts. Automaton has 5340 states and 8553 transitions. Word has length 520 [2025-02-05 21:33:07,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:07,246 INFO L471 AbstractCegarLoop]: Abstraction has 5340 states and 8553 transitions. [2025-02-05 21:33:07,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) [2025-02-05 21:33:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 5340 states and 8553 transitions. [2025-02-05 21:33:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-02-05 21:33:07,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:07,249 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:33:07,257 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 21:33:07,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:33:07,451 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:07,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1085671458, now seen corresponding path program 1 times [2025-02-05 21:33:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:07,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931146067] [2025-02-05 21:33:07,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:07,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:07,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-05 21:33:07,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-05 21:33:07,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:07,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 195 proven. 48 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-02-05 21:33:07,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:07,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931146067] [2025-02-05 21:33:07,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931146067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:33:07,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801249262] [2025-02-05 21:33:07,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:07,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:33:07,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:33:07,949 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 21:33:07,951 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 21:33:08,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-05 21:33:08,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-05 21:33:08,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:08,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:08,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:33:08,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:33:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 8277 proven. 48 refuted. 0 times theorem prover too weak. 4959 trivial. 0 not checked. [2025-02-05 21:33:08,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:33:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 195 proven. 48 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-02-05 21:33:09,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801249262] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:33:09,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:33:09,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-02-05 21:33:09,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82934323] [2025-02-05 21:33:09,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:33:09,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 21:33:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:09,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 21:33:09,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:33:09,197 INFO L87 Difference]: Start difference. First operand 5340 states and 8553 transitions. Second operand has 17 states, 17 states have (on average 13.117647058823529) internal successors, (223), 17 states have internal predecessors, (223), 6 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 6 states have call predecessors, (162), 6 states have call successors, (162) [2025-02-05 21:33:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:10,570 INFO L93 Difference]: Finished difference Result 10714 states and 17084 transitions. [2025-02-05 21:33:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 21:33:10,572 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.117647058823529) internal successors, (223), 17 states have internal predecessors, (223), 6 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 6 states have call predecessors, (162), 6 states have call successors, (162) Word has length 520 [2025-02-05 21:33:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:10,649 INFO L225 Difference]: With dead ends: 10714 [2025-02-05 21:33:10,652 INFO L226 Difference]: Without dead ends: 5504 [2025-02-05 21:33:10,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1050 GetRequests, 1031 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2025-02-05 21:33:10,696 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 930 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:10,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1056 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:33:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2025-02-05 21:33:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 5392. [2025-02-05 21:33:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5392 states, 3813 states have (on average 1.4476789929189615) internal successors, (5520), 3847 states have internal predecessors, (5520), 1503 states have call successors, (1503), 75 states have call predecessors, (1503), 75 states have return successors, (1503), 1469 states have call predecessors, (1503), 1503 states have call successors, (1503) [2025-02-05 21:33:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5392 states to 5392 states and 8526 transitions. [2025-02-05 21:33:11,634 INFO L78 Accepts]: Start accepts. Automaton has 5392 states and 8526 transitions. Word has length 520 [2025-02-05 21:33:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:11,635 INFO L471 AbstractCegarLoop]: Abstraction has 5392 states and 8526 transitions. [2025-02-05 21:33:11,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.117647058823529) internal successors, (223), 17 states have internal predecessors, (223), 6 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 6 states have call predecessors, (162), 6 states have call successors, (162) [2025-02-05 21:33:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5392 states and 8526 transitions. [2025-02-05 21:33:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-02-05 21:33:11,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:11,641 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:33:11,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 21:33:11,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:33:11,842 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:11,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2003343902, now seen corresponding path program 1 times [2025-02-05 21:33:11,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:11,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422345427] [2025-02-05 21:33:11,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:11,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-02-05 21:33:12,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-02-05 21:33:12,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:12,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:27,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 195 proven. 48 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-02-05 21:33:27,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:27,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422345427] [2025-02-05 21:33:27,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422345427] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:33:27,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283970560] [2025-02-05 21:33:27,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:27,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:33:27,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:33:27,703 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 21:33:27,705 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 21:33:27,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-02-05 21:33:27,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-02-05 21:33:27,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:27,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:28,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 21:33:28,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:33:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 4389 proven. 90 refuted. 0 times theorem prover too weak. 8805 trivial. 0 not checked. [2025-02-05 21:33:28,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:33:29,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283970560] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:33:29,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 21:33:29,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2025-02-05 21:33:29,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382091274] [2025-02-05 21:33:29,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 21:33:29,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:33:29,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:29,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:33:29,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-02-05 21:33:29,699 INFO L87 Difference]: Start difference. First operand 5392 states and 8526 transitions. Second operand has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 3 states have call successors, (98), 3 states have call predecessors, (98), 4 states have return successors, (98), 3 states have call predecessors, (98), 3 states have call successors, (98) [2025-02-05 21:33:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:44,105 INFO L93 Difference]: Finished difference Result 20036 states and 31045 transitions. [2025-02-05 21:33:44,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-05 21:33:44,106 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 3 states have call successors, (98), 3 states have call predecessors, (98), 4 states have return successors, (98), 3 states have call predecessors, (98), 3 states have call successors, (98) Word has length 522 [2025-02-05 21:33:44,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:44,165 INFO L225 Difference]: With dead ends: 20036 [2025-02-05 21:33:44,165 INFO L226 Difference]: Without dead ends: 14778 [2025-02-05 21:33:44,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 582 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=855, Invalid=2451, Unknown=0, NotChecked=0, Total=3306 [2025-02-05 21:33:44,178 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 2455 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 3378 mSolverCounterSat, 1543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2521 SdHoareTripleChecker+Valid, 3056 SdHoareTripleChecker+Invalid, 4921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1543 IncrementalHoareTripleChecker+Valid, 3378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:44,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2521 Valid, 3056 Invalid, 4921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1543 Valid, 3378 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2025-02-05 21:33:44,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14778 states. [2025-02-05 21:33:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14778 to 11244. [2025-02-05 21:33:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11244 states, 7866 states have (on average 1.4225781845919145) internal successors, (11190), 7933 states have internal predecessors, (11190), 3171 states have call successors, (3171), 206 states have call predecessors, (3171), 206 states have return successors, (3171), 3104 states have call predecessors, (3171), 3171 states have call successors, (3171) [2025-02-05 21:33:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11244 states to 11244 states and 17532 transitions. [2025-02-05 21:33:46,092 INFO L78 Accepts]: Start accepts. Automaton has 11244 states and 17532 transitions. Word has length 522 [2025-02-05 21:33:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:46,093 INFO L471 AbstractCegarLoop]: Abstraction has 11244 states and 17532 transitions. [2025-02-05 21:33:46,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 3 states have call successors, (98), 3 states have call predecessors, (98), 4 states have return successors, (98), 3 states have call predecessors, (98), 3 states have call successors, (98) [2025-02-05 21:33:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 11244 states and 17532 transitions. [2025-02-05 21:33:46,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-02-05 21:33:46,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:46,098 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:33:46,106 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 21:33:46,298 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,SelfDestructingSolverStorable8 [2025-02-05 21:33:46,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:46,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:46,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1584745922, now seen corresponding path program 1 times [2025-02-05 21:33:46,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:46,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846501703] [2025-02-05 21:33:46,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:46,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:46,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-02-05 21:33:46,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-02-05 21:33:46,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:46,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 291 proven. 189 refuted. 0 times theorem prover too weak. 12804 trivial. 0 not checked. [2025-02-05 21:33:49,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:49,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846501703] [2025-02-05 21:33:49,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846501703] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:33:49,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778252380] [2025-02-05 21:33:49,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:49,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:33:49,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:33:49,075 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 21:33:49,076 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 21:33:49,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-02-05 21:33:49,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-02-05 21:33:49,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:49,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:49,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-05 21:33:49,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:33:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 8840 proven. 594 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2025-02-05 21:33:52,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:33:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 432 proven. 288 refuted. 0 times theorem prover too weak. 12564 trivial. 0 not checked. [2025-02-05 21:33:57,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778252380] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:33:57,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:33:57,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 20] total 56 [2025-02-05 21:33:57,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78916493] [2025-02-05 21:33:57,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:33:57,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-05 21:33:57,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:57,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-05 21:33:57,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=2725, Unknown=0, NotChecked=0, Total=3080 [2025-02-05 21:33:57,876 INFO L87 Difference]: Start difference. First operand 11244 states and 17532 transitions. Second operand has 56 states, 54 states have (on average 6.12962962962963) internal successors, (331), 54 states have internal predecessors, (331), 13 states have call successors, (246), 7 states have call predecessors, (246), 14 states have return successors, (246), 12 states have call predecessors, (246), 13 states have call successors, (246)