./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-9.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-9.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 e6ca059adc2ec28b7106763e3d6b1b450d19a4eff5f7716b68bbd37f426e2990 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:41:21,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:41:21,177 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:41:21,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:41:21,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:41:21,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:41:21,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:41:21,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:41:21,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:41:21,209 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:41:21,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:41:21,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:41:21,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:41:21,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:41:21,210 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:41:21,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:41:21,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:41:21,211 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:41:21,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:41:21,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:41:21,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:41:21,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:41:21,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:41:21,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:41:21,212 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:41:21,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:41:21,212 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:41:21,212 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:41:21,212 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:41:21,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:41:21,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:41:21,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:41:21,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:41:21,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:41:21,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:41:21,213 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:41:21,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:41:21,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:41:21,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:41:21,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:41:21,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:41:21,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:41:21,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:41:21,213 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 -> e6ca059adc2ec28b7106763e3d6b1b450d19a4eff5f7716b68bbd37f426e2990 [2025-02-05 21:41:21,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:41:21,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:41:21,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:41:21,444 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:41:21,445 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:41:21,445 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-9.i [2025-02-05 21:41:22,603 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e27619289/0f68e56901894ede8e383faa24bee326/FLAG2b4c8f291 [2025-02-05 21:41:22,843 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:41:22,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-9.i [2025-02-05 21:41:22,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e27619289/0f68e56901894ede8e383faa24bee326/FLAG2b4c8f291 [2025-02-05 21:41:23,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e27619289/0f68e56901894ede8e383faa24bee326 [2025-02-05 21:41:23,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:41:23,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:41:23,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:41:23,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:41:23,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:41:23,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:41:23" (1/1) ... [2025-02-05 21:41:23,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9ddebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:23, skipping insertion in model container [2025-02-05 21:41:23,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:41:23" (1/1) ... [2025-02-05 21:41:23,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:41:23,294 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-9.i[915,928] [2025-02-05 21:41:23,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:41:23,421 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:41:23,430 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-9.i[915,928] [2025-02-05 21:41:23,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:41:23,519 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:41:23,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:23 WrapperNode [2025-02-05 21:41:23,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:41:23,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:41:23,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:41:23,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:41:23,525 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:41:23" (1/1) ... [2025-02-05 21:41:23,540 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:41:23" (1/1) ... [2025-02-05 21:41:23,595 INFO L138 Inliner]: procedures = 26, calls = 90, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 547 [2025-02-05 21:41:23,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:41:23,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:41:23,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:41:23,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:41:23,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:23" (1/1) ... [2025-02-05 21:41:23,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:23" (1/1) ... [2025-02-05 21:41:23,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:23" (1/1) ... [2025-02-05 21:41:23,631 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:41:23,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:23" (1/1) ... [2025-02-05 21:41:23,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:23" (1/1) ... [2025-02-05 21:41:23,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:23" (1/1) ... [2025-02-05 21:41:23,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:23" (1/1) ... [2025-02-05 21:41:23,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:23" (1/1) ... [2025-02-05 21:41:23,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:23" (1/1) ... [2025-02-05 21:41:23,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:41:23,677 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:41:23,677 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:41:23,678 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:41:23,678 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:23" (1/1) ... [2025-02-05 21:41:23,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:41:23,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:41:23,704 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:41:23,709 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:41:23,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:41:23,724 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:41:23,724 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:41:23,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:41:23,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:41:23,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:41:23,810 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:41:23,812 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:41:24,438 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L443: havoc property_#t~bitwise54#1;havoc property_#t~ite56#1;havoc property_#t~bitwise55#1;havoc property_#t~bitwise57#1;havoc property_#t~short58#1; [2025-02-05 21:41:24,523 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 21:41:24,524 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:41:24,544 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:41:24,545 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:41:24,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:41:24 BoogieIcfgContainer [2025-02-05 21:41:24,545 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:41:24,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:41:24,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:41:24,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:41:24,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:41:23" (1/3) ... [2025-02-05 21:41:24,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1632d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:41:24, skipping insertion in model container [2025-02-05 21:41:24,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:23" (2/3) ... [2025-02-05 21:41:24,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1632d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:41:24, skipping insertion in model container [2025-02-05 21:41:24,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:41:24" (3/3) ... [2025-02-05 21:41:24,551 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-9.i [2025-02-05 21:41:24,561 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:41:24,563 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-9.i that has 2 procedures, 235 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:41:24,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:41:24,629 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;@693b6a95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:41:24,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:41:24,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 155 states have (on average 1.5161290322580645) internal successors, (235), 156 states have internal predecessors, (235), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-02-05 21:41:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-02-05 21:41:24,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:24,657 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:24,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:24,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:24,662 INFO L85 PathProgramCache]: Analyzing trace with hash -993658379, now seen corresponding path program 1 times [2025-02-05 21:41:24,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:24,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362625210] [2025-02-05 21:41:24,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:24,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:24,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-05 21:41:24,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-05 21:41:24,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:24,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2025-02-05 21:41:25,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:25,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362625210] [2025-02-05 21:41:25,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362625210] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:41:25,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108826674] [2025-02-05 21:41:25,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:25,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:41:25,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:41:25,141 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:41:25,142 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:41:25,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-05 21:41:25,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-05 21:41:25,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:25,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:25,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:41:25,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:41:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2025-02-05 21:41:25,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:41:25,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108826674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:25,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:41:25,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:41:25,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371945519] [2025-02-05 21:41:25,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:25,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:41:25,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:25,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:41:25,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:41:25,516 INFO L87 Difference]: Start difference. First operand has 235 states, 155 states have (on average 1.5161290322580645) internal successors, (235), 156 states have internal predecessors, (235), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) Second operand has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) [2025-02-05 21:41:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:25,580 INFO L93 Difference]: Finished difference Result 464 states and 850 transitions. [2025-02-05 21:41:25,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:41:25,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) Word has length 484 [2025-02-05 21:41:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:25,587 INFO L225 Difference]: With dead ends: 464 [2025-02-05 21:41:25,587 INFO L226 Difference]: Without dead ends: 232 [2025-02-05 21:41:25,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 485 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:41:25,594 INFO L435 NwaCegarLoop]: 372 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, 372 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:41:25,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 372 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:41:25,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-05 21:41:25,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-05 21:41:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 153 states have (on average 1.4901960784313726) internal successors, (228), 153 states have internal predecessors, (228), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-02-05 21:41:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 382 transitions. [2025-02-05 21:41:25,652 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 382 transitions. Word has length 484 [2025-02-05 21:41:25,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:25,653 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 382 transitions. [2025-02-05 21:41:25,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) [2025-02-05 21:41:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 382 transitions. [2025-02-05 21:41:25,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-02-05 21:41:25,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:25,666 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:25,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:41:25,869 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:41:25,870 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:25,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:25,870 INFO L85 PathProgramCache]: Analyzing trace with hash 975324534, now seen corresponding path program 1 times [2025-02-05 21:41:25,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:25,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926619159] [2025-02-05 21:41:25,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:25,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:25,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-05 21:41:26,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-05 21:41:26,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:26,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:41:26,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:26,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926619159] [2025-02-05 21:41:26,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926619159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:26,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:26,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:41:26,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574272882] [2025-02-05 21:41:26,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:26,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:41:26,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:26,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:41:26,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:41:26,559 INFO L87 Difference]: Start difference. First operand 232 states and 382 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:41:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:26,613 INFO L93 Difference]: Finished difference Result 462 states and 763 transitions. [2025-02-05 21:41:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:41:26,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 484 [2025-02-05 21:41:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:26,619 INFO L225 Difference]: With dead ends: 462 [2025-02-05 21:41:26,619 INFO L226 Difference]: Without dead ends: 233 [2025-02-05 21:41:26,620 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:41:26,622 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 0 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:26,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 738 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:41:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-05 21:41:26,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-02-05 21:41:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 154 states have (on average 1.4870129870129871) internal successors, (229), 154 states have internal predecessors, (229), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-02-05 21:41:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 383 transitions. [2025-02-05 21:41:26,651 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 383 transitions. Word has length 484 [2025-02-05 21:41:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:26,654 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 383 transitions. [2025-02-05 21:41:26,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:41:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 383 transitions. [2025-02-05 21:41:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-02-05 21:41:26,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:26,658 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:26,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:41:26,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:26,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash -719972527, now seen corresponding path program 1 times [2025-02-05 21:41:26,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:26,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070133535] [2025-02-05 21:41:26,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:26,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:26,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-05 21:41:26,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-05 21:41:26,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:26,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:41:27,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:27,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070133535] [2025-02-05 21:41:27,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070133535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:27,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:27,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:41:27,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304394731] [2025-02-05 21:41:27,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:27,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:41:27,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:27,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:41:27,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:41:27,364 INFO L87 Difference]: Start difference. First operand 233 states and 383 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:41:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:27,424 INFO L93 Difference]: Finished difference Result 693 states and 1143 transitions. [2025-02-05 21:41:27,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:41:27,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 485 [2025-02-05 21:41:27,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:27,432 INFO L225 Difference]: With dead ends: 693 [2025-02-05 21:41:27,433 INFO L226 Difference]: Without dead ends: 463 [2025-02-05 21:41:27,434 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:41:27,435 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 240 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:27,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 737 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:41:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-02-05 21:41:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 461. [2025-02-05 21:41:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 304 states have (on average 1.4901315789473684) internal successors, (453), 304 states have internal predecessors, (453), 154 states have call successors, (154), 2 states have call predecessors, (154), 2 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-02-05 21:41:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 761 transitions. [2025-02-05 21:41:27,514 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 761 transitions. Word has length 485 [2025-02-05 21:41:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:27,515 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 761 transitions. [2025-02-05 21:41:27,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:41:27,515 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 761 transitions. [2025-02-05 21:41:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-02-05 21:41:27,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:27,520 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:27,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:41:27,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:27,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:27,521 INFO L85 PathProgramCache]: Analyzing trace with hash -390206766, now seen corresponding path program 1 times [2025-02-05 21:41:27,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:27,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262800283] [2025-02-05 21:41:27,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:27,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:27,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-05 21:41:27,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-05 21:41:27,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:27,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:41:28,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:28,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262800283] [2025-02-05 21:41:28,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262800283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:28,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:28,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:41:28,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088488506] [2025-02-05 21:41:28,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:28,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:41:28,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:28,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:41:28,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:41:28,493 INFO L87 Difference]: Start difference. First operand 461 states and 761 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-02-05 21:41:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:30,939 INFO L93 Difference]: Finished difference Result 2893 states and 4781 transitions. [2025-02-05 21:41:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:41:30,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) Word has length 485 [2025-02-05 21:41:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:30,953 INFO L225 Difference]: With dead ends: 2893 [2025-02-05 21:41:30,953 INFO L226 Difference]: Without dead ends: 2435 [2025-02-05 21:41:30,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:41:30,958 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 1827 mSDsluCounter, 2480 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1827 SdHoareTripleChecker+Valid, 3391 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:30,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1827 Valid, 3391 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 21:41:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2025-02-05 21:41:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2111. [2025-02-05 21:41:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 1416 states have (on average 1.5007062146892656) internal successors, (2125), 1418 states have internal predecessors, (2125), 684 states have call successors, (684), 10 states have call predecessors, (684), 10 states have return successors, (684), 682 states have call predecessors, (684), 684 states have call successors, (684) [2025-02-05 21:41:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3493 transitions. [2025-02-05 21:41:31,149 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3493 transitions. Word has length 485 [2025-02-05 21:41:31,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:31,150 INFO L471 AbstractCegarLoop]: Abstraction has 2111 states and 3493 transitions. [2025-02-05 21:41:31,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-02-05 21:41:31,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3493 transitions. [2025-02-05 21:41:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-05 21:41:31,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:31,154 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:31,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:41:31,154 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:31,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:31,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1584006599, now seen corresponding path program 1 times [2025-02-05 21:41:31,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:31,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99400263] [2025-02-05 21:41:31,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:31,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:31,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:41:31,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:41:31,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:31,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:41:31,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:31,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99400263] [2025-02-05 21:41:31,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99400263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:31,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:31,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:41:31,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69470869] [2025-02-05 21:41:31,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:31,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:41:31,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:31,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:41:31,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:41:31,441 INFO L87 Difference]: Start difference. First operand 2111 states and 3493 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:41:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:32,020 INFO L93 Difference]: Finished difference Result 8089 states and 13380 transitions. [2025-02-05 21:41:32,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:41:32,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 486 [2025-02-05 21:41:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:32,053 INFO L225 Difference]: With dead ends: 8089 [2025-02-05 21:41:32,054 INFO L226 Difference]: Without dead ends: 5981 [2025-02-05 21:41:32,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:41:32,062 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 926 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:32,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1974 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:41:32,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2025-02-05 21:41:32,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 5959. [2025-02-05 21:41:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5959 states, 4318 states have (on average 1.5250115794349235) internal successors, (6585), 4336 states have internal predecessors, (6585), 1604 states have call successors, (1604), 36 states have call predecessors, (1604), 36 states have return successors, (1604), 1586 states have call predecessors, (1604), 1604 states have call successors, (1604) [2025-02-05 21:41:32,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5959 states to 5959 states and 9793 transitions. [2025-02-05 21:41:32,499 INFO L78 Accepts]: Start accepts. Automaton has 5959 states and 9793 transitions. Word has length 486 [2025-02-05 21:41:32,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:32,500 INFO L471 AbstractCegarLoop]: Abstraction has 5959 states and 9793 transitions. [2025-02-05 21:41:32,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:41:32,500 INFO L276 IsEmpty]: Start isEmpty. Operand 5959 states and 9793 transitions. [2025-02-05 21:41:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-05 21:41:32,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:32,505 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:32,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:41:32,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:32,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:32,506 INFO L85 PathProgramCache]: Analyzing trace with hash -70050842, now seen corresponding path program 1 times [2025-02-05 21:41:32,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:32,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095143242] [2025-02-05 21:41:32,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:32,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:32,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:41:32,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:41:32,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:32,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 33 proven. 195 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:41:36,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:36,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095143242] [2025-02-05 21:41:36,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095143242] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:41:36,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291705081] [2025-02-05 21:41:36,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:36,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:41:36,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:41:36,402 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:41:36,404 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:41:36,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:41:36,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:41:36,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:36,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:36,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:41:36,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:41:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 1228 proven. 228 refuted. 0 times theorem prover too weak. 10248 trivial. 0 not checked. [2025-02-05 21:41:38,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:41:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:41:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291705081] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:41:39,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:41:39,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 20 [2025-02-05 21:41:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498513071] [2025-02-05 21:41:39,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:41:39,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 21:41:39,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:39,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 21:41:39,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-02-05 21:41:39,147 INFO L87 Difference]: Start difference. First operand 5959 states and 9793 transitions. Second operand has 20 states, 20 states have (on average 14.6) internal successors, (292), 20 states have internal predecessors, (292), 7 states have call successors, (230), 3 states have call predecessors, (230), 5 states have return successors, (231), 6 states have call predecessors, (231), 7 states have call successors, (231) [2025-02-05 21:41:43,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:43,566 INFO L93 Difference]: Finished difference Result 15767 states and 25064 transitions. [2025-02-05 21:41:43,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 21:41:43,567 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 14.6) internal successors, (292), 20 states have internal predecessors, (292), 7 states have call successors, (230), 3 states have call predecessors, (230), 5 states have return successors, (231), 6 states have call predecessors, (231), 7 states have call successors, (231) Word has length 486 [2025-02-05 21:41:43,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:43,614 INFO L225 Difference]: With dead ends: 15767 [2025-02-05 21:41:43,615 INFO L226 Difference]: Without dead ends: 9811 [2025-02-05 21:41:43,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1002 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 21:41:43,630 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 1417 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:43,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 1436 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 21:41:43,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9811 states. [2025-02-05 21:41:44,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9811 to 6231. [2025-02-05 21:41:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6231 states, 4522 states have (on average 1.4938080495356036) internal successors, (6755), 4540 states have internal predecessors, (6755), 1604 states have call successors, (1604), 104 states have call predecessors, (1604), 104 states have return successors, (1604), 1586 states have call predecessors, (1604), 1604 states have call successors, (1604) [2025-02-05 21:41:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 9963 transitions. [2025-02-05 21:41:44,278 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 9963 transitions. Word has length 486 [2025-02-05 21:41:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:44,279 INFO L471 AbstractCegarLoop]: Abstraction has 6231 states and 9963 transitions. [2025-02-05 21:41:44,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.6) internal successors, (292), 20 states have internal predecessors, (292), 7 states have call successors, (230), 3 states have call predecessors, (230), 5 states have return successors, (231), 6 states have call predecessors, (231), 7 states have call successors, (231) [2025-02-05 21:41:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 9963 transitions. [2025-02-05 21:41:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-05 21:41:44,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:44,286 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:44,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 21:41:44,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:41:44,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:44,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:44,492 INFO L85 PathProgramCache]: Analyzing trace with hash -580585019, now seen corresponding path program 1 times [2025-02-05 21:41:44,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:44,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757710053] [2025-02-05 21:41:44,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:44,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:44,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:41:44,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:41:44,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:44,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:47,179 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 33 proven. 195 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:41:47,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:47,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757710053] [2025-02-05 21:41:47,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757710053] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:41:47,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504075391] [2025-02-05 21:41:47,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:47,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:41:47,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:41:47,182 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:41:47,183 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:41:47,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:41:47,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:41:47,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:47,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:47,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 21:41:47,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:41:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 5796 proven. 96 refuted. 0 times theorem prover too weak. 5812 trivial. 0 not checked. [2025-02-05 21:41:47,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:41:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 132 proven. 96 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:41:48,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504075391] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:41:48,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:41:48,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 17 [2025-02-05 21:41:48,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628944424] [2025-02-05 21:41:48,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:41:48,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 21:41:48,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:48,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 21:41:48,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:41:48,135 INFO L87 Difference]: Start difference. First operand 6231 states and 9963 transitions. Second operand has 17 states, 17 states have (on average 11.176470588235293) internal successors, (190), 17 states have internal predecessors, (190), 2 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (144), 2 states have call predecessors, (144), 2 states have call successors, (144) [2025-02-05 21:41:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:51,757 INFO L93 Difference]: Finished difference Result 15194 states and 23838 transitions. [2025-02-05 21:41:51,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 21:41:51,762 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 11.176470588235293) internal successors, (190), 17 states have internal predecessors, (190), 2 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (144), 2 states have call predecessors, (144), 2 states have call successors, (144) Word has length 486 [2025-02-05 21:41:51,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:51,806 INFO L225 Difference]: With dead ends: 15194 [2025-02-05 21:41:51,806 INFO L226 Difference]: Without dead ends: 8966 [2025-02-05 21:41:51,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 999 GetRequests, 971 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2025-02-05 21:41:51,820 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 803 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 2461 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:51,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 2461 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 21:41:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8966 states. [2025-02-05 21:41:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8966 to 7255. [2025-02-05 21:41:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7255 states, 5484 states have (on average 1.475382932166302) internal successors, (8091), 5503 states have internal predecessors, (8091), 1648 states have call successors, (1648), 122 states have call predecessors, (1648), 122 states have return successors, (1648), 1629 states have call predecessors, (1648), 1648 states have call successors, (1648) [2025-02-05 21:41:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7255 states to 7255 states and 11387 transitions. [2025-02-05 21:41:52,292 INFO L78 Accepts]: Start accepts. Automaton has 7255 states and 11387 transitions. Word has length 486 [2025-02-05 21:41:52,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:52,296 INFO L471 AbstractCegarLoop]: Abstraction has 7255 states and 11387 transitions. [2025-02-05 21:41:52,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.176470588235293) internal successors, (190), 17 states have internal predecessors, (190), 2 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (144), 2 states have call predecessors, (144), 2 states have call successors, (144) [2025-02-05 21:41:52,296 INFO L276 IsEmpty]: Start isEmpty. Operand 7255 states and 11387 transitions. [2025-02-05 21:41:52,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-05 21:41:52,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:52,304 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:52,312 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:41:52,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:41:52,506 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:52,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:52,507 INFO L85 PathProgramCache]: Analyzing trace with hash 686233479, now seen corresponding path program 1 times [2025-02-05 21:41:52,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:52,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103436182] [2025-02-05 21:41:52,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:52,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:52,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:41:52,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:41:52,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:52,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 33 proven. 195 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:41:55,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:55,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103436182] [2025-02-05 21:41:55,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103436182] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:41:55,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348474803] [2025-02-05 21:41:55,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:55,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:41:55,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:41:55,104 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:41:55,105 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:41:55,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:41:55,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:41:55,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:55,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:55,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 21:41:55,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:41:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:41:55,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:41:55,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348474803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:55,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:41:55,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 17 [2025-02-05 21:41:55,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6778215] [2025-02-05 21:41:55,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:55,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:41:55,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:55,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:41:55,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:41:55,586 INFO L87 Difference]: Start difference. First operand 7255 states and 11387 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:41:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:56,104 INFO L93 Difference]: Finished difference Result 17701 states and 27212 transitions. [2025-02-05 21:41:56,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:41:56,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 486 [2025-02-05 21:41:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:56,140 INFO L225 Difference]: With dead ends: 17701 [2025-02-05 21:41:56,140 INFO L226 Difference]: Without dead ends: 10525 [2025-02-05 21:41:56,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:41:56,158 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 178 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:56,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1538 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:41:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10525 states. [2025-02-05 21:41:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10525 to 8207. [2025-02-05 21:41:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8207 states, 6436 states have (on average 1.4737414543194531) internal successors, (9485), 6455 states have internal predecessors, (9485), 1648 states have call successors, (1648), 122 states have call predecessors, (1648), 122 states have return successors, (1648), 1629 states have call predecessors, (1648), 1648 states have call successors, (1648) [2025-02-05 21:41:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8207 states to 8207 states and 12781 transitions. [2025-02-05 21:41:56,750 INFO L78 Accepts]: Start accepts. Automaton has 8207 states and 12781 transitions. Word has length 486 [2025-02-05 21:41:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:56,752 INFO L471 AbstractCegarLoop]: Abstraction has 8207 states and 12781 transitions. [2025-02-05 21:41:56,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:41:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 8207 states and 12781 transitions. [2025-02-05 21:41:56,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-05 21:41:56,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:56,758 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:56,768 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:41:56,959 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,SelfDestructingSolverStorable7 [2025-02-05 21:41:56,960 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:56,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:56,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1718190415, now seen corresponding path program 1 times [2025-02-05 21:41:56,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:56,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206027610] [2025-02-05 21:41:56,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:56,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:56,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:41:57,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:41:57,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:57,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 33 proven. 195 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:41:58,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:58,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206027610] [2025-02-05 21:41:58,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206027610] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:41:58,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425731177] [2025-02-05 21:41:58,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:58,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:41:58,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:41:58,946 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:41:58,949 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:41:59,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:41:59,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:41:59,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:59,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:59,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 21:41:59,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:41:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:41:59,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:41:59,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425731177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:59,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:41:59,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2025-02-05 21:41:59,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115284709] [2025-02-05 21:41:59,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:59,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:41:59,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:59,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:41:59,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:41:59,398 INFO L87 Difference]: Start difference. First operand 8207 states and 12781 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:41:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:59,986 INFO L93 Difference]: Finished difference Result 18515 states and 28401 transitions. [2025-02-05 21:41:59,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:41:59,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 486 [2025-02-05 21:41:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:00,018 INFO L225 Difference]: With dead ends: 18515 [2025-02-05 21:42:00,018 INFO L226 Difference]: Without dead ends: 10387 [2025-02-05 21:42:00,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 484 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:42:00,032 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 107 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:00,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1848 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:42:00,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10387 states. [2025-02-05 21:42:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10387 to 8207. [2025-02-05 21:42:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8207 states, 6436 states have (on average 1.4737414543194531) internal successors, (9485), 6455 states have internal predecessors, (9485), 1648 states have call successors, (1648), 122 states have call predecessors, (1648), 122 states have return successors, (1648), 1629 states have call predecessors, (1648), 1648 states have call successors, (1648) [2025-02-05 21:42:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8207 states to 8207 states and 12781 transitions. [2025-02-05 21:42:00,438 INFO L78 Accepts]: Start accepts. Automaton has 8207 states and 12781 transitions. Word has length 486 [2025-02-05 21:42:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:00,439 INFO L471 AbstractCegarLoop]: Abstraction has 8207 states and 12781 transitions. [2025-02-05 21:42:00,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:42:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 8207 states and 12781 transitions. [2025-02-05 21:42:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-05 21:42:00,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:00,445 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:00,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 21:42:00,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:00,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:00,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:00,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1742056263, now seen corresponding path program 1 times [2025-02-05 21:42:00,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:00,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611726300] [2025-02-05 21:42:00,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:00,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:00,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:42:00,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:42:00,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:00,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 33 proven. 195 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:42:01,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611726300] [2025-02-05 21:42:01,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611726300] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:42:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994768144] [2025-02-05 21:42:01,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:01,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:01,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:42:01,722 INFO L229 MonitoredProcess]: Starting monitored process 7 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:42:01,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 21:42:01,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:42:01,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:42:01,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:01,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:01,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 21:42:01,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:42:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 3172 proven. 192 refuted. 0 times theorem prover too weak. 8340 trivial. 0 not checked. [2025-02-05 21:42:02,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:42:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:42:03,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994768144] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 21:42:03,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 21:42:03,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 11] total 23 [2025-02-05 21:42:03,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876004885] [2025-02-05 21:42:03,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:03,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:42:03,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:03,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:42:03,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-02-05 21:42:03,492 INFO L87 Difference]: Start difference. First operand 8207 states and 12781 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:42:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:05,050 INFO L93 Difference]: Finished difference Result 20661 states and 31701 transitions. [2025-02-05 21:42:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 21:42:05,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 486 [2025-02-05 21:42:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:05,087 INFO L225 Difference]: With dead ends: 20661 [2025-02-05 21:42:05,087 INFO L226 Difference]: Without dead ends: 12533 [2025-02-05 21:42:05,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 990 GetRequests, 965 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-02-05 21:42:05,099 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 218 mSDsluCounter, 1898 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:05,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 2305 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:42:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12533 states. [2025-02-05 21:42:05,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12533 to 8241. [2025-02-05 21:42:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8241 states, 6470 states have (on average 1.4765069551777434) internal successors, (9553), 6489 states have internal predecessors, (9553), 1648 states have call successors, (1648), 122 states have call predecessors, (1648), 122 states have return successors, (1648), 1629 states have call predecessors, (1648), 1648 states have call successors, (1648) [2025-02-05 21:42:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8241 states to 8241 states and 12849 transitions. [2025-02-05 21:42:05,537 INFO L78 Accepts]: Start accepts. Automaton has 8241 states and 12849 transitions. Word has length 486 [2025-02-05 21:42:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:05,538 INFO L471 AbstractCegarLoop]: Abstraction has 8241 states and 12849 transitions. [2025-02-05 21:42:05,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:42:05,538 INFO L276 IsEmpty]: Start isEmpty. Operand 8241 states and 12849 transitions. [2025-02-05 21:42:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-05 21:42:05,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:05,545 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:05,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 21:42:05,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 21:42:05,746 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:05,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:05,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1520954097, now seen corresponding path program 1 times [2025-02-05 21:42:05,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:05,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072677658] [2025-02-05 21:42:05,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:05,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:05,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:42:05,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:42:05,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:05,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 33 proven. 195 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:42:06,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:06,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072677658] [2025-02-05 21:42:06,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072677658] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:42:06,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440470415] [2025-02-05 21:42:06,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:06,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:06,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:42:06,841 INFO L229 MonitoredProcess]: Starting monitored process 8 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:42:06,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 21:42:06,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:42:07,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:42:07,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:07,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:07,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 21:42:07,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:42:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 3172 proven. 192 refuted. 0 times theorem prover too weak. 8340 trivial. 0 not checked. [2025-02-05 21:42:07,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:42:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:42:08,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440470415] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 21:42:08,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 21:42:08,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 11] total 22 [2025-02-05 21:42:08,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958585821] [2025-02-05 21:42:08,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:08,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:42:08,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:08,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:42:08,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-02-05 21:42:08,410 INFO L87 Difference]: Start difference. First operand 8241 states and 12849 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:42:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:09,817 INFO L93 Difference]: Finished difference Result 20865 states and 32007 transitions. [2025-02-05 21:42:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 21:42:09,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 486 [2025-02-05 21:42:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:09,847 INFO L225 Difference]: With dead ends: 20865 [2025-02-05 21:42:09,848 INFO L226 Difference]: Without dead ends: 12703 [2025-02-05 21:42:09,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 989 GetRequests, 964 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2025-02-05 21:42:09,858 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 259 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:09,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1860 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:42:09,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12703 states. [2025-02-05 21:42:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12703 to 8207. [2025-02-05 21:42:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8207 states, 6436 states have (on average 1.4737414543194531) internal successors, (9485), 6455 states have internal predecessors, (9485), 1648 states have call successors, (1648), 122 states have call predecessors, (1648), 122 states have return successors, (1648), 1629 states have call predecessors, (1648), 1648 states have call successors, (1648) [2025-02-05 21:42:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8207 states to 8207 states and 12781 transitions. [2025-02-05 21:42:10,267 INFO L78 Accepts]: Start accepts. Automaton has 8207 states and 12781 transitions. Word has length 486 [2025-02-05 21:42:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:10,268 INFO L471 AbstractCegarLoop]: Abstraction has 8207 states and 12781 transitions. [2025-02-05 21:42:10,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:42:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 8207 states and 12781 transitions. [2025-02-05 21:42:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-05 21:42:10,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:10,273 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:10,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 21:42:10,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:10,475 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:10,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:10,475 INFO L85 PathProgramCache]: Analyzing trace with hash 897584392, now seen corresponding path program 1 times [2025-02-05 21:42:10,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:10,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020698798] [2025-02-05 21:42:10,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:10,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:10,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:42:10,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:42:10,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:10,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 33 proven. 195 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:42:11,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:11,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020698798] [2025-02-05 21:42:11,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020698798] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:42:11,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900175287] [2025-02-05 21:42:11,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:11,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:11,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:42:11,680 INFO L229 MonitoredProcess]: Starting monitored process 9 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:42:11,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 21:42:11,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:42:11,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:42:11,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:11,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:11,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 21:42:11,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:42:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 1840 proven. 414 refuted. 0 times theorem prover too weak. 9450 trivial. 0 not checked. [2025-02-05 21:42:13,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:42:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 11251 trivial. 0 not checked. [2025-02-05 21:42:14,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900175287] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:42:14,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:42:14,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2025-02-05 21:42:14,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863414600] [2025-02-05 21:42:14,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:42:14,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 21:42:14,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:14,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 21:42:14,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2025-02-05 21:42:14,227 INFO L87 Difference]: Start difference. First operand 8207 states and 12781 transitions. Second operand has 28 states, 28 states have (on average 10.892857142857142) internal successors, (305), 28 states have internal predecessors, (305), 7 states have call successors, (231), 4 states have call predecessors, (231), 8 states have return successors, (231), 7 states have call predecessors, (231), 7 states have call successors, (231) [2025-02-05 21:42:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:20,523 INFO L93 Difference]: Finished difference Result 26187 states and 40161 transitions. [2025-02-05 21:42:20,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-05 21:42:20,523 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.892857142857142) internal successors, (305), 28 states have internal predecessors, (305), 7 states have call successors, (231), 4 states have call predecessors, (231), 8 states have return successors, (231), 7 states have call predecessors, (231), 7 states have call successors, (231) Word has length 486 [2025-02-05 21:42:20,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:20,576 INFO L225 Difference]: With dead ends: 26187 [2025-02-05 21:42:20,576 INFO L226 Difference]: Without dead ends: 18059 [2025-02-05 21:42:20,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1016 GetRequests, 957 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=707, Invalid=2953, Unknown=0, NotChecked=0, Total=3660 [2025-02-05 21:42:20,596 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 1759 mSDsluCounter, 2724 mSDsCounter, 0 mSdLazyCounter, 3087 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 3007 SdHoareTripleChecker+Invalid, 3737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 3087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:20,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 3007 Invalid, 3737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 3087 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-05 21:42:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18059 states. [2025-02-05 21:42:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18059 to 14165. [2025-02-05 21:42:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14165 states, 10600 states have (on average 1.450188679245283) internal successors, (15372), 10637 states have internal predecessors, (15372), 3252 states have call successors, (3252), 312 states have call predecessors, (3252), 312 states have return successors, (3252), 3215 states have call predecessors, (3252), 3252 states have call successors, (3252) [2025-02-05 21:42:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14165 states to 14165 states and 21876 transitions. [2025-02-05 21:42:21,562 INFO L78 Accepts]: Start accepts. Automaton has 14165 states and 21876 transitions. Word has length 486 [2025-02-05 21:42:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:21,562 INFO L471 AbstractCegarLoop]: Abstraction has 14165 states and 21876 transitions. [2025-02-05 21:42:21,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.892857142857142) internal successors, (305), 28 states have internal predecessors, (305), 7 states have call successors, (231), 4 states have call predecessors, (231), 8 states have return successors, (231), 7 states have call predecessors, (231), 7 states have call successors, (231) [2025-02-05 21:42:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 14165 states and 21876 transitions. [2025-02-05 21:42:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-02-05 21:42:21,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:21,567 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:21,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 21:42:21,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:21,768 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:21,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1302626884, now seen corresponding path program 1 times [2025-02-05 21:42:21,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:21,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104093728] [2025-02-05 21:42:21,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:21,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:21,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-02-05 21:42:21,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-02-05 21:42:21,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:21,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:42:21,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525733076] [2025-02-05 21:42:21,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:21,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:21,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:42:21,887 INFO L229 MonitoredProcess]: Starting monitored process 10 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:42:21,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 21:42:22,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-02-05 21:42:22,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-02-05 21:42:22,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:22,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:22,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 21:42:22,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:42:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 1236 proven. 216 refuted. 0 times theorem prover too weak. 10252 trivial. 0 not checked. [2025-02-05 21:42:22,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:42:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 12 proven. 216 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:42:22,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:22,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104093728] [2025-02-05 21:42:22,917 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:42:22,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525733076] [2025-02-05 21:42:22,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525733076] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:42:22,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 21:42:22,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-02-05 21:42:22,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327050145] [2025-02-05 21:42:22,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 21:42:22,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:42:22,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:22,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:42:22,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:42:22,919 INFO L87 Difference]: Start difference. First operand 14165 states and 21876 transitions. Second operand has 16 states, 16 states have (on average 12.5625) internal successors, (201), 16 states have internal predecessors, (201), 3 states have call successors, (149), 2 states have call predecessors, (149), 4 states have return successors, (150), 3 states have call predecessors, (150), 3 states have call successors, (150) [2025-02-05 21:42:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:25,082 INFO L93 Difference]: Finished difference Result 34859 states and 52074 transitions. [2025-02-05 21:42:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 21:42:25,083 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.5625) internal successors, (201), 16 states have internal predecessors, (201), 3 states have call successors, (149), 2 states have call predecessors, (149), 4 states have return successors, (150), 3 states have call predecessors, (150), 3 states have call successors, (150) Word has length 488 [2025-02-05 21:42:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:25,124 INFO L225 Difference]: With dead ends: 34859 [2025-02-05 21:42:25,124 INFO L226 Difference]: Without dead ends: 20781 [2025-02-05 21:42:25,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 960 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2025-02-05 21:42:25,149 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 584 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:25,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1903 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:42:25,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20781 states. [2025-02-05 21:42:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20781 to 15801. [2025-02-05 21:42:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15801 states, 12167 states have (on average 1.4313306484753843) internal successors, (17415), 12204 states have internal predecessors, (17415), 3252 states have call successors, (3252), 381 states have call predecessors, (3252), 381 states have return successors, (3252), 3215 states have call predecessors, (3252), 3252 states have call successors, (3252) [2025-02-05 21:42:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15801 states to 15801 states and 23919 transitions. [2025-02-05 21:42:26,308 INFO L78 Accepts]: Start accepts. Automaton has 15801 states and 23919 transitions. Word has length 488 [2025-02-05 21:42:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:26,308 INFO L471 AbstractCegarLoop]: Abstraction has 15801 states and 23919 transitions. [2025-02-05 21:42:26,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.5625) internal successors, (201), 16 states have internal predecessors, (201), 3 states have call successors, (149), 2 states have call predecessors, (149), 4 states have return successors, (150), 3 states have call predecessors, (150), 3 states have call successors, (150) [2025-02-05 21:42:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 15801 states and 23919 transitions. [2025-02-05 21:42:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-02-05 21:42:26,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:26,314 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:26,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 21:42:26,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:26,515 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:26,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash 875797004, now seen corresponding path program 1 times [2025-02-05 21:42:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:26,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921233597] [2025-02-05 21:42:26,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:26,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:26,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-02-05 21:42:26,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-02-05 21:42:26,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:26,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:42:26,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:26,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921233597] [2025-02-05 21:42:26,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921233597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:26,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:26,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:42:26,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082647259] [2025-02-05 21:42:26,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:26,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:42:26,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:26,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:42:26,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:26,605 INFO L87 Difference]: Start difference. First operand 15801 states and 23919 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:42:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:28,731 INFO L93 Difference]: Finished difference Result 42733 states and 65037 transitions. [2025-02-05 21:42:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:42:28,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 488 [2025-02-05 21:42:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:28,829 INFO L225 Difference]: With dead ends: 42733 [2025-02-05 21:42:28,830 INFO L226 Difference]: Without dead ends: 27023 [2025-02-05 21:42:28,869 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:42:28,870 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 360 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:28,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 729 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:42:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27023 states. [2025-02-05 21:42:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27023 to 16014. [2025-02-05 21:42:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16014 states, 12271 states have (on average 1.4222964713552277) internal successors, (17453), 12310 states have internal predecessors, (17453), 3348 states have call successors, (3348), 394 states have call predecessors, (3348), 394 states have return successors, (3348), 3309 states have call predecessors, (3348), 3348 states have call successors, (3348) [2025-02-05 21:42:30,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16014 states to 16014 states and 24149 transitions. [2025-02-05 21:42:30,540 INFO L78 Accepts]: Start accepts. Automaton has 16014 states and 24149 transitions. Word has length 488 [2025-02-05 21:42:30,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:30,540 INFO L471 AbstractCegarLoop]: Abstraction has 16014 states and 24149 transitions. [2025-02-05 21:42:30,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:42:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 16014 states and 24149 transitions. [2025-02-05 21:42:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-02-05 21:42:30,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:30,547 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:30,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:42:30,547 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:30,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1098822990, now seen corresponding path program 1 times [2025-02-05 21:42:30,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:30,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428786295] [2025-02-05 21:42:30,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:30,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:30,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-02-05 21:42:30,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-02-05 21:42:30,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:30,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:42:31,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:31,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428786295] [2025-02-05 21:42:31,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428786295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:31,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:31,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:42:31,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530415138] [2025-02-05 21:42:31,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:31,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:42:31,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:31,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:42:31,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:42:31,370 INFO L87 Difference]: Start difference. First operand 16014 states and 24149 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:42:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:33,372 INFO L93 Difference]: Finished difference Result 44935 states and 64813 transitions. [2025-02-05 21:42:33,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:42:33,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 488 [2025-02-05 21:42:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:33,454 INFO L225 Difference]: With dead ends: 44935 [2025-02-05 21:42:33,455 INFO L226 Difference]: Without dead ends: 29012 [2025-02-05 21:42:33,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:42:33,485 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 220 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:33,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 922 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:42:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29012 states. [2025-02-05 21:42:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29012 to 20680. [2025-02-05 21:42:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20680 states, 16391 states have (on average 1.4011957781709474) internal successors, (22967), 16464 states have internal predecessors, (22967), 3722 states have call successors, (3722), 566 states have call predecessors, (3722), 566 states have return successors, (3722), 3649 states have call predecessors, (3722), 3722 states have call successors, (3722) [2025-02-05 21:42:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20680 states to 20680 states and 30411 transitions. [2025-02-05 21:42:35,410 INFO L78 Accepts]: Start accepts. Automaton has 20680 states and 30411 transitions. Word has length 488 [2025-02-05 21:42:35,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:35,410 INFO L471 AbstractCegarLoop]: Abstraction has 20680 states and 30411 transitions. [2025-02-05 21:42:35,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:42:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 20680 states and 30411 transitions. [2025-02-05 21:42:35,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-02-05 21:42:35,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:35,416 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:35,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 21:42:35,416 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:35,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:35,417 INFO L85 PathProgramCache]: Analyzing trace with hash -274038622, now seen corresponding path program 1 times [2025-02-05 21:42:35,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:35,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938476997] [2025-02-05 21:42:35,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:35,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:35,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-02-05 21:42:35,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-02-05 21:42:35,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:35,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:42:37,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:37,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938476997] [2025-02-05 21:42:37,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938476997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:37,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:37,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 21:42:37,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271955851] [2025-02-05 21:42:37,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:37,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 21:42:37,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:37,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 21:42:37,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:42:37,178 INFO L87 Difference]: Start difference. First operand 20680 states and 30411 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:42:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:41,695 INFO L93 Difference]: Finished difference Result 59142 states and 86661 transitions. [2025-02-05 21:42:41,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 21:42:41,696 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 489 [2025-02-05 21:42:41,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:41,795 INFO L225 Difference]: With dead ends: 59142 [2025-02-05 21:42:41,795 INFO L226 Difference]: Without dead ends: 38553 [2025-02-05 21:42:41,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:42:41,829 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 552 mSDsluCounter, 4671 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 5346 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:41,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 5346 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 21:42:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38553 states. [2025-02-05 21:42:43,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38553 to 23740. [2025-02-05 21:42:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23740 states, 19451 states have (on average 1.395763713947869) internal successors, (27149), 19524 states have internal predecessors, (27149), 3722 states have call successors, (3722), 566 states have call predecessors, (3722), 566 states have return successors, (3722), 3649 states have call predecessors, (3722), 3722 states have call successors, (3722) [2025-02-05 21:42:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23740 states to 23740 states and 34593 transitions. [2025-02-05 21:42:43,844 INFO L78 Accepts]: Start accepts. Automaton has 23740 states and 34593 transitions. Word has length 489 [2025-02-05 21:42:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:43,844 INFO L471 AbstractCegarLoop]: Abstraction has 23740 states and 34593 transitions. [2025-02-05 21:42:43,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:42:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 23740 states and 34593 transitions. [2025-02-05 21:42:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-02-05 21:42:43,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:43,851 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:43,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 21:42:43,851 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:43,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:43,851 INFO L85 PathProgramCache]: Analyzing trace with hash -51012636, now seen corresponding path program 1 times [2025-02-05 21:42:43,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:43,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149990696] [2025-02-05 21:42:43,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:43,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:43,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-02-05 21:42:43,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-02-05 21:42:43,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:43,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:42:44,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:44,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149990696] [2025-02-05 21:42:44,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149990696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:44,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:44,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:42:44,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485607194] [2025-02-05 21:42:44,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:44,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:42:44,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:44,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:42:44,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:42:44,498 INFO L87 Difference]: Start difference. First operand 23740 states and 34593 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77)