./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/mbpr4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/array-tiling/mbpr4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 16:57:45,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 16:57:45,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 16:57:45,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 16:57:45,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 16:57:45,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 16:57:45,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 16:57:45,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 16:57:45,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 16:57:45,674 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 16:57:45,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 16:57:45,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 16:57:45,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 16:57:45,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 16:57:45,676 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 16:57:45,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 16:57:45,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 16:57:45,676 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 16:57:45,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 16:57:45,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 16:57:45,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 16:57:45,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 16:57:45,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 16:57:45,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 16:57:45,677 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 16:57:45,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 16:57:45,677 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 16:57:45,677 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 16:57:45,677 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 16:57:45,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 16:57:45,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 16:57:45,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 16:57:45,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 16:57:45,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 16:57:45,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 16:57:45,678 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 16:57:45,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 16:57:45,678 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 16:57:45,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 16:57:45,678 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 16:57:45,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 16:57:45,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 16:57:45,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 16:57:45,679 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 -> d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 [2025-02-07 16:57:45,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 16:57:45,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 16:57:45,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 16:57:45,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 16:57:45,910 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 16:57:45,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr4.c [2025-02-07 16:57:47,042 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c565ce53c/19efff61124e4e4a9112ad60ba404841/FLAG9ed902dee [2025-02-07 16:57:47,270 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 16:57:47,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr4.c [2025-02-07 16:57:47,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c565ce53c/19efff61124e4e4a9112ad60ba404841/FLAG9ed902dee [2025-02-07 16:57:47,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c565ce53c/19efff61124e4e4a9112ad60ba404841 [2025-02-07 16:57:47,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 16:57:47,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 16:57:47,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 16:57:47,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 16:57:47,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 16:57:47,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 04:57:47" (1/1) ... [2025-02-07 16:57:47,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2959b12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47, skipping insertion in model container [2025-02-07 16:57:47,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 04:57:47" (1/1) ... [2025-02-07 16:57:47,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 16:57:47,411 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/array-tiling/mbpr4.c[396,409] [2025-02-07 16:57:47,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 16:57:47,436 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 16:57:47,442 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/array-tiling/mbpr4.c[396,409] [2025-02-07 16:57:47,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 16:57:47,473 INFO L204 MainTranslator]: Completed translation [2025-02-07 16:57:47,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47 WrapperNode [2025-02-07 16:57:47,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 16:57:47,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 16:57:47,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 16:57:47,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 16:57:47,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47" (1/1) ... [2025-02-07 16:57:47,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47" (1/1) ... [2025-02-07 16:57:47,500 INFO L138 Inliner]: procedures = 15, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 131 [2025-02-07 16:57:47,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 16:57:47,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 16:57:47,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 16:57:47,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 16:57:47,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47" (1/1) ... [2025-02-07 16:57:47,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47" (1/1) ... [2025-02-07 16:57:47,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47" (1/1) ... [2025-02-07 16:57:47,519 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 8, 34]. 77 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 20 writes are split as follows [0, 0, 20]. [2025-02-07 16:57:47,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47" (1/1) ... [2025-02-07 16:57:47,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47" (1/1) ... [2025-02-07 16:57:47,530 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47" (1/1) ... [2025-02-07 16:57:47,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47" (1/1) ... [2025-02-07 16:57:47,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47" (1/1) ... [2025-02-07 16:57:47,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47" (1/1) ... [2025-02-07 16:57:47,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 16:57:47,537 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 16:57:47,537 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 16:57:47,537 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 16:57:47,538 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47" (1/1) ... [2025-02-07 16:57:47,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 16:57:47,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:57:47,565 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-07 16:57:47,568 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-07 16:57:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 16:57:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 16:57:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 16:57:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 16:57:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 16:57:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 16:57:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 16:57:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 16:57:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 16:57:47,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 16:57:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 16:57:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 16:57:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 16:57:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 16:57:47,631 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 16:57:47,633 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 16:57:47,828 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-07 16:57:47,828 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 16:57:47,834 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 16:57:47,835 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 16:57:47,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 04:57:47 BoogieIcfgContainer [2025-02-07 16:57:47,835 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 16:57:47,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 16:57:47,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 16:57:47,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 16:57:47,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 04:57:47" (1/3) ... [2025-02-07 16:57:47,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf8c4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 04:57:47, skipping insertion in model container [2025-02-07 16:57:47,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:47" (2/3) ... [2025-02-07 16:57:47,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf8c4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 04:57:47, skipping insertion in model container [2025-02-07 16:57:47,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 04:57:47" (3/3) ... [2025-02-07 16:57:47,841 INFO L128 eAbstractionObserver]: Analyzing ICFG mbpr4.c [2025-02-07 16:57:47,852 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 16:57:47,853 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mbpr4.c that has 1 procedures, 28 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-07 16:57:47,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 16:57:47,893 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;@43cdae71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 16:57:47,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 16:57:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 25 states have (on average 1.6) internal successors, (40), 27 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:47,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 16:57:47,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:47,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:47,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:47,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:47,903 INFO L85 PathProgramCache]: Analyzing trace with hash 676718988, now seen corresponding path program 1 times [2025-02-07 16:57:47,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:47,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182942986] [2025-02-07 16:57:47,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:47,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:47,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 16:57:47,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 16:57:47,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:47,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:48,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:57:48,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:48,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182942986] [2025-02-07 16:57:48,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182942986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:57:48,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:57:48,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 16:57:48,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662129241] [2025-02-07 16:57:48,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:57:48,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 16:57:48,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:48,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 16:57:48,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 16:57:48,074 INFO L87 Difference]: Start difference. First operand has 28 states, 25 states have (on average 1.6) internal successors, (40), 27 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:48,084 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2025-02-07 16:57:48,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 16:57:48,086 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-07 16:57:48,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:48,091 INFO L225 Difference]: With dead ends: 51 [2025-02-07 16:57:48,091 INFO L226 Difference]: Without dead ends: 24 [2025-02-07 16:57:48,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 16:57:48,097 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:48,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:57:48,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-07 16:57:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-07 16:57:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2025-02-07 16:57:48,125 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 14 [2025-02-07 16:57:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:48,125 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2025-02-07 16:57:48,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2025-02-07 16:57:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 16:57:48,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:48,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:48,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 16:57:48,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:48,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:48,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1120232371, now seen corresponding path program 1 times [2025-02-07 16:57:48,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:48,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449960042] [2025-02-07 16:57:48,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:48,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:48,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 16:57:48,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 16:57:48,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:48,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:57:48,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449960042] [2025-02-07 16:57:48,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449960042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:57:48,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:57:48,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 16:57:48,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893345406] [2025-02-07 16:57:48,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:57:48,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 16:57:48,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:48,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 16:57:48,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 16:57:48,438 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:48,539 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2025-02-07 16:57:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 16:57:48,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-07 16:57:48,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:48,540 INFO L225 Difference]: With dead ends: 52 [2025-02-07 16:57:48,540 INFO L226 Difference]: Without dead ends: 36 [2025-02-07 16:57:48,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 16:57:48,540 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 56 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:48,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 17 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 16:57:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-07 16:57:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2025-02-07 16:57:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-02-07 16:57:48,551 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 14 [2025-02-07 16:57:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:48,551 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-02-07 16:57:48,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-02-07 16:57:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 16:57:48,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:48,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:48,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 16:57:48,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:48,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:48,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1601696497, now seen corresponding path program 1 times [2025-02-07 16:57:48,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:48,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746566637] [2025-02-07 16:57:48,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:48,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:48,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 16:57:48,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 16:57:48,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:48,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 16:57:48,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:48,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746566637] [2025-02-07 16:57:48,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746566637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:57:48,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:57:48,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 16:57:48,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734426031] [2025-02-07 16:57:48,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:57:48,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 16:57:48,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:48,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 16:57:48,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 16:57:48,703 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:48,722 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2025-02-07 16:57:48,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 16:57:48,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-07 16:57:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:48,723 INFO L225 Difference]: With dead ends: 38 [2025-02-07 16:57:48,723 INFO L226 Difference]: Without dead ends: 28 [2025-02-07 16:57:48,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 16:57:48,724 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:48,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:57:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-07 16:57:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-07 16:57:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-02-07 16:57:48,730 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 26 [2025-02-07 16:57:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:48,730 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-02-07 16:57:48,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-02-07 16:57:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 16:57:48,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:48,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:48,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 16:57:48,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:48,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash 141113838, now seen corresponding path program 1 times [2025-02-07 16:57:48,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:48,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085668238] [2025-02-07 16:57:48,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:48,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:48,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 16:57:48,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 16:57:48,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:48,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:57:50,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:50,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085668238] [2025-02-07 16:57:50,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085668238] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:57:50,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948882827] [2025-02-07 16:57:50,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:50,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:50,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:57:50,047 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-07 16:57:50,050 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-07 16:57:50,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 16:57:50,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 16:57:50,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:50,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:50,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-07 16:57:50,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:57:50,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:57:50,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:50,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2025-02-07 16:57:50,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:57:50,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:50,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 18 [2025-02-07 16:57:50,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:57:50,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:50,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 18 [2025-02-07 16:57:50,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:57:50,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:50,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 35 [2025-02-07 16:57:50,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:50,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-02-07 16:57:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:57:50,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:57:50,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 16:57:50,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-07 16:57:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 16:57:50,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948882827] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:57:50,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:57:50,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 20 [2025-02-07 16:57:50,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481016087] [2025-02-07 16:57:50,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:57:50,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 16:57:50,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:50,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 16:57:50,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-02-07 16:57:50,749 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:51,044 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2025-02-07 16:57:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 16:57:51,045 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-07 16:57:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:51,045 INFO L225 Difference]: With dead ends: 75 [2025-02-07 16:57:51,045 INFO L226 Difference]: Without dead ends: 53 [2025-02-07 16:57:51,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=606, Unknown=0, NotChecked=0, Total=812 [2025-02-07 16:57:51,046 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 178 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:51,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 85 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 16:57:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-07 16:57:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2025-02-07 16:57:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-02-07 16:57:51,051 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 26 [2025-02-07 16:57:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:51,051 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-02-07 16:57:51,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-02-07 16:57:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 16:57:51,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:51,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:51,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 16:57:51,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:51,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:51,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash 141143629, now seen corresponding path program 1 times [2025-02-07 16:57:51,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:51,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259358607] [2025-02-07 16:57:51,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:51,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:51,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 16:57:51,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 16:57:51,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:51,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 16:57:51,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:51,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259358607] [2025-02-07 16:57:51,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259358607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:57:51,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:57:51,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 16:57:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583530536] [2025-02-07 16:57:51,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:57:51,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 16:57:51,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:51,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 16:57:51,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 16:57:51,319 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:51,340 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-02-07 16:57:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 16:57:51,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-07 16:57:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:51,341 INFO L225 Difference]: With dead ends: 34 [2025-02-07 16:57:51,341 INFO L226 Difference]: Without dead ends: 32 [2025-02-07 16:57:51,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 16:57:51,342 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:51,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:57:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-07 16:57:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-07 16:57:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-02-07 16:57:51,350 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2025-02-07 16:57:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:51,351 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-02-07 16:57:51,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:51,351 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-02-07 16:57:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 16:57:51,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:51,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:51,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 16:57:51,352 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:51,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1910860990, now seen corresponding path program 1 times [2025-02-07 16:57:51,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:51,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547941963] [2025-02-07 16:57:51,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:51,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:51,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 16:57:51,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 16:57:51,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:51,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 16:57:51,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547941963] [2025-02-07 16:57:51,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547941963] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:57:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791620718] [2025-02-07 16:57:51,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:51,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:51,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:57:51,981 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-07 16:57:51,982 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-07 16:57:52,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 16:57:52,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 16:57:52,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:52,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:52,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-07 16:57:52,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:57:52,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:57:52,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:52,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2025-02-07 16:57:52,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:57:52,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2025-02-07 16:57:52,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:57:52,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:52,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 35 [2025-02-07 16:57:52,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:52,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-02-07 16:57:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 16:57:52,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:57:52,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-07 16:57:52,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-07 16:57:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 16:57:52,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791620718] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:57:52,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:57:52,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 21 [2025-02-07 16:57:52,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778711864] [2025-02-07 16:57:52,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:57:52,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-07 16:57:52,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:52,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-07 16:57:52,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-02-07 16:57:52,541 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:52,831 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2025-02-07 16:57:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 16:57:52,832 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-07 16:57:52,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:52,832 INFO L225 Difference]: With dead ends: 74 [2025-02-07 16:57:52,832 INFO L226 Difference]: Without dead ends: 52 [2025-02-07 16:57:52,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2025-02-07 16:57:52,833 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 155 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:52,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 91 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 16:57:52,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-07 16:57:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2025-02-07 16:57:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-02-07 16:57:52,837 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 31 [2025-02-07 16:57:52,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:52,837 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-02-07 16:57:52,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-02-07 16:57:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-07 16:57:52,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:52,838 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:52,846 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-07 16:57:53,038 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-07 16:57:53,040 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:53,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1260944366, now seen corresponding path program 2 times [2025-02-07 16:57:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:53,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283130546] [2025-02-07 16:57:53,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:57:53,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:53,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-07 16:57:53,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 16:57:53,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:57:53,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 16:57:53,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283130546] [2025-02-07 16:57:53,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283130546] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:57:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453786685] [2025-02-07 16:57:53,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:57:53,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:53,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:57:53,489 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-07 16:57:53,491 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-07 16:57:53,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-07 16:57:53,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 16:57:53,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:57:53,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:53,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-07 16:57:53,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:57:53,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:57:53,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:53,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2025-02-07 16:57:53,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:57:53,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:53,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 35 [2025-02-07 16:57:53,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:53,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-02-07 16:57:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 16:57:53,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:57:54,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-07 16:57:54,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-07 16:57:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 16:57:54,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453786685] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:57:54,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:57:54,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 24 [2025-02-07 16:57:54,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393914616] [2025-02-07 16:57:54,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:57:54,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-07 16:57:54,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:54,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-07 16:57:54,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-02-07 16:57:54,075 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:54,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:54,445 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2025-02-07 16:57:54,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 16:57:54,445 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-07 16:57:54,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:54,445 INFO L225 Difference]: With dead ends: 82 [2025-02-07 16:57:54,445 INFO L226 Difference]: Without dead ends: 59 [2025-02-07 16:57:54,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=997, Unknown=0, NotChecked=0, Total=1260 [2025-02-07 16:57:54,446 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 140 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:54,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 106 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 16:57:54,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-07 16:57:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2025-02-07 16:57:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-02-07 16:57:54,450 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2025-02-07 16:57:54,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:54,451 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-02-07 16:57:54,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-02-07 16:57:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-07 16:57:54,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:54,452 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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-07 16:57:54,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 16:57:54,652 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-07 16:57:54,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:54,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:54,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1369478466, now seen corresponding path program 3 times [2025-02-07 16:57:54,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:54,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214390572] [2025-02-07 16:57:54,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 16:57:54,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:54,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-02-07 16:57:54,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 16:57:54,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 16:57:54,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 16:57:55,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214390572] [2025-02-07 16:57:55,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214390572] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:57:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461662507] [2025-02-07 16:57:55,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 16:57:55,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:55,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:57:55,183 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-07 16:57:55,183 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-07 16:57:55,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-02-07 16:57:55,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 16:57:55,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 16:57:55,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:55,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-07 16:57:55,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:57:55,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-07 16:57:55,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:55,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 38 [2025-02-07 16:57:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 16:57:55,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:57:55,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 16:57:55,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 16:57:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 16:57:55,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461662507] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:57:55,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:57:55,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 32 [2025-02-07 16:57:55,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293046752] [2025-02-07 16:57:55,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:57:55,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-07 16:57:55,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:55,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-07 16:57:55,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2025-02-07 16:57:55,622 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 32 states, 32 states have (on average 3.125) internal successors, (100), 32 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:56,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:56,612 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2025-02-07 16:57:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-07 16:57:56,613 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.125) internal successors, (100), 32 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-07 16:57:56,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:56,614 INFO L225 Difference]: With dead ends: 140 [2025-02-07 16:57:56,614 INFO L226 Difference]: Without dead ends: 75 [2025-02-07 16:57:56,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=667, Invalid=3623, Unknown=0, NotChecked=0, Total=4290 [2025-02-07 16:57:56,616 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 262 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:56,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 112 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 16:57:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-07 16:57:56,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2025-02-07 16:57:56,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:56,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-02-07 16:57:56,624 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 41 [2025-02-07 16:57:56,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:56,624 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-02-07 16:57:56,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.125) internal successors, (100), 32 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:56,624 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-02-07 16:57:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-07 16:57:56,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:56,625 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:56,631 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-07 16:57:56,829 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-07 16:57:56,829 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:56,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:56,829 INFO L85 PathProgramCache]: Analyzing trace with hash -641275988, now seen corresponding path program 4 times [2025-02-07 16:57:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:56,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373815511] [2025-02-07 16:57:56,829 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 16:57:56,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:56,852 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-02-07 16:57:56,875 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-02-07 16:57:56,875 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 16:57:56,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 16:57:58,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:58,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373815511] [2025-02-07 16:57:58,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373815511] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:57:58,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64092446] [2025-02-07 16:57:58,048 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 16:57:58,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:58,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:57:58,050 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-07 16:57:58,052 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-07 16:57:58,102 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-02-07 16:57:58,135 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-02-07 16:57:58,135 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 16:57:58,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:58,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-02-07 16:57:58,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:57:58,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:57:58,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:58,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2025-02-07 16:57:58,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:57:58,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:58,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 28 [2025-02-07 16:57:58,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:58,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2025-02-07 16:57:58,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:58,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 35 [2025-02-07 16:57:58,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:58,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 35 [2025-02-07 16:57:58,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:58,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 38 [2025-02-07 16:57:58,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:58,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 42 [2025-02-07 16:57:58,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:58,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 45 [2025-02-07 16:57:58,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:58,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 52 [2025-02-07 16:57:58,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:58,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 66 treesize of output 62 [2025-02-07 16:57:58,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:58,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 48 treesize of output 62 [2025-02-07 16:57:58,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:58,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 73 treesize of output 65 [2025-02-07 16:57:59,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:59,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 51 treesize of output 19 [2025-02-07 16:57:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:57:59,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:57:59,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-07 16:57:59,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-07 16:57:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 16:57:59,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64092446] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:57:59,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:57:59,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 27, 13] total 47 [2025-02-07 16:57:59,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968548857] [2025-02-07 16:57:59,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:57:59,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-07 16:57:59,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:59,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-07 16:57:59,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1917, Unknown=0, NotChecked=0, Total=2162 [2025-02-07 16:57:59,716 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 47 states, 47 states have (on average 3.234042553191489) internal successors, (152), 47 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:04,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 16:58:08,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 16:58:12,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 16:58:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:14,546 INFO L93 Difference]: Finished difference Result 250 states and 288 transitions. [2025-02-07 16:58:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-02-07 16:58:14,546 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.234042553191489) internal successors, (152), 47 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-07 16:58:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:14,548 INFO L225 Difference]: With dead ends: 250 [2025-02-07 16:58:14,548 INFO L226 Difference]: Without dead ends: 241 [2025-02-07 16:58:14,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 87 SyntacticMatches, 10 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4097 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1597, Invalid=11285, Unknown=0, NotChecked=0, Total=12882 [2025-02-07 16:58:14,551 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 986 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 330 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:14,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 318 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1626 Invalid, 3 Unknown, 0 Unchecked, 13.1s Time] [2025-02-07 16:58:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-07 16:58:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 64. [2025-02-07 16:58:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2025-02-07 16:58:14,564 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 58 [2025-02-07 16:58:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:14,564 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2025-02-07 16:58:14,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.234042553191489) internal successors, (152), 47 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2025-02-07 16:58:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-07 16:58:14,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:14,565 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:14,571 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-07 16:58:14,765 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-07 16:58:14,766 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:14,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:14,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1833215424, now seen corresponding path program 5 times [2025-02-07 16:58:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:14,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132867255] [2025-02-07 16:58:14,766 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 16:58:14,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:14,780 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 63 statements into 6 equivalence classes. [2025-02-07 16:58:14,807 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 63 of 63 statements. [2025-02-07 16:58:14,809 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-07 16:58:14,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 70 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 16:58:15,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:15,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132867255] [2025-02-07 16:58:15,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132867255] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:15,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950427132] [2025-02-07 16:58:15,745 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 16:58:15,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:15,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:15,747 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-07 16:58:15,749 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-07 16:58:15,804 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 63 statements into 6 equivalence classes. [2025-02-07 16:58:17,651 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 63 of 63 statements. [2025-02-07 16:58:17,651 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-07 16:58:17,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:17,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-07 16:58:17,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:17,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:58:17,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:17,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2025-02-07 16:58:17,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:58:17,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:17,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 28 [2025-02-07 16:58:17,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:17,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2025-02-07 16:58:17,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:17,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 28 [2025-02-07 16:58:18,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:18,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 35 [2025-02-07 16:58:18,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:18,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 52 [2025-02-07 16:58:18,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:18,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 45 [2025-02-07 16:58:18,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:18,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 55 [2025-02-07 16:58:18,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:18,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 16 [2025-02-07 16:58:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 79 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 16:58:18,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:19,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-07 16:58:19,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-07 16:58:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 16:58:19,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950427132] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:19,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:19,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23, 13] total 44 [2025-02-07 16:58:19,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049328730] [2025-02-07 16:58:19,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:19,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-07 16:58:19,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:19,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-07 16:58:19,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1661, Unknown=0, NotChecked=0, Total=1892 [2025-02-07 16:58:19,113 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 44 states, 44 states have (on average 3.727272727272727) internal successors, (164), 44 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:20,865 INFO L93 Difference]: Finished difference Result 176 states and 201 transitions. [2025-02-07 16:58:20,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-02-07 16:58:20,865 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.727272727272727) internal successors, (164), 44 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-07 16:58:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:20,866 INFO L225 Difference]: With dead ends: 176 [2025-02-07 16:58:20,866 INFO L226 Difference]: Without dead ends: 167 [2025-02-07 16:58:20,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 103 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2539 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=968, Invalid=7042, Unknown=0, NotChecked=0, Total=8010 [2025-02-07 16:58:20,869 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 571 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:20,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 218 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 16:58:20,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-07 16:58:20,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 69. [2025-02-07 16:58:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:20,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2025-02-07 16:58:20,881 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 63 [2025-02-07 16:58:20,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:20,882 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2025-02-07 16:58:20,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.727272727272727) internal successors, (164), 44 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2025-02-07 16:58:20,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-07 16:58:20,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:20,883 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:20,895 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-07 16:58:21,083 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-07 16:58:21,084 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:21,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash -623995860, now seen corresponding path program 6 times [2025-02-07 16:58:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:21,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468238690] [2025-02-07 16:58:21,084 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 16:58:21,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:21,094 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 7 equivalence classes. [2025-02-07 16:58:21,134 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 68 of 68 statements. [2025-02-07 16:58:21,134 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-07 16:58:21,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 12 proven. 102 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 16:58:21,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:21,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468238690] [2025-02-07 16:58:21,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468238690] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:21,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020738020] [2025-02-07 16:58:21,996 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 16:58:21,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:21,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:21,999 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-07 16:58:22,000 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-07 16:58:22,067 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 7 equivalence classes. [2025-02-07 16:58:22,584 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 68 of 68 statements. [2025-02-07 16:58:22,584 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-07 16:58:22,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:22,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-07 16:58:22,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:22,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-07 16:58:22,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:22,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 22 [2025-02-07 16:58:22,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-07 16:58:22,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:22,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 50 [2025-02-07 16:58:22,858 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-02-07 16:58:22,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2025-02-07 16:58:22,906 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2025-02-07 16:58:22,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 90 treesize of output 76 [2025-02-07 16:58:23,565 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-07 16:58:23,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 13 [2025-02-07 16:58:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 12 proven. 97 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 16:58:23,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:23,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-07 16:58:23,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-07 16:58:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 12 proven. 92 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 16:58:23,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020738020] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:23,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:23,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 14] total 44 [2025-02-07 16:58:23,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496733580] [2025-02-07 16:58:23,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:23,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-07 16:58:23,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:23,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-07 16:58:23,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1707, Unknown=0, NotChecked=0, Total=1892 [2025-02-07 16:58:23,969 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 44 states, 44 states have (on average 4.0) internal successors, (176), 44 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:26,045 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2025-02-07 16:58:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-02-07 16:58:26,046 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.0) internal successors, (176), 44 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-07 16:58:26,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:26,047 INFO L225 Difference]: With dead ends: 133 [2025-02-07 16:58:26,047 INFO L226 Difference]: Without dead ends: 124 [2025-02-07 16:58:26,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1765 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=784, Invalid=6022, Unknown=0, NotChecked=0, Total=6806 [2025-02-07 16:58:26,049 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 324 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:26,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 322 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2033 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 16:58:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-07 16:58:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2025-02-07 16:58:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.095890410958904) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-02-07 16:58:26,069 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 68 [2025-02-07 16:58:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:26,069 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-02-07 16:58:26,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.0) internal successors, (176), 44 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-02-07 16:58:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-07 16:58:26,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:26,071 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:26,084 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-07 16:58:26,271 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-07 16:58:26,272 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:26,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:26,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1419036992, now seen corresponding path program 7 times [2025-02-07 16:58:26,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:26,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032962766] [2025-02-07 16:58:26,272 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 16:58:26,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:26,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-07 16:58:26,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 16:58:26,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:26,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 16:58:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032962766] [2025-02-07 16:58:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032962766] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:26,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642797614] [2025-02-07 16:58:26,936 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 16:58:26,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:26,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:26,938 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-07 16:58:26,939 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-07 16:58:27,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-07 16:58:27,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 16:58:27,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:27,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:27,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-07 16:58:27,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:27,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 16:58:27,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:27,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 32 [2025-02-07 16:58:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-07 16:58:27,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:27,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 16:58:27,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 16:58:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 16:58:27,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642797614] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:27,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:27,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 30 [2025-02-07 16:58:27,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348194247] [2025-02-07 16:58:27,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:27,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-07 16:58:27,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:27,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-07 16:58:27,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2025-02-07 16:58:27,541 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 30 states, 30 states have (on average 4.8) internal successors, (144), 30 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:28,570 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2025-02-07 16:58:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-07 16:58:28,570 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.8) internal successors, (144), 30 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-02-07 16:58:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:28,571 INFO L225 Difference]: With dead ends: 131 [2025-02-07 16:58:28,571 INFO L226 Difference]: Without dead ends: 129 [2025-02-07 16:58:28,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=452, Invalid=3330, Unknown=0, NotChecked=0, Total=3782 [2025-02-07 16:58:28,572 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 78 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:28,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 251 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1541 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 16:58:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-07 16:58:28,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 79. [2025-02-07 16:58:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 78 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:28,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2025-02-07 16:58:28,584 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 73 [2025-02-07 16:58:28,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:28,584 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2025-02-07 16:58:28,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.8) internal successors, (144), 30 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2025-02-07 16:58:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-07 16:58:28,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:28,585 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:28,593 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-07 16:58:28,790 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-07 16:58:28,790 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:28,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:28,791 INFO L85 PathProgramCache]: Analyzing trace with hash 88355243, now seen corresponding path program 8 times [2025-02-07 16:58:28,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:28,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645484495] [2025-02-07 16:58:28,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:58:28,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:28,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-02-07 16:58:28,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-02-07 16:58:28,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:58:28,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 136 proven. 41 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 16:58:29,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:29,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645484495] [2025-02-07 16:58:29,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645484495] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:29,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699099369] [2025-02-07 16:58:29,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:58:29,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:29,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:29,159 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-07 16:58:29,160 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-07 16:58:29,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-02-07 16:58:29,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-02-07 16:58:29,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:58:29,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:29,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 16:58:29,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 172 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 16:58:29,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:30,133 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 172 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 16:58:30,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699099369] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:30,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:30,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 45 [2025-02-07 16:58:30,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300140358] [2025-02-07 16:58:30,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:30,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-07 16:58:30,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:30,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-07 16:58:30,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1485, Unknown=0, NotChecked=0, Total=1980 [2025-02-07 16:58:30,136 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 45 states, 45 states have (on average 4.355555555555555) internal successors, (196), 45 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:30,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:30,503 INFO L93 Difference]: Finished difference Result 224 states and 246 transitions. [2025-02-07 16:58:30,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 16:58:30,503 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.355555555555555) internal successors, (196), 45 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-07 16:58:30,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:30,504 INFO L225 Difference]: With dead ends: 224 [2025-02-07 16:58:30,504 INFO L226 Difference]: Without dead ends: 99 [2025-02-07 16:58:30,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=628, Invalid=1922, Unknown=0, NotChecked=0, Total=2550 [2025-02-07 16:58:30,505 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 345 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:30,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 231 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 16:58:30,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-07 16:58:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2025-02-07 16:58:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 90 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2025-02-07 16:58:30,517 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 78 [2025-02-07 16:58:30,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:30,517 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2025-02-07 16:58:30,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.355555555555555) internal successors, (196), 45 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2025-02-07 16:58:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-07 16:58:30,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:30,518 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:30,524 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-07 16:58:30,721 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-07 16:58:30,722 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:30,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:30,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1402178572, now seen corresponding path program 9 times [2025-02-07 16:58:30,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:30,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101989819] [2025-02-07 16:58:30,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 16:58:30,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:30,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 9 equivalence classes. [2025-02-07 16:58:30,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 90 of 90 statements. [2025-02-07 16:58:30,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-07 16:58:30,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:34,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:34,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101989819] [2025-02-07 16:58:34,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101989819] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:34,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825312554] [2025-02-07 16:58:34,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 16:58:34,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:34,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:34,631 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 16:58:34,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-07 16:58:34,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 9 equivalence classes. [2025-02-07 16:58:36,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 90 of 90 statements. [2025-02-07 16:58:36,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-07 16:58:36,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:36,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-02-07 16:58:36,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:36,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:58:36,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:36,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2025-02-07 16:58:36,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:58:36,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:36,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 28 [2025-02-07 16:58:36,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:36,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 16:58:36,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:36,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 38 [2025-02-07 16:58:36,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:36,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 35 [2025-02-07 16:58:36,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:36,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 45 [2025-02-07 16:58:36,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:36,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 45 [2025-02-07 16:58:36,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:36,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 48 [2025-02-07 16:58:36,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:36,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 55 [2025-02-07 16:58:36,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:36,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 58 [2025-02-07 16:58:36,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:36,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 56 treesize of output 62 [2025-02-07 16:58:37,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:37,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 92 treesize of output 65 [2025-02-07 16:58:37,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:37,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 63 treesize of output 72 [2025-02-07 16:58:37,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:37,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 88 treesize of output 82 [2025-02-07 16:58:37,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:37,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 70 treesize of output 82 [2025-02-07 16:58:37,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:37,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 95 treesize of output 92 [2025-02-07 16:58:37,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:37,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 77 treesize of output 92 [2025-02-07 16:58:37,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:37,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 102 treesize of output 95 [2025-02-07 16:58:38,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:38,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 80 treesize of output 28 [2025-02-07 16:58:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:38,912 INFO L312 TraceCheckSpWp]: Computing backward predicates...