./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/nr4.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/nr4.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 3219130777e42bfc39497c312a66c6d1b1af231a6df358861eaa545434d20cb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 16:58:07,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 16:58:08,021 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:58:08,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 16:58:08,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 16:58:08,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 16:58:08,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 16:58:08,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 16:58:08,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 16:58:08,049 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 16:58:08,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 16:58:08,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 16:58:08,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 16:58:08,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 16:58:08,050 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 16:58:08,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 16:58:08,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 16:58:08,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 16:58:08,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 16:58:08,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 16:58:08,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 16:58:08,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 16:58:08,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 16:58:08,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 16:58:08,051 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 16:58:08,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 16:58:08,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 16:58:08,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 16:58:08,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 16:58:08,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 16:58:08,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 16:58:08,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 16:58:08,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 16:58:08,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 16:58:08,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 16:58:08,053 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 16:58:08,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 16:58:08,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 16:58:08,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 16:58:08,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 16:58:08,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 16:58:08,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 16:58:08,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 16:58:08,053 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 -> 3219130777e42bfc39497c312a66c6d1b1af231a6df358861eaa545434d20cb1 [2025-02-07 16:58:08,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 16:58:08,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 16:58:08,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 16:58:08,292 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 16:58:08,292 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 16:58:08,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr4.c [2025-02-07 16:58:09,455 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03d42c57a/099047422fae4d02b23e3ea7ee667724/FLAG312693c81 [2025-02-07 16:58:09,663 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 16:58:09,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/nr4.c [2025-02-07 16:58:09,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03d42c57a/099047422fae4d02b23e3ea7ee667724/FLAG312693c81 [2025-02-07 16:58:10,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03d42c57a/099047422fae4d02b23e3ea7ee667724 [2025-02-07 16:58:10,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 16:58:10,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 16:58:10,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 16:58:10,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 16:58:10,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 16:58:10,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 04:58:10" (1/1) ... [2025-02-07 16:58:10,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54316e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:10, skipping insertion in model container [2025-02-07 16:58:10,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 04:58:10" (1/1) ... [2025-02-07 16:58:10,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 16:58:10,127 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/nr4.c[394,407] [2025-02-07 16:58:10,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 16:58:10,143 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 16:58:10,149 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/nr4.c[394,407] [2025-02-07 16:58:10,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 16:58:10,161 INFO L204 MainTranslator]: Completed translation [2025-02-07 16:58:10,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:10 WrapperNode [2025-02-07 16:58:10,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 16:58:10,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 16:58:10,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 16:58:10,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 16:58:10,166 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:58:10" (1/1) ... [2025-02-07 16:58:10,169 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:58:10" (1/1) ... [2025-02-07 16:58:10,179 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-02-07 16:58:10,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 16:58:10,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 16:58:10,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 16:58:10,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 16:58:10,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:10" (1/1) ... [2025-02-07 16:58:10,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:10" (1/1) ... [2025-02-07 16:58:10,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:10" (1/1) ... [2025-02-07 16:58:10,192 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 6, 4]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 2 writes are split as follows [0, 0, 2]. [2025-02-07 16:58:10,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:10" (1/1) ... [2025-02-07 16:58:10,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:10" (1/1) ... [2025-02-07 16:58:10,195 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:10" (1/1) ... [2025-02-07 16:58:10,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:10" (1/1) ... [2025-02-07 16:58:10,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:10" (1/1) ... [2025-02-07 16:58:10,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:10" (1/1) ... [2025-02-07 16:58:10,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 16:58:10,198 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 16:58:10,198 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 16:58:10,198 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 16:58:10,199 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:10" (1/1) ... [2025-02-07 16:58:10,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 16:58:10,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:10,218 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:58:10,221 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:58:10,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 16:58:10,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 16:58:10,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 16:58:10,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 16:58:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 16:58:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 16:58:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 16:58:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 16:58:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 16:58:10,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 16:58:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 16:58:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 16:58:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 16:58:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 16:58:10,282 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 16:58:10,283 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 16:58:10,376 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-07 16:58:10,376 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 16:58:10,381 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 16:58:10,382 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 16:58:10,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 04:58:10 BoogieIcfgContainer [2025-02-07 16:58:10,382 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 16:58:10,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 16:58:10,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 16:58:10,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 16:58:10,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 04:58:10" (1/3) ... [2025-02-07 16:58:10,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d436692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 04:58:10, skipping insertion in model container [2025-02-07 16:58:10,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:10" (2/3) ... [2025-02-07 16:58:10,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d436692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 04:58:10, skipping insertion in model container [2025-02-07 16:58:10,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 04:58:10" (3/3) ... [2025-02-07 16:58:10,388 INFO L128 eAbstractionObserver]: Analyzing ICFG nr4.c [2025-02-07 16:58:10,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 16:58:10,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nr4.c that has 1 procedures, 20 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-07 16:58:10,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 16:58:10,451 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;@aeb955b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 16:58:10,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 16:58:10,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:10,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 16:58:10,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:10,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:10,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:10,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:10,463 INFO L85 PathProgramCache]: Analyzing trace with hash 471203222, now seen corresponding path program 1 times [2025-02-07 16:58:10,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:10,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121471594] [2025-02-07 16:58:10,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:10,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:10,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 16:58:10,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 16:58:10,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:10,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:10,621 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:58:10,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:10,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121471594] [2025-02-07 16:58:10,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121471594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:58:10,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:58:10,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 16:58:10,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249671542] [2025-02-07 16:58:10,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:58:10,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 16:58:10,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:10,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 16:58:10,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 16:58:10,641 INFO L87 Difference]: Start difference. First operand has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:10,651 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2025-02-07 16:58:10,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 16:58:10,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-02-07 16:58:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:10,655 INFO L225 Difference]: With dead ends: 35 [2025-02-07 16:58:10,655 INFO L226 Difference]: Without dead ends: 16 [2025-02-07 16:58:10,657 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:58:10,658 INFO L435 NwaCegarLoop]: 25 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, 25 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:58:10,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:58:10,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-07 16:58:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-07 16:58:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-02-07 16:58:10,675 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2025-02-07 16:58:10,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:10,676 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-02-07 16:58:10,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:10,676 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-02-07 16:58:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 16:58:10,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:10,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:10,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 16:58:10,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:10,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2080953739, now seen corresponding path program 1 times [2025-02-07 16:58:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:10,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628564699] [2025-02-07 16:58:10,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:10,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:10,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 16:58:10,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 16:58:10,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:10,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:10,891 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:58:10,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:10,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628564699] [2025-02-07 16:58:10,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628564699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:58:10,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:58:10,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 16:58:10,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874479484] [2025-02-07 16:58:10,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:58:10,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 16:58:10,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:10,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 16:58:10,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 16:58:10,893 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:10,923 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2025-02-07 16:58:10,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 16:58:10,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-02-07 16:58:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:10,924 INFO L225 Difference]: With dead ends: 27 [2025-02-07 16:58:10,924 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 16:58:10,924 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:58:10,924 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:10,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:58:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 16:58:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2025-02-07 16:58:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-02-07 16:58:10,928 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2025-02-07 16:58:10,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:10,928 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-02-07 16:58:10,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-02-07 16:58:10,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 16:58:10,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:10,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:10,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 16:58:10,929 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:10,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:10,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1093934672, now seen corresponding path program 1 times [2025-02-07 16:58:10,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:10,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472880270] [2025-02-07 16:58:10,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:10,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:10,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 16:58:10,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 16:58:10,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:10,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:11,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:11,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472880270] [2025-02-07 16:58:11,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472880270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:58:11,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:58:11,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 16:58:11,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341139657] [2025-02-07 16:58:11,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:58:11,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 16:58:11,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:11,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 16:58:11,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 16:58:11,012 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:11,028 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2025-02-07 16:58:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 16:58:11,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-07 16:58:11,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:11,029 INFO L225 Difference]: With dead ends: 31 [2025-02-07 16:58:11,029 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 16:58:11,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 16:58:11,030 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:11,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 28 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:58:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 16:58:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-02-07 16:58:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-02-07 16:58:11,034 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2025-02-07 16:58:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:11,034 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-02-07 16:58:11,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-02-07 16:58:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 16:58:11,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:11,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:11,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 16:58:11,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:11,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:11,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1885260083, now seen corresponding path program 1 times [2025-02-07 16:58:11,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:11,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292307908] [2025-02-07 16:58:11,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:11,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:11,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-07 16:58:11,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 16:58:11,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:11,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:11,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:11,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:11,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292307908] [2025-02-07 16:58:11,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292307908] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:11,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405088692] [2025-02-07 16:58:11,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:11,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:11,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:11,095 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:58:11,096 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:58:11,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-07 16:58:11,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 16:58:11,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:11,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:11,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 16:58:11,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:11,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:11,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405088692] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:11,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:11,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-07 16:58:11,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32890710] [2025-02-07 16:58:11,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:11,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 16:58:11,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:11,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 16:58:11,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-07 16:58:11,228 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:11,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:11,279 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2025-02-07 16:58:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 16:58:11,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-07 16:58:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:11,279 INFO L225 Difference]: With dead ends: 39 [2025-02-07 16:58:11,280 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 16:58:11,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-07 16:58:11,280 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:11,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:58:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 16:58:11,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-07 16:58:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-02-07 16:58:11,286 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 16 [2025-02-07 16:58:11,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:11,286 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-02-07 16:58:11,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-02-07 16:58:11,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 16:58:11,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:11,287 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:11,299 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:58:11,488 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:58:11,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:11,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:11,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1545644176, now seen corresponding path program 2 times [2025-02-07 16:58:11,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:11,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266188693] [2025-02-07 16:58:11,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:58:11,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:11,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-07 16:58:11,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 16:58:11,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:58:11,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:11,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266188693] [2025-02-07 16:58:11,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266188693] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357315724] [2025-02-07 16:58:11,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:58:11,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:11,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:11,634 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:58:11,636 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:58:11,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-07 16:58:11,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 16:58:11,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:58:11,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:11,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 16:58:11,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:11,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 16:58:11,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357315724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:58:11,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 16:58:11,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-02-07 16:58:11,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398218249] [2025-02-07 16:58:11,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:58:11,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 16:58:11,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:11,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 16:58:11,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-02-07 16:58:11,762 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:11,795 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2025-02-07 16:58:11,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 16:58:11,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-07 16:58:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:11,796 INFO L225 Difference]: With dead ends: 48 [2025-02-07 16:58:11,796 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 16:58:11,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-02-07 16:58:11,797 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:11,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 36 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:58:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 16:58:11,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-07 16:58:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 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:58:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-02-07 16:58:11,801 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 25 [2025-02-07 16:58:11,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:11,801 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-02-07 16:58:11,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-02-07 16:58:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 16:58:11,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:11,802 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:11,808 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:58:12,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:12,006 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:12,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:12,006 INFO L85 PathProgramCache]: Analyzing trace with hash -261810287, now seen corresponding path program 1 times [2025-02-07 16:58:12,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:12,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289283391] [2025-02-07 16:58:12,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:12,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:12,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 16:58:12,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 16:58:12,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:12,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:12,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:12,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289283391] [2025-02-07 16:58:12,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289283391] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:12,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562528314] [2025-02-07 16:58:12,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:12,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:12,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:12,751 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:58:12,752 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:58:12,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 16:58:12,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 16:58:12,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:12,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:12,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-07 16:58:12,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:12,970 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:13,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:13,037 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 31 treesize of output 11 [2025-02-07 16:58:13,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:13,090 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 31 treesize of output 11 [2025-02-07 16:58:13,147 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-07 16:58:13,147 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 1 case distinctions, treesize of input 23 treesize of output 26 [2025-02-07 16:58:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:13,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:17,637 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_58 Int) (|v_ULTIMATE.start_main_~j~0#1_23| Int) (v_ArrVal_60 Int)) (let ((.cse0 (select (let ((.cse1 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4))) v_ArrVal_58) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_23| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_60)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (< |c_ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_23| 1)) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ 1 .cse0)) (= 0 .cse0)))) is different from false [2025-02-07 16:58:29,850 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 77 treesize of output 73 [2025-02-07 16:58:29,862 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 2307 treesize of output 2275 [2025-02-07 16:58:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2025-02-07 16:58:33,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562528314] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:33,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2025-02-07 16:58:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136296196] [2025-02-07 16:58:33,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:33,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-07 16:58:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:33,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-07 16:58:33,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1294, Unknown=5, NotChecked=76, Total=1640 [2025-02-07 16:58:33,514 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 41 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:38,682 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 [0, 1] [2025-02-07 16:58:40,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 16:58:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:41,072 INFO L93 Difference]: Finished difference Result 171 states and 218 transitions. [2025-02-07 16:58:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-07 16:58:41,072 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-07 16:58:41,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:41,075 INFO L225 Difference]: With dead ends: 171 [2025-02-07 16:58:41,075 INFO L226 Difference]: Without dead ends: 150 [2025-02-07 16:58:41,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2130 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=1178, Invalid=6131, Unknown=5, NotChecked=168, Total=7482 [2025-02-07 16:58:41,080 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 217 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 45 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:41,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 101 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 617 Invalid, 3 Unknown, 126 Unchecked, 6.2s Time] [2025-02-07 16:58:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-07 16:58:41,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 33. [2025-02-07 16:58:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 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:58:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-02-07 16:58:41,093 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 25 [2025-02-07 16:58:41,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:41,093 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-02-07 16:58:41,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-02-07 16:58:41,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 16:58:41,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:41,094 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:41,100 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:58:41,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:41,295 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:41,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash -273863174, now seen corresponding path program 1 times [2025-02-07 16:58:41,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:41,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488127003] [2025-02-07 16:58:41,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:41,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 16:58:41,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 16:58:41,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:41,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:41,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:41,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488127003] [2025-02-07 16:58:41,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488127003] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:41,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070240588] [2025-02-07 16:58:41,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:41,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:41,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:41,910 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:58:41,911 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:58:41,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 16:58:41,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 16:58:41,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:41,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:41,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-07 16:58:41,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:42,125 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:42,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:42,205 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 31 treesize of output 11 [2025-02-07 16:58:42,250 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-07 16:58:42,251 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 1 case distinctions, treesize of input 23 treesize of output 26 [2025-02-07 16:58:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:42,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:42,885 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 61 treesize of output 57 [2025-02-07 16:58:42,889 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 331 treesize of output 315 [2025-02-07 16:58:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 16:58:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070240588] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:45,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:45,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 43 [2025-02-07 16:58:45,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133803328] [2025-02-07 16:58:45,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:45,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-07 16:58:45,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:45,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-07 16:58:45,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1529, Unknown=1, NotChecked=0, Total=1806 [2025-02-07 16:58:45,725 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 43 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51,026 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 [0] [2025-02-07 16:58:55,283 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 [0, 1] [2025-02-07 16:58:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:55,510 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions. [2025-02-07 16:58:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-07 16:58:55,510 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 43 states have internal predecessors, (83), 0 states have call successors, (0), 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 30 [2025-02-07 16:58:55,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:55,511 INFO L225 Difference]: With dead ends: 147 [2025-02-07 16:58:55,511 INFO L226 Difference]: Without dead ends: 122 [2025-02-07 16:58:55,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1774 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1014, Invalid=5147, Unknown=1, NotChecked=0, Total=6162 [2025-02-07 16:58:55,513 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 314 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 57 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:55,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 85 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 571 Invalid, 3 Unknown, 0 Unchecked, 8.8s Time] [2025-02-07 16:58:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-07 16:58:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 41. [2025-02-07 16:58:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-02-07 16:58:55,519 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 30 [2025-02-07 16:58:55,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:55,520 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-02-07 16:58:55,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 43 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2025-02-07 16:58:55,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 16:58:55,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:55,520 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:55,526 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:58:55,725 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,SelfDestructingSolverStorable6 [2025-02-07 16:58:55,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:55,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:55,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2066723121, now seen corresponding path program 2 times [2025-02-07 16:58:55,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:55,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603164664] [2025-02-07 16:58:55,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:58:55,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:55,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-07 16:58:55,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 16:58:55,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:58:55,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:56,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:56,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603164664] [2025-02-07 16:58:56,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603164664] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:56,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175519427] [2025-02-07 16:58:56,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:58:56,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:56,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:56,085 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:58:56,086 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:58:56,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-07 16:58:56,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 16:58:56,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:58:56,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:56,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-07 16:58:56,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:56,259 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:56,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:56,311 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 22 [2025-02-07 16:58:56,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:56,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:56,548 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 26 treesize of output 10 [2025-02-07 16:58:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:56,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:59:00,733 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 31 treesize of output 29 [2025-02-07 16:59:00,736 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 74 treesize of output 70 [2025-02-07 16:59:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:00,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175519427] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:59:00,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:59:00,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 37 [2025-02-07 16:59:00,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848379723] [2025-02-07 16:59:00,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:59:00,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-07 16:59:00,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:00,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-07 16:59:00,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1140, Unknown=1, NotChecked=0, Total=1332 [2025-02-07 16:59:00,861 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:59:03,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 16:59:07,893 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 [0, 1] [2025-02-07 16:59:16,748 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:59:20,761 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 [0, 1] [2025-02-07 16:59:24,777 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:59:30,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 16:59:34,913 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:59:38,920 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 [0, 1] [2025-02-07 16:59:42,930 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:59:47,030 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 [0, 1] [2025-02-07 16:59:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:47,573 INFO L93 Difference]: Finished difference Result 189 states and 232 transitions. [2025-02-07 16:59:47,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 16:59:47,573 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 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 35 [2025-02-07 16:59:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:47,576 INFO L225 Difference]: With dead ends: 189 [2025-02-07 16:59:47,576 INFO L226 Difference]: Without dead ends: 159 [2025-02-07 16:59:47,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=724, Invalid=4103, Unknown=3, NotChecked=0, Total=4830 [2025-02-07 16:59:47,579 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 372 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 72 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.8s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:47,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 181 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 573 Invalid, 10 Unknown, 0 Unchecked, 36.8s Time] [2025-02-07 16:59:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-07 16:59:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 76. [2025-02-07 16:59:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.24) internal successors, (93), 75 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:59:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2025-02-07 16:59:47,604 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 35 [2025-02-07 16:59:47,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:47,604 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2025-02-07 16:59:47,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:59:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2025-02-07 16:59:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 16:59:47,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:47,605 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:47,613 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:59:47,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:47,806 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:47,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:47,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1306920795, now seen corresponding path program 1 times [2025-02-07 16:59:47,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:47,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899063593] [2025-02-07 16:59:47,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:47,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:47,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 16:59:47,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 16:59:47,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:47,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 16:59:48,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:48,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899063593] [2025-02-07 16:59:48,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899063593] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:59:48,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193958897] [2025-02-07 16:59:48,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:48,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:48,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:59:48,234 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:59:48,236 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:59:48,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 16:59:48,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 16:59:48,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:48,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:48,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-07 16:59:48,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:59:48,382 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:59:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:48,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:59:48,674 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:59:48,677 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:59:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:48,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193958897] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:59:48,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:59:48,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 36 [2025-02-07 16:59:48,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39250170] [2025-02-07 16:59:48,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:59:48,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-07 16:59:48,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:48,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-07 16:59:48,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2025-02-07 16:59:48,879 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 36 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:59:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:50,120 INFO L93 Difference]: Finished difference Result 231 states and 276 transitions. [2025-02-07 16:59:50,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-07 16:59:50,121 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 36 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 40 [2025-02-07 16:59:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:50,121 INFO L225 Difference]: With dead ends: 231 [2025-02-07 16:59:50,122 INFO L226 Difference]: Without dead ends: 212 [2025-02-07 16:59:50,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1773 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=671, Invalid=5029, Unknown=0, NotChecked=0, Total=5700 [2025-02-07 16:59:50,123 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 136 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:50,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 280 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 16:59:50,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-07 16:59:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 130. [2025-02-07 16:59:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.255813953488372) internal successors, (162), 129 states have internal predecessors, (162), 0 states have call successors, (0), 0 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:59:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2025-02-07 16:59:50,143 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 40 [2025-02-07 16:59:50,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:50,143 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2025-02-07 16:59:50,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 36 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:59:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2025-02-07 16:59:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-07 16:59:50,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:50,144 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:50,151 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:59:50,348 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,SelfDestructingSolverStorable8 [2025-02-07 16:59:50,348 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:50,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash 756947791, now seen corresponding path program 2 times [2025-02-07 16:59:50,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:50,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852540151] [2025-02-07 16:59:50,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:59:50,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:50,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-07 16:59:50,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 16:59:50,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:59:50,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:50,538 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-07 16:59:50,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:50,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852540151] [2025-02-07 16:59:50,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852540151] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:59:50,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79575277] [2025-02-07 16:59:50,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:59:50,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:50,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:59:50,541 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:59:50,543 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:59:50,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-07 16:59:50,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 16:59:50,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:59:50,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:50,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 16:59:50,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:59:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-07 16:59:50,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:59:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-07 16:59:51,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79575277] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:59:51,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:59:51,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 27 [2025-02-07 16:59:51,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59147501] [2025-02-07 16:59:51,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:59:51,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 16:59:51,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:51,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 16:59:51,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2025-02-07 16:59:51,164 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 27 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:59:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:51,364 INFO L93 Difference]: Finished difference Result 166 states and 202 transitions. [2025-02-07 16:59:51,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 16:59:51,364 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 27 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 45 [2025-02-07 16:59:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:51,366 INFO L225 Difference]: With dead ends: 166 [2025-02-07 16:59:51,366 INFO L226 Difference]: Without dead ends: 136 [2025-02-07 16:59:51,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=725, Unknown=0, NotChecked=0, Total=992 [2025-02-07 16:59:51,367 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 126 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:51,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 116 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 16:59:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-07 16:59:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2025-02-07 16:59:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.2519685039370079) internal successors, (159), 127 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 159 transitions. [2025-02-07 16:59:51,399 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 159 transitions. Word has length 45 [2025-02-07 16:59:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:51,400 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 159 transitions. [2025-02-07 16:59:51,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 27 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:59:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2025-02-07 16:59:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-07 16:59:51,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:51,400 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:51,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-07 16:59:51,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:51,601 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:51,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:51,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1650327487, now seen corresponding path program 3 times [2025-02-07 16:59:51,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:51,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952407438] [2025-02-07 16:59:51,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 16:59:51,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:51,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 10 equivalence classes. [2025-02-07 16:59:51,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 54 of 54 statements. [2025-02-07 16:59:51,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-07 16:59:51,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 10 proven. 109 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 16:59:52,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:52,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952407438] [2025-02-07 16:59:52,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952407438] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:59:52,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518955468] [2025-02-07 16:59:52,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 16:59:52,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:52,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:59:52,282 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:59:52,288 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:59:52,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 10 equivalence classes. [2025-02-07 16:59:52,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 54 of 54 statements. [2025-02-07 16:59:52,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-07 16:59:52,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:52,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-07 16:59:52,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:59:52,461 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:59:52,521 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:59:52,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:59:52,570 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 31 treesize of output 11 [2025-02-07 16:59:52,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:59:52,614 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 22 [2025-02-07 16:59:52,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:59:52,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:59:52,762 INFO L349 Elim1Store]: treesize reduction 33, result has 38.9 percent of original size [2025-02-07 16:59:52,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 35 [2025-02-07 16:59:52,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:59:52,835 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 35 treesize of output 11 [2025-02-07 16:59:52,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:59:52,876 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 35 treesize of output 11 [2025-02-07 16:59:52,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:59:52,922 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 25 treesize of output 24