./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/pnr3.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/pnr3.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 e32269e91be552d606173d0b8eafd4ffa81c0e735dd375e4417d1ccfc27eaf5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 16:58:44,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 16:58:44,122 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:44,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 16:58:44,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 16:58:44,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 16:58:44,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 16:58:44,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 16:58:44,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 16:58:44,150 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 16:58:44,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 16:58:44,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 16:58:44,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 16:58:44,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 16:58:44,152 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 16:58:44,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 16:58:44,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 16:58:44,152 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 16:58:44,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 16:58:44,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 16:58:44,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 16:58:44,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 16:58:44,153 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 16:58:44,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 16:58:44,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 16:58:44,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 16:58:44,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 16:58:44,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 16:58:44,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 16:58:44,154 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 -> e32269e91be552d606173d0b8eafd4ffa81c0e735dd375e4417d1ccfc27eaf5e [2025-02-07 16:58:44,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 16:58:44,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 16:58:44,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 16:58:44,496 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 16:58:44,497 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 16:58:44,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pnr3.c [2025-02-07 16:58:45,808 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec76d2c16/5ec32fb5cf2f43f6832a045f7f173ec9/FLAG79fa6b48d [2025-02-07 16:58:46,104 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 16:58:46,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr3.c [2025-02-07 16:58:46,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec76d2c16/5ec32fb5cf2f43f6832a045f7f173ec9/FLAG79fa6b48d [2025-02-07 16:58:46,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec76d2c16/5ec32fb5cf2f43f6832a045f7f173ec9 [2025-02-07 16:58:46,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 16:58:46,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 16:58:46,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 16:58:46,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 16:58:46,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 16:58:46,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 04:58:46" (1/1) ... [2025-02-07 16:58:46,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47332150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:46, skipping insertion in model container [2025-02-07 16:58:46,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 04:58:46" (1/1) ... [2025-02-07 16:58:46,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 16:58:46,301 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/pnr3.c[395,408] [2025-02-07 16:58:46,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 16:58:46,348 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 16:58:46,359 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/pnr3.c[395,408] [2025-02-07 16:58:46,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 16:58:46,384 INFO L204 MainTranslator]: Completed translation [2025-02-07 16:58:46,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:46 WrapperNode [2025-02-07 16:58:46,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 16:58:46,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 16:58:46,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 16:58:46,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 16:58:46,392 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:46" (1/1) ... [2025-02-07 16:58:46,397 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:46" (1/1) ... [2025-02-07 16:58:46,412 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2025-02-07 16:58:46,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 16:58:46,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 16:58:46,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 16:58:46,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 16:58:46,419 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:46" (1/1) ... [2025-02-07 16:58:46,419 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:46" (1/1) ... [2025-02-07 16:58:46,420 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:46" (1/1) ... [2025-02-07 16:58:46,430 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 7, 7]. 44 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-02-07 16:58:46,431 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:46" (1/1) ... [2025-02-07 16:58:46,431 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:46" (1/1) ... [2025-02-07 16:58:46,435 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:46" (1/1) ... [2025-02-07 16:58:46,436 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:46" (1/1) ... [2025-02-07 16:58:46,437 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:46" (1/1) ... [2025-02-07 16:58:46,437 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:46" (1/1) ... [2025-02-07 16:58:46,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 16:58:46,440 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 16:58:46,440 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 16:58:46,440 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 16:58:46,441 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:46" (1/1) ... [2025-02-07 16:58:46,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 16:58:46,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:46,470 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:46,476 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:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 16:58:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 16:58:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 16:58:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 16:58:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 16:58:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 16:58:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 16:58:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 16:58:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2025-02-07 16:58:46,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2025-02-07 16:58:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 16:58:46,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 16:58:46,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 16:58:46,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 16:58:46,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 16:58:46,560 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 16:58:46,561 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 16:58:46,737 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-07 16:58:46,737 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 16:58:46,744 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 16:58:46,745 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 16:58:46,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 04:58:46 BoogieIcfgContainer [2025-02-07 16:58:46,745 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 16:58:46,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 16:58:46,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 16:58:46,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 16:58:46,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 04:58:46" (1/3) ... [2025-02-07 16:58:46,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11480746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 04:58:46, skipping insertion in model container [2025-02-07 16:58:46,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:46" (2/3) ... [2025-02-07 16:58:46,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11480746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 04:58:46, skipping insertion in model container [2025-02-07 16:58:46,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 04:58:46" (3/3) ... [2025-02-07 16:58:46,754 INFO L128 eAbstractionObserver]: Analyzing ICFG pnr3.c [2025-02-07 16:58:46,768 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 16:58:46,769 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pnr3.c that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 16:58:46,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 16:58:46,835 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;@fb9466d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 16:58:46,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 16:58:46,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 16:58:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 16:58:46,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:46,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:46,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:46,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1748355390, now seen corresponding path program 1 times [2025-02-07 16:58:46,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:46,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873286804] [2025-02-07 16:58:46,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:46,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:46,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 16:58:46,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 16:58:46,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:46,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:47,031 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:47,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:47,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873286804] [2025-02-07 16:58:47,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873286804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:58:47,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:58:47,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 16:58:47,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616179219] [2025-02-07 16:58:47,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:58:47,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 16:58:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:47,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 16:58:47,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 16:58:47,058 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:47,076 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2025-02-07 16:58:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 16:58:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2025-02-07 16:58:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:47,084 INFO L225 Difference]: With dead ends: 51 [2025-02-07 16:58:47,084 INFO L226 Difference]: Without dead ends: 24 [2025-02-07 16:58:47,088 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:47,093 INFO L435 NwaCegarLoop]: 35 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, 35 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:47,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 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:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-07 16:58:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-07 16:58:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 16:58:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-02-07 16:58:47,129 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 9 [2025-02-07 16:58:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:47,130 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-02-07 16:58:47,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-02-07 16:58:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 16:58:47,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:47,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:47,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 16:58:47,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:47,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:47,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1776984541, now seen corresponding path program 1 times [2025-02-07 16:58:47,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:47,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534585117] [2025-02-07 16:58:47,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:47,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:47,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 16:58:47,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 16:58:47,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:47,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:47,501 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:47,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:47,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534585117] [2025-02-07 16:58:47,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534585117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:58:47,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:58:47,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 16:58:47,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528981765] [2025-02-07 16:58:47,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:58:47,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 16:58:47,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:47,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 16:58:47,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 16:58:47,505 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:47,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:47,613 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2025-02-07 16:58:47,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 16:58:47,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2025-02-07 16:58:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:47,614 INFO L225 Difference]: With dead ends: 40 [2025-02-07 16:58:47,614 INFO L226 Difference]: Without dead ends: 35 [2025-02-07 16:58:47,615 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:47,615 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:47,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 25 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 16:58:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-07 16:58:47,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2025-02-07 16:58:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 16:58:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2025-02-07 16:58:47,624 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 9 [2025-02-07 16:58:47,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:47,624 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2025-02-07 16:58:47,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:47,625 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2025-02-07 16:58:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 16:58:47,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:47,625 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:47,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 16:58:47,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:47,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash 985394326, now seen corresponding path program 1 times [2025-02-07 16:58:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:47,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407590967] [2025-02-07 16:58:47,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:47,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 16:58:47,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 16:58:47,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:47,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:58:48,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:48,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407590967] [2025-02-07 16:58:48,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407590967] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:48,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265742487] [2025-02-07 16:58:48,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:48,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:48,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:48,467 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:48,469 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:48,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 16:58:48,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 16:58:48,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:48,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:48,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-07 16:58:48,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:48,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:48,717 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 24 treesize of output 12 [2025-02-07 16:58:48,755 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 24 treesize of output 12 [2025-02-07 16:58:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:58:48,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:48,899 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 15 treesize of output 13 [2025-02-07 16:58:48,905 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 14 treesize of output 12 [2025-02-07 16:58:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:58:48,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265742487] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:48,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:48,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 14 [2025-02-07 16:58:48,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4652210] [2025-02-07 16:58:48,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:48,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 16:58:48,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:48,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 16:58:48,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-07 16:58:48,941 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-07 16:58:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:49,290 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2025-02-07 16:58:49,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 16:58:49,290 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 29 [2025-02-07 16:58:49,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:49,291 INFO L225 Difference]: With dead ends: 76 [2025-02-07 16:58:49,292 INFO L226 Difference]: Without dead ends: 74 [2025-02-07 16:58:49,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-02-07 16:58:49,293 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 112 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:49,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 176 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 16:58:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-07 16:58:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 38. [2025-02-07 16:58:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 16:58:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2025-02-07 16:58:49,303 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 29 [2025-02-07 16:58:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:49,303 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2025-02-07 16:58:49,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-07 16:58:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2025-02-07 16:58:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 16:58:49,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:49,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:49,315 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:49,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:49,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:49,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:49,512 INFO L85 PathProgramCache]: Analyzing trace with hash -11678027, now seen corresponding path program 1 times [2025-02-07 16:58:49,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:49,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587452796] [2025-02-07 16:58:49,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:49,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:49,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 16:58:49,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 16:58:49,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:49,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:58:49,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:49,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587452796] [2025-02-07 16:58:49,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587452796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:49,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129642709] [2025-02-07 16:58:49,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:49,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:49,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:50,000 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:50,002 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:50,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 16:58:50,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 16:58:50,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:50,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:50,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-07 16:58:50,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:50,252 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:50,369 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:58:50,457 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:58:50,536 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 15 treesize of output 7 [2025-02-07 16:58:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 16:58:50,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:50,654 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 15 treesize of output 13 [2025-02-07 16:58:50,658 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 18 treesize of output 16 [2025-02-07 16:58:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:58:50,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129642709] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:50,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:50,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 9] total 23 [2025-02-07 16:58:50,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801543838] [2025-02-07 16:58:50,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:50,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 16:58:50,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:50,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 16:58:50,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2025-02-07 16:58:50,794 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-07 16:58:55,220 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] [2025-02-07 16:58:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:55,457 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2025-02-07 16:58:55,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 16:58:55,458 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 29 [2025-02-07 16:58:55,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:55,463 INFO L225 Difference]: With dead ends: 100 [2025-02-07 16:58:55,464 INFO L226 Difference]: Without dead ends: 98 [2025-02-07 16:58:55,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2025-02-07 16:58:55,465 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 331 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 94 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:55,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 211 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 344 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-07 16:58:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-07 16:58:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 27. [2025-02-07 16:58:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 16:58:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-02-07 16:58:55,478 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 29 [2025-02-07 16:58:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:55,479 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-02-07 16:58:55,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-07 16:58:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-02-07 16:58:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 16:58:55,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:55,482 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:55,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 16:58:55,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:55,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:55,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:55,686 INFO L85 PathProgramCache]: Analyzing trace with hash -218229483, now seen corresponding path program 1 times [2025-02-07 16:58:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:55,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481664542] [2025-02-07 16:58:55,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:55,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:55,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 16:58:55,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 16:58:55,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:55,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:58:55,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:55,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481664542] [2025-02-07 16:58:55,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481664542] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:55,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263253469] [2025-02-07 16:58:55,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:55,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:55,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:55,977 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:55,978 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:56,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 16:58:56,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 16:58:56,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:56,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:56,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-07 16:58:56,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:56,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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,097 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 24 treesize of output 12 [2025-02-07 16:58:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:58:56,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:56,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 16:58:56,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 16:58:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:58:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263253469] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:56,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:56,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2025-02-07 16:58:56,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502684939] [2025-02-07 16:58:56,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:56,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 16:58:56,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:56,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 16:58:56,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-07 16:58:56,235 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-07 16:58:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:56,567 INFO L93 Difference]: Finished difference Result 89 states and 124 transitions. [2025-02-07 16:58:56,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 16:58:56,568 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2025-02-07 16:58:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:56,568 INFO L225 Difference]: With dead ends: 89 [2025-02-07 16:58:56,569 INFO L226 Difference]: Without dead ends: 87 [2025-02-07 16:58:56,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-02-07 16:58:56,569 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 65 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:56,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 208 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 16:58:56,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-07 16:58:56,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 41. [2025-02-07 16:58:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 16:58:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2025-02-07 16:58:56,587 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 32 [2025-02-07 16:58:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:56,588 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2025-02-07 16:58:56,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-07 16:58:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2025-02-07 16:58:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 16:58:56,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:56,590 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:56,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 16:58:56,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:56,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:56,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:56,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1289322326, now seen corresponding path program 1 times [2025-02-07 16:58:56,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:56,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621903235] [2025-02-07 16:58:56,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:56,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:56,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 16:58:56,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 16:58:56,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:56,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:58:57,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:57,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621903235] [2025-02-07 16:58:57,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621903235] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:57,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595257044] [2025-02-07 16:58:57,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:57,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:57,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:57,112 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:57,114 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:57,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 16:58:57,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 16:58:57,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:57,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:57,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-07 16:58:57,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:57,297 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:57,377 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:58:57,477 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 15 treesize of output 7 [2025-02-07 16:58:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 16:58:57,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:57,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 16:58:57,597 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 20 treesize of output 16 [2025-02-07 16:58:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:58:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595257044] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:57,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:57,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2025-02-07 16:58:57,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451357813] [2025-02-07 16:58:57,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:57,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 16:58:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:57,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 16:58:57,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-02-07 16:58:57,671 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-07 16:59:02,121 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:59:06,202 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:59:06,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:06,255 INFO L93 Difference]: Finished difference Result 112 states and 154 transitions. [2025-02-07 16:59:06,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-07 16:59:06,256 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 32 [2025-02-07 16:59:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:06,256 INFO L225 Difference]: With dead ends: 112 [2025-02-07 16:59:06,257 INFO L226 Difference]: Without dead ends: 110 [2025-02-07 16:59:06,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2025-02-07 16:59:06,258 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 116 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 74 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:06,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 254 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 388 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-02-07 16:59:06,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-07 16:59:06,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 30. [2025-02-07 16:59:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 16:59:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-02-07 16:59:06,270 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 32 [2025-02-07 16:59:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:06,270 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-02-07 16:59:06,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-07 16:59:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-02-07 16:59:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 16:59:06,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:06,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:06,282 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:59:06,472 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,SelfDestructingSolverStorable5 [2025-02-07 16:59:06,472 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:06,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:06,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1306830902, now seen corresponding path program 2 times [2025-02-07 16:59:06,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:06,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558428580] [2025-02-07 16:59:06,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:59:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:06,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-07 16:59:06,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 16:59:06,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:59:06,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:59:06,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:06,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558428580] [2025-02-07 16:59:06,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558428580] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:59:06,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261383243] [2025-02-07 16:59:06,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:59:06,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:06,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:59:06,920 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:59:06,922 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:59:06,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-07 16:59:06,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 16:59:06,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:59:06,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:06,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-07 16:59:06,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:59:07,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:59:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:59:07,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:59:07,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 16:59:07,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 16:59:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:59:07,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261383243] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:59:07,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:59:07,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 23 [2025-02-07 16:59:07,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762806576] [2025-02-07 16:59:07,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:59:07,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 16:59:07,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:07,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 16:59:07,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-02-07 16:59:07,314 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-07 16:59:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:08,399 INFO L93 Difference]: Finished difference Result 145 states and 204 transitions. [2025-02-07 16:59:08,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-07 16:59:08,399 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 35 [2025-02-07 16:59:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:08,400 INFO L225 Difference]: With dead ends: 145 [2025-02-07 16:59:08,400 INFO L226 Difference]: Without dead ends: 131 [2025-02-07 16:59:08,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=503, Invalid=1849, Unknown=0, NotChecked=0, Total=2352 [2025-02-07 16:59:08,402 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 201 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:08,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 266 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 16:59:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-07 16:59:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 64. [2025-02-07 16:59:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-07 16:59:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2025-02-07 16:59:08,418 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 35 [2025-02-07 16:59:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:08,418 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2025-02-07 16:59:08,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-07 16:59:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2025-02-07 16:59:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 16:59:08,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:08,419 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:08,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 16:59:08,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:08,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:08,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:08,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1435913621, now seen corresponding path program 1 times [2025-02-07 16:59:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481207063] [2025-02-07 16:59:08,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:08,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:08,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 16:59:08,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 16:59:08,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:08,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:59:08,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:08,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481207063] [2025-02-07 16:59:08,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481207063] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:59:08,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967147870] [2025-02-07 16:59:08,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:08,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:08,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:59:08,893 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:08,895 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:08,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 16:59:08,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 16:59:08,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:08,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:08,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-07 16:59:08,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:59:09,086 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:59:09,231 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 15 treesize of output 7 [2025-02-07 16:59:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:59:09,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:59:09,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 16:59:09,357 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 20 treesize of output 16 [2025-02-07 16:59:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:59:09,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967147870] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:59:09,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:59:09,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2025-02-07 16:59:09,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803174178] [2025-02-07 16:59:09,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:59:09,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 16:59:09,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:09,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 16:59:09,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2025-02-07 16:59:09,450 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-07 16:59:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:10,663 INFO L93 Difference]: Finished difference Result 205 states and 298 transitions. [2025-02-07 16:59:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-07 16:59:10,663 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 35 [2025-02-07 16:59:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:10,664 INFO L225 Difference]: With dead ends: 205 [2025-02-07 16:59:10,664 INFO L226 Difference]: Without dead ends: 203 [2025-02-07 16:59:10,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=611, Invalid=2251, Unknown=0, NotChecked=0, Total=2862 [2025-02-07 16:59:10,667 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 234 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:10,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 439 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 16:59:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-07 16:59:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 44. [2025-02-07 16:59:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 16:59:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2025-02-07 16:59:10,688 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 35 [2025-02-07 16:59:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:10,689 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2025-02-07 16:59:10,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-07 16:59:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2025-02-07 16:59:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 16:59:10,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:10,690 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:10,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-07 16:59:10,890 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,SelfDestructingSolverStorable7 [2025-02-07 16:59:10,891 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:10,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:10,891 INFO L85 PathProgramCache]: Analyzing trace with hash -570712138, now seen corresponding path program 2 times [2025-02-07 16:59:10,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:10,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424311637] [2025-02-07 16:59:10,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:59:10,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:10,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-07 16:59:10,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 16:59:10,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:59:10,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:59:11,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424311637] [2025-02-07 16:59:11,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424311637] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:59:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768043594] [2025-02-07 16:59:11,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:59:11,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:11,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:59:11,126 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:11,128 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:11,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-07 16:59:11,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 16:59:11,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:59:11,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:11,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 16:59:11,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:59:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:59:11,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:59:11,774 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 16:59:11,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768043594] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:59:11,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:59:11,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 25 [2025-02-07 16:59:11,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236662434] [2025-02-07 16:59:11,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:59:11,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-07 16:59:11,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:11,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-07 16:59:11,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2025-02-07 16:59:11,776 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 25 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-07 16:59:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:12,063 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2025-02-07 16:59:12,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 16:59:12,063 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 38 [2025-02-07 16:59:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:12,064 INFO L225 Difference]: With dead ends: 71 [2025-02-07 16:59:12,064 INFO L226 Difference]: Without dead ends: 56 [2025-02-07 16:59:12,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2025-02-07 16:59:12,065 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 123 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:12,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 105 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 16:59:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-07 16:59:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2025-02-07 16:59:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 16:59:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2025-02-07 16:59:12,077 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 38 [2025-02-07 16:59:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:12,077 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2025-02-07 16:59:12,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-07 16:59:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2025-02-07 16:59:12,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-07 16:59:12,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:12,080 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:12,087 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:12,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:12,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:12,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:12,281 INFO L85 PathProgramCache]: Analyzing trace with hash 928199004, now seen corresponding path program 3 times [2025-02-07 16:59:12,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:12,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344876879] [2025-02-07 16:59:12,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 16:59:12,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:12,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 5 equivalence classes. [2025-02-07 16:59:12,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 52 of 58 statements. [2025-02-07 16:59:12,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 16:59:12,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-07 16:59:12,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344876879] [2025-02-07 16:59:12,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344876879] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:59:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009369937] [2025-02-07 16:59:12,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 16:59:12,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:12,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:59:12,725 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:12,726 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:12,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 5 equivalence classes. [2025-02-07 16:59:12,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 52 of 58 statements. [2025-02-07 16:59:12,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 16:59:12,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:12,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-07 16:59:12,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:59:12,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:59:13,044 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 24 treesize of output 12 [2025-02-07 16:59:13,111 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 24 treesize of output 12 [2025-02-07 16:59:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 24 proven. 28 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-07 16:59:13,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:59:13,481 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 18 treesize of output 16 [2025-02-07 16:59:13,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-07 16:59:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-07 16:59:13,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009369937] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:59:13,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:59:13,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2025-02-07 16:59:13,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385022927] [2025-02-07 16:59:13,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:59:13,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-07 16:59:13,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:13,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-07 16:59:13,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2025-02-07 16:59:13,598 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 32 states, 32 states have (on average 3.15625) internal successors, (101), 31 states have internal predecessors, (101), 9 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2025-02-07 16:59:17,642 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:59:21,651 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:59:25,670 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:59:29,692 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:59:33,724 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:59:37,752 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:59:41,761 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:59:45,782 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] [2025-02-07 16:59:49,831 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:59:53,856 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:59:57,947 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 17:00:01,964 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 17:00:05,971 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 17:00:09,992 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 17:00:14,289 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 17:00:18,313 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 17:00:22,320 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]