./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/pr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/pr3.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 73efddcda095c52d9900d13088d1ec70520de6007541f46343a568e878cf2ed4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:08:13,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:08:13,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:08:13,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:08:13,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:08:13,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:08:14,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:08:14,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:08:14,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:08:14,000 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:08:14,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:08:14,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:08:14,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:08:14,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:08:14,002 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:08:14,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:08:14,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:08:14,002 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:08:14,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:08:14,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:08:14,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:08:14,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:08:14,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:08:14,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:08:14,003 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:08:14,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:08:14,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:08:14,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:08:14,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:08:14,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:08:14,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:08:14,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:08:14,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:08:14,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:08:14,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:08:14,004 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:08:14,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:08:14,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:08:14,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:08:14,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:08:14,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:08:14,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:08:14,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:08:14,005 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 -> 73efddcda095c52d9900d13088d1ec70520de6007541f46343a568e878cf2ed4 [2025-02-05 10:08:14,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:08:14,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:08:14,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:08:14,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:08:14,246 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:08:14,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pr3.c [2025-02-05 10:08:15,384 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ea7b132a/f2dab1cf34c54247a4a1d7f6f3d883d7/FLAG4f7feb805 [2025-02-05 10:08:15,638 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:08:15,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/pr3.c [2025-02-05 10:08:15,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ea7b132a/f2dab1cf34c54247a4a1d7f6f3d883d7/FLAG4f7feb805 [2025-02-05 10:08:15,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ea7b132a/f2dab1cf34c54247a4a1d7f6f3d883d7 [2025-02-05 10:08:15,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:08:15,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:08:15,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:08:15,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:08:15,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:08:15,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:08:15" (1/1) ... [2025-02-05 10:08:15,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72bdd5a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15, skipping insertion in model container [2025-02-05 10:08:15,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:08:15" (1/1) ... [2025-02-05 10:08:15,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:08:15,794 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/pr3.c[394,407] [2025-02-05 10:08:15,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:08:15,815 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:08:15,823 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/pr3.c[394,407] [2025-02-05 10:08:15,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:08:15,842 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:08:15,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15 WrapperNode [2025-02-05 10:08:15,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:08:15,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:08:15,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:08:15,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:08:15,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15" (1/1) ... [2025-02-05 10:08:15,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15" (1/1) ... [2025-02-05 10:08:15,866 INFO L138 Inliner]: procedures = 15, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-02-05 10:08:15,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:08:15,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:08:15,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:08:15,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:08:15,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15" (1/1) ... [2025-02-05 10:08:15,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15" (1/1) ... [2025-02-05 10:08:15,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15" (1/1) ... [2025-02-05 10:08:15,896 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 6, 8]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-02-05 10:08:15,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15" (1/1) ... [2025-02-05 10:08:15,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15" (1/1) ... [2025-02-05 10:08:15,902 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15" (1/1) ... [2025-02-05 10:08:15,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15" (1/1) ... [2025-02-05 10:08:15,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15" (1/1) ... [2025-02-05 10:08:15,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15" (1/1) ... [2025-02-05 10:08:15,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:08:15,909 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:08:15,909 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:08:15,909 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:08:15,910 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15" (1/1) ... [2025-02-05 10:08:15,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:08:15,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:15,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:08:15,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:08:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:08:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:08:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:08:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:08:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:08:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:08:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:08:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:08:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:08:15,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:08:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:08:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:08:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:08:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:08:16,021 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:08:16,023 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:08:16,149 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-05 10:08:16,149 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:08:16,155 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:08:16,155 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:08:16,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:08:16 BoogieIcfgContainer [2025-02-05 10:08:16,156 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:08:16,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:08:16,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:08:16,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:08:16,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:08:15" (1/3) ... [2025-02-05 10:08:16,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5885fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:08:16, skipping insertion in model container [2025-02-05 10:08:16,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:15" (2/3) ... [2025-02-05 10:08:16,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5885fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:08:16, skipping insertion in model container [2025-02-05 10:08:16,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:08:16" (3/3) ... [2025-02-05 10:08:16,167 INFO L128 eAbstractionObserver]: Analyzing ICFG pr3.c [2025-02-05 10:08:16,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:08:16,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pr3.c that has 1 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 10:08:16,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:08:16,230 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;@6c6167ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:08:16,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:08:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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-05 10:08:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 10:08:16,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:16,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:16,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:16,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:16,243 INFO L85 PathProgramCache]: Analyzing trace with hash -314807109, now seen corresponding path program 1 times [2025-02-05 10:08:16,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:16,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112946859] [2025-02-05 10:08:16,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:16,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:16,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 10:08:16,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 10:08:16,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:16,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:16,351 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-05 10:08:16,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:16,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112946859] [2025-02-05 10:08:16,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112946859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:08:16,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:08:16,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:08:16,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849329297] [2025-02-05 10:08:16,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:08:16,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 10:08:16,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:16,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 10:08:16,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:08:16,376 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-05 10:08:16,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:16,386 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2025-02-05 10:08:16,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 10:08:16,387 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2025-02-05 10:08:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:16,391 INFO L225 Difference]: With dead ends: 39 [2025-02-05 10:08:16,391 INFO L226 Difference]: Without dead ends: 18 [2025-02-05 10:08:16,395 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-05 10:08:16,397 INFO L435 NwaCegarLoop]: 29 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, 29 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-05 10:08:16,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:08:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-05 10:08:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-05 10:08:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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-05 10:08:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2025-02-05 10:08:16,421 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 12 [2025-02-05 10:08:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:16,421 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-02-05 10:08:16,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-05 10:08:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2025-02-05 10:08:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 10:08:16,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:16,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:16,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:08:16,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:16,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:16,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1428003226, now seen corresponding path program 1 times [2025-02-05 10:08:16,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:16,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71573074] [2025-02-05 10:08:16,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:16,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 10:08:16,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 10:08:16,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:16,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:16,673 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-05 10:08:16,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:16,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71573074] [2025-02-05 10:08:16,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71573074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:08:16,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:08:16,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:08:16,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982643106] [2025-02-05 10:08:16,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:08:16,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:08:16,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:16,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:08:16,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:08:16,676 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-05 10:08:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:16,717 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2025-02-05 10:08:16,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:08:16,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2025-02-05 10:08:16,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:16,717 INFO L225 Difference]: With dead ends: 30 [2025-02-05 10:08:16,717 INFO L226 Difference]: Without dead ends: 23 [2025-02-05 10:08:16,718 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-05 10:08:16,718 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:16,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 18 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:08:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-05 10:08:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2025-02-05 10:08:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-05 10:08:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-02-05 10:08:16,722 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2025-02-05 10:08:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:16,722 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-02-05 10:08:16,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-05 10:08:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2025-02-05 10:08:16,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:08:16,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:16,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:16,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:08:16,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:16,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:16,723 INFO L85 PathProgramCache]: Analyzing trace with hash 710843185, now seen corresponding path program 1 times [2025-02-05 10:08:16,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:16,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487588158] [2025-02-05 10:08:16,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:16,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:16,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:08:16,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:08:16,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:16,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:17,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:17,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487588158] [2025-02-05 10:08:17,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487588158] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:17,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399854230] [2025-02-05 10:08:17,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:17,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:17,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:17,165 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:17,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:08:17,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:08:17,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:08:17,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:17,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:17,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 10:08:17,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:17,279 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-05 10:08:17,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:08:17,320 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-05 10:08:17,406 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-05 10:08:17,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:17,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:17,483 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-05 10:08:17,487 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 14 [2025-02-05 10:08:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:17,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399854230] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:17,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:17,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 18 [2025-02-05 10:08:17,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289083776] [2025-02-05 10:08:17,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:17,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 10:08:17,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:17,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 10:08:17,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-02-05 10:08:17,502 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:17,908 INFO L93 Difference]: Finished difference Result 91 states and 116 transitions. [2025-02-05 10:08:17,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 10:08:17,908 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 10:08:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:17,910 INFO L225 Difference]: With dead ends: 91 [2025-02-05 10:08:17,910 INFO L226 Difference]: Without dead ends: 84 [2025-02-05 10:08:17,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=851, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 10:08:17,911 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 251 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:17,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 85 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:08:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-05 10:08:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 26. [2025-02-05 10:08:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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-05 10:08:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-02-05 10:08:17,916 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 17 [2025-02-05 10:08:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:17,916 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-02-05 10:08:17,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-02-05 10:08:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:08:17,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:17,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:17,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:08:18,121 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-05 10:08:18,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:18,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:18,122 INFO L85 PathProgramCache]: Analyzing trace with hash 710872976, now seen corresponding path program 1 times [2025-02-05 10:08:18,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:18,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544382148] [2025-02-05 10:08:18,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:18,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:18,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:08:18,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:08:18,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:18,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:08:18,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:18,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544382148] [2025-02-05 10:08:18,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544382148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:08:18,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:08:18,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:08:18,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842046530] [2025-02-05 10:08:18,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:08:18,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:08:18,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:18,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:08:18,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:08:18,169 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-05 10:08:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:18,179 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2025-02-05 10:08:18,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:08:18,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2025-02-05 10:08:18,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:18,180 INFO L225 Difference]: With dead ends: 30 [2025-02-05 10:08:18,180 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 10:08:18,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:08:18,181 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:18,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:08:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 10:08:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-05 10:08:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-02-05 10:08:18,184 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 17 [2025-02-05 10:08:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:18,185 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-02-05 10:08:18,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-05 10:08:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-02-05 10:08:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:08:18,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:18,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:18,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:08:18,185 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:18,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash 514329680, now seen corresponding path program 1 times [2025-02-05 10:08:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142976255] [2025-02-05 10:08:18,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:18,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:18,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:08:18,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:08:18,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:18,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:18,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:18,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142976255] [2025-02-05 10:08:18,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142976255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:08:18,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:08:18,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:08:18,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828037308] [2025-02-05 10:08:18,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:08:18,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:08:18,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:18,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:08:18,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:08:18,229 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-05 10:08:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:18,254 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2025-02-05 10:08:18,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:08:18,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2025-02-05 10:08:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:18,255 INFO L225 Difference]: With dead ends: 51 [2025-02-05 10:08:18,255 INFO L226 Difference]: Without dead ends: 37 [2025-02-05 10:08:18,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:08:18,255 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 34 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:18,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 41 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:08:18,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-05 10:08:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2025-02-05 10:08:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-02-05 10:08:18,259 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2025-02-05 10:08:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:18,259 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-02-05 10:08:18,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-05 10:08:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-02-05 10:08:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:08:18,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:18,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:18,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:08:18,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:18,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:18,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1293124783, now seen corresponding path program 1 times [2025-02-05 10:08:18,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:18,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866162324] [2025-02-05 10:08:18,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:18,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:18,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:08:18,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:08:18,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:18,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:18,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:18,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866162324] [2025-02-05 10:08:18,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866162324] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:18,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003753598] [2025-02-05 10:08:18,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:18,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:18,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:18,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:18,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:08:18,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:08:18,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:08:18,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:18,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:18,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 10:08:18,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:18,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:08:18,625 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-05 10:08:18,634 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-05 10:08:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:18,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:18,704 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-05 10:08:18,705 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-05 10:08:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:18,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003753598] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:18,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:18,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 13 [2025-02-05 10:08:18,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214355421] [2025-02-05 10:08:18,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:18,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 10:08:18,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:18,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 10:08:18,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:08:18,716 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:19,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:19,068 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2025-02-05 10:08:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 10:08:19,069 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 10:08:19,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:19,069 INFO L225 Difference]: With dead ends: 69 [2025-02-05 10:08:19,069 INFO L226 Difference]: Without dead ends: 67 [2025-02-05 10:08:19,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2025-02-05 10:08:19,070 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 69 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:19,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 108 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:08:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-05 10:08:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 36. [2025-02-05 10:08:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-02-05 10:08:19,079 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 17 [2025-02-05 10:08:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:19,079 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-02-05 10:08:19,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-02-05 10:08:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:08:19,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:19,081 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:19,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:08:19,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:19,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:19,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:19,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1261445094, now seen corresponding path program 1 times [2025-02-05 10:08:19,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:19,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47400625] [2025-02-05 10:08:19,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:19,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:19,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:08:19,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:08:19,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:19,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:19,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:19,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47400625] [2025-02-05 10:08:19,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47400625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:08:19,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:08:19,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:08:19,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620493218] [2025-02-05 10:08:19,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:08:19,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:08:19,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:19,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:08:19,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:08:19,314 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:19,332 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2025-02-05 10:08:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:08:19,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 10:08:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:19,333 INFO L225 Difference]: With dead ends: 59 [2025-02-05 10:08:19,333 INFO L226 Difference]: Without dead ends: 45 [2025-02-05 10:08:19,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:08:19,334 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:19,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:08:19,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-05 10:08:19,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2025-02-05 10:08:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2025-02-05 10:08:19,341 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 22 [2025-02-05 10:08:19,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:19,341 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2025-02-05 10:08:19,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2025-02-05 10:08:19,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:08:19,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:19,343 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:19,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:08:19,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:19,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:19,346 INFO L85 PathProgramCache]: Analyzing trace with hash 966163677, now seen corresponding path program 1 times [2025-02-05 10:08:19,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:19,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222428742] [2025-02-05 10:08:19,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:19,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:08:19,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:08:19,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:19,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:19,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:19,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222428742] [2025-02-05 10:08:19,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222428742] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:19,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169363648] [2025-02-05 10:08:19,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:19,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:19,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:19,606 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:19,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 10:08:19,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:08:19,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:08:19,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:19,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:19,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 10:08:19,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:19,688 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-05 10:08:19,710 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-05 10:08:19,780 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-05 10:08:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:19,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:19,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:08:19,847 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 14 [2025-02-05 10:08:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:19,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169363648] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:19,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:19,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 19 [2025-02-05 10:08:19,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337947931] [2025-02-05 10:08:19,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:19,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 10:08:19,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:19,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 10:08:19,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:08:19,862 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 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-05 10:08:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:20,184 INFO L93 Difference]: Finished difference Result 102 states and 134 transitions. [2025-02-05 10:08:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 10:08:20,184 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 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 22 [2025-02-05 10:08:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:20,185 INFO L225 Difference]: With dead ends: 102 [2025-02-05 10:08:20,185 INFO L226 Difference]: Without dead ends: 86 [2025-02-05 10:08:20,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2025-02-05 10:08:20,186 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 81 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:20,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 106 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:08:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-05 10:08:20,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 47. [2025-02-05 10:08:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 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-05 10:08:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2025-02-05 10:08:20,192 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 22 [2025-02-05 10:08:20,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:20,192 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2025-02-05 10:08:20,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 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-05 10:08:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2025-02-05 10:08:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:08:20,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:20,193 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:20,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 10:08:20,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:20,397 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:20,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:20,397 INFO L85 PathProgramCache]: Analyzing trace with hash 460605052, now seen corresponding path program 1 times [2025-02-05 10:08:20,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:20,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621295371] [2025-02-05 10:08:20,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:20,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:20,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:08:20,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:08:20,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:20,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:20,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:20,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621295371] [2025-02-05 10:08:20,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621295371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:20,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442065585] [2025-02-05 10:08:20,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:20,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:20,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:20,655 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:20,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:08:20,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:08:20,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:08:20,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:20,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:20,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 10:08:20,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:20,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:08:20,732 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-05 10:08:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:20,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:20,876 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-05 10:08:20,878 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-05 10:08:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:20,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442065585] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:20,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:20,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 19 [2025-02-05 10:08:20,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372970305] [2025-02-05 10:08:20,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:20,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 10:08:20,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:20,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 10:08:20,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:08:20,891 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:21,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:21,156 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2025-02-05 10:08:21,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 10:08:21,156 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 10:08:21,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:21,157 INFO L225 Difference]: With dead ends: 109 [2025-02-05 10:08:21,157 INFO L226 Difference]: Without dead ends: 107 [2025-02-05 10:08:21,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2025-02-05 10:08:21,158 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 95 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:21,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 88 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:08:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-05 10:08:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 63. [2025-02-05 10:08:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2025-02-05 10:08:21,163 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 22 [2025-02-05 10:08:21,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:21,163 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2025-02-05 10:08:21,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2025-02-05 10:08:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:08:21,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:21,164 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:21,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 10:08:21,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-05 10:08:21,365 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:21,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:21,365 INFO L85 PathProgramCache]: Analyzing trace with hash -62938405, now seen corresponding path program 1 times [2025-02-05 10:08:21,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:21,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308327003] [2025-02-05 10:08:21,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:21,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:21,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:08:21,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:08:21,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:21,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:21,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:21,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308327003] [2025-02-05 10:08:21,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308327003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:08:21,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:08:21,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:08:21,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539457054] [2025-02-05 10:08:21,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:08:21,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:08:21,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:21,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:08:21,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:08:21,387 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:21,403 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2025-02-05 10:08:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:08:21,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 10:08:21,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:21,403 INFO L225 Difference]: With dead ends: 91 [2025-02-05 10:08:21,403 INFO L226 Difference]: Without dead ends: 68 [2025-02-05 10:08:21,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:08:21,404 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:21,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 46 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:08:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-05 10:08:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2025-02-05 10:08:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2025-02-05 10:08:21,410 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 22 [2025-02-05 10:08:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:21,410 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-02-05 10:08:21,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2025-02-05 10:08:21,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 10:08:21,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:21,411 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:21,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:08:21,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:21,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:21,412 INFO L85 PathProgramCache]: Analyzing trace with hash 748996273, now seen corresponding path program 2 times [2025-02-05 10:08:21,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:21,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733745136] [2025-02-05 10:08:21,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:08:21,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:21,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-05 10:08:21,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:08:21,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:08:21,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:21,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:21,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733745136] [2025-02-05 10:08:21,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733745136] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:21,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892481852] [2025-02-05 10:08:21,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:08:21,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:21,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:21,727 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:21,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:08:21,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-05 10:08:21,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:08:21,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:08:21,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:21,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 10:08:21,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:21,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:08:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:22,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:22,098 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-05 10:08:22,100 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-05 10:08:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:22,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892481852] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:22,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:22,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 28 [2025-02-05 10:08:22,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157694172] [2025-02-05 10:08:22,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:22,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 10:08:22,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:22,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 10:08:22,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2025-02-05 10:08:22,119 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 28 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 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-05 10:08:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:23,388 INFO L93 Difference]: Finished difference Result 212 states and 264 transitions. [2025-02-05 10:08:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-05 10:08:23,388 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 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 27 [2025-02-05 10:08:23,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:23,389 INFO L225 Difference]: With dead ends: 212 [2025-02-05 10:08:23,389 INFO L226 Difference]: Without dead ends: 173 [2025-02-05 10:08:23,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=860, Invalid=3970, Unknown=0, NotChecked=0, Total=4830 [2025-02-05 10:08:23,392 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 244 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:23,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 136 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:08:23,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-05 10:08:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 115. [2025-02-05 10:08:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 114 states have internal predecessors, (151), 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-05 10:08:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 151 transitions. [2025-02-05 10:08:23,408 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 151 transitions. Word has length 27 [2025-02-05 10:08:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:23,408 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 151 transitions. [2025-02-05 10:08:23,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 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-05 10:08:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 151 transitions. [2025-02-05 10:08:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 10:08:23,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:23,409 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:23,414 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-05 10:08:23,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 10:08:23,619 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:23,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1746068626, now seen corresponding path program 1 times [2025-02-05 10:08:23,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:23,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050903540] [2025-02-05 10:08:23,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:23,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:23,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:08:23,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:08:23,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:23,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:23,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:23,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050903540] [2025-02-05 10:08:23,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050903540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:23,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599726052] [2025-02-05 10:08:23,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:23,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:23,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:23,795 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:23,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:08:23,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:08:23,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:08:23,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:23,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:23,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 10:08:23,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:23,871 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-05 10:08:23,967 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-05 10:08:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:23,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:24,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:08:24,044 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 14 [2025-02-05 10:08:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:24,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599726052] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:24,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:24,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 21 [2025-02-05 10:08:24,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252927087] [2025-02-05 10:08:24,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:24,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 10:08:24,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:24,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 10:08:24,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-02-05 10:08:24,059 INFO L87 Difference]: Start difference. First operand 115 states and 151 transitions. Second operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:24,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:24,515 INFO L93 Difference]: Finished difference Result 274 states and 359 transitions. [2025-02-05 10:08:24,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 10:08:24,516 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-05 10:08:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:24,516 INFO L225 Difference]: With dead ends: 274 [2025-02-05 10:08:24,516 INFO L226 Difference]: Without dead ends: 229 [2025-02-05 10:08:24,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=1175, Unknown=0, NotChecked=0, Total=1482 [2025-02-05 10:08:24,518 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 150 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:24,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 163 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:08:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-05 10:08:24,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 158. [2025-02-05 10:08:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.2993630573248407) internal successors, (204), 157 states have internal predecessors, (204), 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-05 10:08:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 204 transitions. [2025-02-05 10:08:24,529 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 204 transitions. Word has length 27 [2025-02-05 10:08:24,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:24,529 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 204 transitions. [2025-02-05 10:08:24,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 204 transitions. [2025-02-05 10:08:24,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 10:08:24,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:24,530 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:24,537 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-05 10:08:24,730 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,SelfDestructingSolverStorable11 [2025-02-05 10:08:24,731 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:24,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:24,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1227223179, now seen corresponding path program 1 times [2025-02-05 10:08:24,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:24,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795781987] [2025-02-05 10:08:24,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:24,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:24,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:08:24,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:08:24,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:24,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:08:24,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:24,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795781987] [2025-02-05 10:08:24,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795781987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:08:24,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:08:24,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:08:24,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408555135] [2025-02-05 10:08:24,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:08:24,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:08:24,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:24,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:08:24,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:08:24,750 INFO L87 Difference]: Start difference. First operand 158 states and 204 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:24,769 INFO L93 Difference]: Finished difference Result 198 states and 248 transitions. [2025-02-05 10:08:24,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:08:24,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-05 10:08:24,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:24,769 INFO L225 Difference]: With dead ends: 198 [2025-02-05 10:08:24,769 INFO L226 Difference]: Without dead ends: 145 [2025-02-05 10:08:24,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:08:24,770 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:24,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 46 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:08:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-05 10:08:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 124. [2025-02-05 10:08:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.2439024390243902) internal successors, (153), 123 states have internal predecessors, (153), 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-05 10:08:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2025-02-05 10:08:24,781 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 153 transitions. Word has length 27 [2025-02-05 10:08:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:24,782 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 153 transitions. [2025-02-05 10:08:24,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 153 transitions. [2025-02-05 10:08:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 10:08:24,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:24,782 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:24,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 10:08:24,782 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:24,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:24,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1548883940, now seen corresponding path program 2 times [2025-02-05 10:08:24,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:24,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647942121] [2025-02-05 10:08:24,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:08:24,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:24,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-05 10:08:24,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 10:08:24,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:08:24,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:24,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:24,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647942121] [2025-02-05 10:08:24,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647942121] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:24,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767680221] [2025-02-05 10:08:24,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:08:24,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:24,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:24,922 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:24,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:08:24,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-05 10:08:24,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 10:08:24,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:08:24,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:24,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 10:08:24,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:25,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:25,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767680221] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:25,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:25,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2025-02-05 10:08:25,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986041006] [2025-02-05 10:08:25,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:25,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 10:08:25,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:25,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 10:08:25,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2025-02-05 10:08:25,304 INFO L87 Difference]: Start difference. First operand 124 states and 153 transitions. Second operand has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:25,462 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2025-02-05 10:08:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:08:25,463 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-05 10:08:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:25,463 INFO L225 Difference]: With dead ends: 198 [2025-02-05 10:08:25,463 INFO L226 Difference]: Without dead ends: 164 [2025-02-05 10:08:25,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2025-02-05 10:08:25,464 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 109 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:25,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 85 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:08:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-05 10:08:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 130. [2025-02-05 10:08:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.2325581395348837) internal successors, (159), 129 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2025-02-05 10:08:25,473 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 32 [2025-02-05 10:08:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:25,473 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2025-02-05 10:08:25,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2025-02-05 10:08:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 10:08:25,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:25,474 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:25,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 10:08:25,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:25,674 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:25,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:25,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1719078350, now seen corresponding path program 1 times [2025-02-05 10:08:25,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:25,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424616213] [2025-02-05 10:08:25,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:25,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:25,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 10:08:25,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 10:08:25,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:25,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:08:25,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:25,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424616213] [2025-02-05 10:08:25,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424616213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:08:25,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:08:25,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:08:25,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893260312] [2025-02-05 10:08:25,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:08:25,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:08:25,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:25,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:08:25,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:08:25,699 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:25,717 INFO L93 Difference]: Finished difference Result 191 states and 231 transitions. [2025-02-05 10:08:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:08:25,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-05 10:08:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:25,718 INFO L225 Difference]: With dead ends: 191 [2025-02-05 10:08:25,718 INFO L226 Difference]: Without dead ends: 124 [2025-02-05 10:08:25,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:08:25,718 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:25,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 37 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:08:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-05 10:08:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2025-02-05 10:08:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.1714285714285715) internal successors, (123), 105 states have internal predecessors, (123), 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-05 10:08:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2025-02-05 10:08:25,726 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 37 [2025-02-05 10:08:25,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:25,726 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2025-02-05 10:08:25,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2025-02-05 10:08:25,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 10:08:25,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:25,727 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:25,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 10:08:25,727 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:25,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:25,727 INFO L85 PathProgramCache]: Analyzing trace with hash 193618547, now seen corresponding path program 3 times [2025-02-05 10:08:25,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:25,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687520662] [2025-02-05 10:08:25,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:08:25,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:25,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-02-05 10:08:25,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 10:08:25,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 10:08:25,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:26,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:26,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687520662] [2025-02-05 10:08:26,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687520662] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:26,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697989831] [2025-02-05 10:08:26,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:08:26,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:26,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:26,033 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:26,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 10:08:26,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-02-05 10:08:26,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 10:08:26,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 10:08:26,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:26,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 10:08:26,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:26,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-05 10:08:26,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-05 10:08:26,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-05 10:08:26,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-05 10:08:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:26,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:26,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:08:26,399 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 14 [2025-02-05 10:08:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:26,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697989831] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:26,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:26,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 25 [2025-02-05 10:08:26,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663866667] [2025-02-05 10:08:26,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:26,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 10:08:26,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:26,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 10:08:26,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2025-02-05 10:08:26,407 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 25 states, 25 states have (on average 3.56) internal successors, (89), 25 states have internal predecessors, (89), 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-05 10:08:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:27,769 INFO L93 Difference]: Finished difference Result 284 states and 323 transitions. [2025-02-05 10:08:27,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-05 10:08:27,770 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.56) internal successors, (89), 25 states have internal predecessors, (89), 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 37 [2025-02-05 10:08:27,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:27,772 INFO L225 Difference]: With dead ends: 284 [2025-02-05 10:08:27,772 INFO L226 Difference]: Without dead ends: 275 [2025-02-05 10:08:27,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=732, Invalid=4670, Unknown=0, NotChecked=0, Total=5402 [2025-02-05 10:08:27,774 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 179 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:27,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 227 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:08:27,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-05 10:08:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 119. [2025-02-05 10:08:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 118 states have internal predecessors, (137), 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-05 10:08:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2025-02-05 10:08:27,785 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 37 [2025-02-05 10:08:27,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:27,786 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2025-02-05 10:08:27,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.56) internal successors, (89), 25 states have internal predecessors, (89), 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-05 10:08:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2025-02-05 10:08:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 10:08:27,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:27,786 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:27,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 10:08:27,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 10:08:27,987 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:27,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:27,988 INFO L85 PathProgramCache]: Analyzing trace with hash 103850771, now seen corresponding path program 1 times [2025-02-05 10:08:27,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:27,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050191556] [2025-02-05 10:08:27,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:27,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:27,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 10:08:28,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 10:08:28,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:28,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:28,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:28,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050191556] [2025-02-05 10:08:28,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050191556] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:28,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096654706] [2025-02-05 10:08:28,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:28,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:28,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:28,263 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:28,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 10:08:28,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 10:08:28,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 10:08:28,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:28,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:28,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-05 10:08:28,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:28,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:08:28,350 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-05 10:08:28,357 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-05 10:08:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:28,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:28,501 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-05 10:08:28,503 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-05 10:08:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:28,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096654706] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:28,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:28,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 20 [2025-02-05 10:08:28,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472969739] [2025-02-05 10:08:28,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:28,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 10:08:28,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:28,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 10:08:28,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-02-05 10:08:28,528 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 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-05 10:08:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:29,270 INFO L93 Difference]: Finished difference Result 238 states and 271 transitions. [2025-02-05 10:08:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-05 10:08:29,271 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 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 37 [2025-02-05 10:08:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:29,275 INFO L225 Difference]: With dead ends: 238 [2025-02-05 10:08:29,275 INFO L226 Difference]: Without dead ends: 236 [2025-02-05 10:08:29,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=468, Invalid=2612, Unknown=0, NotChecked=0, Total=3080 [2025-02-05 10:08:29,276 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 95 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:29,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 217 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:08:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-05 10:08:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 136. [2025-02-05 10:08:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.162962962962963) internal successors, (157), 135 states have internal predecessors, (157), 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-05 10:08:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 157 transitions. [2025-02-05 10:08:29,292 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 157 transitions. Word has length 37 [2025-02-05 10:08:29,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:29,293 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 157 transitions. [2025-02-05 10:08:29,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 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-05 10:08:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 157 transitions. [2025-02-05 10:08:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 10:08:29,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:29,293 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:29,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 10:08:29,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:29,498 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:29,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:29,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1615785691, now seen corresponding path program 4 times [2025-02-05 10:08:29,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:29,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236373065] [2025-02-05 10:08:29,499 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:08:29,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:29,509 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-02-05 10:08:29,517 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 10:08:29,517 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:08:29,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:29,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:29,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236373065] [2025-02-05 10:08:29,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236373065] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:29,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897022517] [2025-02-05 10:08:29,763 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:08:29,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:29,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:29,765 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:29,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 10:08:29,807 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-02-05 10:08:29,822 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 10:08:29,823 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:08:29,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:29,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 10:08:29,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:29,904 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-05 10:08:29,926 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-05 10:08:30,092 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-05 10:08:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:30,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:30,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:08:30,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-05 10:08:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:30,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897022517] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:30,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:30,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 33 [2025-02-05 10:08:30,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818744226] [2025-02-05 10:08:30,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:30,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-05 10:08:30,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:30,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-05 10:08:30,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 10:08:30,297 INFO L87 Difference]: Start difference. First operand 136 states and 157 transitions. Second operand has 33 states, 33 states have (on average 3.4545454545454546) internal successors, (114), 33 states have internal predecessors, (114), 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-05 10:08:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:31,699 INFO L93 Difference]: Finished difference Result 276 states and 311 transitions. [2025-02-05 10:08:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-05 10:08:31,700 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.4545454545454546) internal successors, (114), 33 states have internal predecessors, (114), 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 42 [2025-02-05 10:08:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:31,701 INFO L225 Difference]: With dead ends: 276 [2025-02-05 10:08:31,701 INFO L226 Difference]: Without dead ends: 267 [2025-02-05 10:08:31,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=893, Invalid=5269, Unknown=0, NotChecked=0, Total=6162 [2025-02-05 10:08:31,702 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 246 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:31,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 244 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:08:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-05 10:08:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 139. [2025-02-05 10:08:31,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.1594202898550725) internal successors, (160), 138 states have internal predecessors, (160), 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-05 10:08:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2025-02-05 10:08:31,716 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 42 [2025-02-05 10:08:31,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:31,716 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2025-02-05 10:08:31,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.4545454545454546) internal successors, (114), 33 states have internal predecessors, (114), 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-05 10:08:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2025-02-05 10:08:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 10:08:31,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:31,717 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:31,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-05 10:08:31,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 10:08:31,921 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:31,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash -116116038, now seen corresponding path program 2 times [2025-02-05 10:08:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:31,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598228732] [2025-02-05 10:08:31,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:08:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:31,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-05 10:08:31,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 10:08:31,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:08:31,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:32,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:32,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598228732] [2025-02-05 10:08:32,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598228732] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:32,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822112323] [2025-02-05 10:08:32,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:08:32,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:32,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:32,159 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:32,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 10:08:32,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-05 10:08:32,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 10:08:32,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:08:32,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:32,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-05 10:08:32,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:32,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:08:32,289 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-05 10:08:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:32,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:32,560 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-05 10:08:32,561 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-05 10:08:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:32,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822112323] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:32,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:32,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 28 [2025-02-05 10:08:32,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30865100] [2025-02-05 10:08:32,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:32,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 10:08:32,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:32,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 10:08:32,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2025-02-05 10:08:32,571 INFO L87 Difference]: Start difference. First operand 139 states and 160 transitions. Second operand has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 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-05 10:08:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:33,571 INFO L93 Difference]: Finished difference Result 344 states and 392 transitions. [2025-02-05 10:08:33,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-02-05 10:08:33,572 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 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 42 [2025-02-05 10:08:33,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:33,573 INFO L225 Difference]: With dead ends: 344 [2025-02-05 10:08:33,574 INFO L226 Difference]: Without dead ends: 342 [2025-02-05 10:08:33,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=848, Invalid=5958, Unknown=0, NotChecked=0, Total=6806 [2025-02-05 10:08:33,575 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 156 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:33,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 227 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:08:33,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-02-05 10:08:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 161. [2025-02-05 10:08:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.15) internal successors, (184), 160 states have internal predecessors, (184), 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-05 10:08:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2025-02-05 10:08:33,603 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 42 [2025-02-05 10:08:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:33,603 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2025-02-05 10:08:33,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 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-05 10:08:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2025-02-05 10:08:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 10:08:33,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:33,604 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:33,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 10:08:33,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:33,805 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:33,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:33,805 INFO L85 PathProgramCache]: Analyzing trace with hash -33954957, now seen corresponding path program 5 times [2025-02-05 10:08:33,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:33,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451087014] [2025-02-05 10:08:33,805 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:08:33,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:33,813 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 6 equivalence classes. [2025-02-05 10:08:33,824 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:08:33,824 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-05 10:08:33,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:34,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:34,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451087014] [2025-02-05 10:08:34,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451087014] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:34,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649149699] [2025-02-05 10:08:34,004 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:08:34,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:34,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:34,006 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:34,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 10:08:34,055 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 6 equivalence classes. [2025-02-05 10:08:34,094 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:08:34,094 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-05 10:08:34,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:34,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 10:08:34,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:34,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:08:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:34,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:34,429 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-05 10:08:34,430 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-05 10:08:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:34,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649149699] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:34,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:34,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 25 [2025-02-05 10:08:34,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858008142] [2025-02-05 10:08:34,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:34,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 10:08:34,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:34,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 10:08:34,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-02-05 10:08:34,440 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:36,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:36,218 INFO L93 Difference]: Finished difference Result 419 states and 475 transitions. [2025-02-05 10:08:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-02-05 10:08:36,219 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-05 10:08:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:36,220 INFO L225 Difference]: With dead ends: 419 [2025-02-05 10:08:36,220 INFO L226 Difference]: Without dead ends: 417 [2025-02-05 10:08:36,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3734 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1219, Invalid=9493, Unknown=0, NotChecked=0, Total=10712 [2025-02-05 10:08:36,222 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 135 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:36,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 378 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:08:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-02-05 10:08:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 152. [2025-02-05 10:08:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 151 states have internal predecessors, (173), 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-05 10:08:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 173 transitions. [2025-02-05 10:08:36,237 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 173 transitions. Word has length 47 [2025-02-05 10:08:36,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:36,237 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 173 transitions. [2025-02-05 10:08:36,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 173 transitions. [2025-02-05 10:08:36,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 10:08:36,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:36,238 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:36,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-05 10:08:36,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:36,439 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:36,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:36,439 INFO L85 PathProgramCache]: Analyzing trace with hash -327553900, now seen corresponding path program 3 times [2025-02-05 10:08:36,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:36,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119347165] [2025-02-05 10:08:36,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:08:36,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:36,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 6 equivalence classes. [2025-02-05 10:08:36,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:08:36,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-05 10:08:36,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 40 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:36,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:36,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119347165] [2025-02-05 10:08:36,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119347165] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:36,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131603942] [2025-02-05 10:08:36,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:08:36,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:36,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:36,877 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:36,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 10:08:36,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 6 equivalence classes. [2025-02-05 10:08:36,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:08:36,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-05 10:08:36,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:36,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-05 10:08:36,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:37,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-05 10:08:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:37,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:37,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:08:37,403 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 14 [2025-02-05 10:08:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:37,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131603942] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:37,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:37,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 35 [2025-02-05 10:08:37,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694385529] [2025-02-05 10:08:37,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:37,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 10:08:37,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:37,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 10:08:37,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 10:08:37,447 INFO L87 Difference]: Start difference. First operand 152 states and 173 transitions. Second operand has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 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-05 10:08:40,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:40,637 INFO L93 Difference]: Finished difference Result 449 states and 503 transitions. [2025-02-05 10:08:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-02-05 10:08:40,637 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 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 47 [2025-02-05 10:08:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:40,638 INFO L225 Difference]: With dead ends: 449 [2025-02-05 10:08:40,639 INFO L226 Difference]: Without dead ends: 355 [2025-02-05 10:08:40,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5391 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1963, Invalid=15067, Unknown=0, NotChecked=0, Total=17030 [2025-02-05 10:08:40,642 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 320 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:40,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 398 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 10:08:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-05 10:08:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 211. [2025-02-05 10:08:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.1285714285714286) internal successors, (237), 210 states have internal predecessors, (237), 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-05 10:08:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 237 transitions. [2025-02-05 10:08:40,663 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 237 transitions. Word has length 47 [2025-02-05 10:08:40,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:40,663 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 237 transitions. [2025-02-05 10:08:40,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 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-05 10:08:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 237 transitions. [2025-02-05 10:08:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 10:08:40,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:40,664 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:40,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-05 10:08:40,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:40,868 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:40,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:40,869 INFO L85 PathProgramCache]: Analyzing trace with hash 673423066, now seen corresponding path program 6 times [2025-02-05 10:08:40,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:40,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796088458] [2025-02-05 10:08:40,869 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:08:40,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:40,876 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 7 equivalence classes. [2025-02-05 10:08:40,886 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 10:08:40,886 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-05 10:08:40,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 73 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:41,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:41,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796088458] [2025-02-05 10:08:41,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796088458] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:41,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343098171] [2025-02-05 10:08:41,191 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:08:41,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:41,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:41,194 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:41,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 10:08:41,246 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 7 equivalence classes. [2025-02-05 10:08:41,288 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 10:08:41,289 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-05 10:08:41,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:41,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 10:08:41,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 99 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:41,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 99 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:41,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343098171] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:41,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:41,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 36 [2025-02-05 10:08:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262395995] [2025-02-05 10:08:41,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:41,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 10:08:41,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:41,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 10:08:41,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=941, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 10:08:41,883 INFO L87 Difference]: Start difference. First operand 211 states and 237 transitions. Second operand has 36 states, 36 states have (on average 3.9722222222222223) internal successors, (143), 36 states have internal predecessors, (143), 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-05 10:08:42,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:42,118 INFO L93 Difference]: Finished difference Result 329 states and 368 transitions. [2025-02-05 10:08:42,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 10:08:42,119 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.9722222222222223) internal successors, (143), 36 states have internal predecessors, (143), 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 52 [2025-02-05 10:08:42,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:42,119 INFO L225 Difference]: With dead ends: 329 [2025-02-05 10:08:42,119 INFO L226 Difference]: Without dead ends: 250 [2025-02-05 10:08:42,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=459, Invalid=1347, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 10:08:42,122 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 216 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:42,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 151 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:08:42,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-05 10:08:42,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 226. [2025-02-05 10:08:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.12) internal successors, (252), 225 states have internal predecessors, (252), 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-05 10:08:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 252 transitions. [2025-02-05 10:08:42,145 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 252 transitions. Word has length 52 [2025-02-05 10:08:42,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:42,145 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 252 transitions. [2025-02-05 10:08:42,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.9722222222222223) internal successors, (143), 36 states have internal predecessors, (143), 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-05 10:08:42,145 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 252 transitions. [2025-02-05 10:08:42,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:08:42,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:42,146 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:42,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-05 10:08:42,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-05 10:08:42,346 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:42,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:42,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2064186737, now seen corresponding path program 7 times [2025-02-05 10:08:42,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:42,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095550995] [2025-02-05 10:08:42,347 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:08:42,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:42,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:08:42,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:08:42,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:42,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:42,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:42,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095550995] [2025-02-05 10:08:42,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095550995] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:42,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435042728] [2025-02-05 10:08:42,739 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:08:42,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:42,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:42,742 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:42,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-05 10:08:42,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:08:42,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:08:42,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:42,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:42,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-05 10:08:42,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:42,931 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-05 10:08:42,956 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-05 10:08:42,968 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-05 10:08:43,213 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-05 10:08:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:43,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:43,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:08:43,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-05 10:08:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:43,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435042728] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:43,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:43,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 43 [2025-02-05 10:08:43,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932596916] [2025-02-05 10:08:43,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:43,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-05 10:08:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:43,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-05 10:08:43,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1655, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 10:08:43,520 INFO L87 Difference]: Start difference. First operand 226 states and 252 transitions. Second operand has 43 states, 43 states have (on average 3.697674418604651) internal successors, (159), 43 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:48,377 INFO L93 Difference]: Finished difference Result 591 states and 651 transitions. [2025-02-05 10:08:48,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2025-02-05 10:08:48,378 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.697674418604651) internal successors, (159), 43 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-02-05 10:08:48,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:48,379 INFO L225 Difference]: With dead ends: 591 [2025-02-05 10:08:48,379 INFO L226 Difference]: Without dead ends: 582 [2025-02-05 10:08:48,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9969 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2807, Invalid=29413, Unknown=0, NotChecked=0, Total=32220 [2025-02-05 10:08:48,381 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 367 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 2989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:48,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 650 Invalid, 2989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 10:08:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-02-05 10:08:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 224. [2025-02-05 10:08:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.116591928251121) internal successors, (249), 223 states have internal predecessors, (249), 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-05 10:08:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 249 transitions. [2025-02-05 10:08:48,406 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 249 transitions. Word has length 57 [2025-02-05 10:08:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:48,406 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 249 transitions. [2025-02-05 10:08:48,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.697674418604651) internal successors, (159), 43 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 249 transitions. [2025-02-05 10:08:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:08:48,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:48,407 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:48,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-05 10:08:48,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:48,611 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:48,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:48,611 INFO L85 PathProgramCache]: Analyzing trace with hash -739213935, now seen corresponding path program 2 times [2025-02-05 10:08:48,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:48,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455336937] [2025-02-05 10:08:48,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:08:48,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:48,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-02-05 10:08:48,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:08:48,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:08:48,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:48,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:48,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455336937] [2025-02-05 10:08:48,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455336937] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:48,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426403053] [2025-02-05 10:08:48,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:08:48,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:48,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:48,888 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:48,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-05 10:08:48,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-02-05 10:08:48,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:08:48,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:08:48,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:48,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-05 10:08:48,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:49,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:08:49,247 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-05 10:08:49,253 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-05 10:08:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:49,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:49,551 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-05 10:08:49,553 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-05 10:08:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:49,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426403053] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:49,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:49,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 15] total 32 [2025-02-05 10:08:49,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553152867] [2025-02-05 10:08:49,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:49,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 10:08:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:49,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 10:08:49,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2025-02-05 10:08:49,563 INFO L87 Difference]: Start difference. First operand 224 states and 249 transitions. Second operand has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 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-05 10:08:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:52,067 INFO L93 Difference]: Finished difference Result 508 states and 570 transitions. [2025-02-05 10:08:52,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-02-05 10:08:52,068 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 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 57 [2025-02-05 10:08:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:52,069 INFO L225 Difference]: With dead ends: 508 [2025-02-05 10:08:52,069 INFO L226 Difference]: Without dead ends: 506 [2025-02-05 10:08:52,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9643 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2316, Invalid=23444, Unknown=0, NotChecked=0, Total=25760 [2025-02-05 10:08:52,071 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 294 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:52,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 323 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:08:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-02-05 10:08:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 256. [2025-02-05 10:08:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.1215686274509804) internal successors, (286), 255 states have internal predecessors, (286), 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-05 10:08:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 286 transitions. [2025-02-05 10:08:52,104 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 286 transitions. Word has length 57 [2025-02-05 10:08:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:52,104 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 286 transitions. [2025-02-05 10:08:52,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 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-05 10:08:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 286 transitions. [2025-02-05 10:08:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 10:08:52,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:52,105 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:52,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-05 10:08:52,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:52,305 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:52,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:52,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1800372893, now seen corresponding path program 8 times [2025-02-05 10:08:52,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:52,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572933216] [2025-02-05 10:08:52,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:08:52,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:52,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-05 10:08:52,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 10:08:52,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:08:52,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 14 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:52,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:52,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572933216] [2025-02-05 10:08:52,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572933216] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:52,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286566661] [2025-02-05 10:08:52,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:08:52,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:52,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:52,645 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:52,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-05 10:08:52,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-05 10:08:52,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 10:08:52,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:08:52,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:52,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 10:08:52,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:52,871 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-05 10:08:52,893 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-05 10:08:53,199 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-05 10:08:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 14 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:53,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:53,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:08:53,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-05 10:08:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 14 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:53,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286566661] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:53,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:53,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 45 [2025-02-05 10:08:53,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720230372] [2025-02-05 10:08:53,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:53,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-05 10:08:53,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:53,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-05 10:08:53,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1821, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 10:08:53,545 INFO L87 Difference]: Start difference. First operand 256 states and 286 transitions. Second operand has 45 states, 45 states have (on average 3.8666666666666667) internal successors, (174), 45 states have internal predecessors, (174), 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-05 10:08:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:57,507 INFO L93 Difference]: Finished difference Result 543 states and 595 transitions. [2025-02-05 10:08:57,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2025-02-05 10:08:57,508 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.8666666666666667) internal successors, (174), 45 states have internal predecessors, (174), 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 62 [2025-02-05 10:08:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:57,509 INFO L225 Difference]: With dead ends: 543 [2025-02-05 10:08:57,509 INFO L226 Difference]: Without dead ends: 534 [2025-02-05 10:08:57,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6740 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2362, Invalid=21200, Unknown=0, NotChecked=0, Total=23562 [2025-02-05 10:08:57,511 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 443 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 2743 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 2743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:57,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 683 Invalid, 3120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 2743 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 10:08:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-05 10:08:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 244. [2025-02-05 10:08:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.123456790123457) internal successors, (273), 243 states have internal predecessors, (273), 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-05 10:08:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 273 transitions. [2025-02-05 10:08:57,540 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 273 transitions. Word has length 62 [2025-02-05 10:08:57,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:57,540 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 273 transitions. [2025-02-05 10:08:57,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.8666666666666667) internal successors, (174), 45 states have internal predecessors, (174), 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-05 10:08:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 273 transitions. [2025-02-05 10:08:57,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 10:08:57,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:57,541 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:57,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-05 10:08:57,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:57,742 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:57,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:57,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1024908988, now seen corresponding path program 3 times [2025-02-05 10:08:57,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:57,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735701790] [2025-02-05 10:08:57,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:08:57,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:57,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 8 equivalence classes. [2025-02-05 10:08:57,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 10:08:57,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-05 10:08:57,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:58,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:58,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735701790] [2025-02-05 10:08:58,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735701790] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:58,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444068511] [2025-02-05 10:08:58,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:08:58,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:58,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:58,175 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:58,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-05 10:08:58,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 8 equivalence classes. [2025-02-05 10:08:58,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 10:08:58,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-05 10:08:58,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:58,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-05 10:08:58,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:58,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-05 10:08:58,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-05 10:08:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:58,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:58,714 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-05 10:08:58,715 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-05 10:08:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:58,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444068511] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:58,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:58,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 29 [2025-02-05 10:08:58,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574540921] [2025-02-05 10:08:58,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:58,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 10:08:58,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:58,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 10:08:58,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2025-02-05 10:08:58,727 INFO L87 Difference]: Start difference. First operand 244 states and 273 transitions. Second operand has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 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-05 10:09:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:02,640 INFO L93 Difference]: Finished difference Result 768 states and 864 transitions. [2025-02-05 10:09:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2025-02-05 10:09:02,640 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 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 62 [2025-02-05 10:09:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:02,642 INFO L225 Difference]: With dead ends: 768 [2025-02-05 10:09:02,642 INFO L226 Difference]: Without dead ends: 766 [2025-02-05 10:09:02,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20639 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2972, Invalid=46980, Unknown=0, NotChecked=0, Total=49952 [2025-02-05 10:09:02,645 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 212 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 3673 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 4129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 3673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:02,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 629 Invalid, 4129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 3673 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 10:09:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-02-05 10:09:02,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 281. [2025-02-05 10:09:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.1178571428571429) internal successors, (313), 280 states have internal predecessors, (313), 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-05 10:09:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 313 transitions. [2025-02-05 10:09:02,693 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 313 transitions. Word has length 62 [2025-02-05 10:09:02,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:02,693 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 313 transitions. [2025-02-05 10:09:02,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 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-05 10:09:02,693 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 313 transitions. [2025-02-05 10:09:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 10:09:02,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:02,694 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:02,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-05 10:09:02,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-05 10:09:02,896 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:02,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:02,896 INFO L85 PathProgramCache]: Analyzing trace with hash -160868111, now seen corresponding path program 9 times [2025-02-05 10:09:02,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:02,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285672715] [2025-02-05 10:09:02,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:09:02,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:02,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 9 equivalence classes. [2025-02-05 10:09:02,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 10:09:02,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-05 10:09:02,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 105 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:03,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:03,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285672715] [2025-02-05 10:09:03,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285672715] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:03,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134294987] [2025-02-05 10:09:03,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:09:03,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:03,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:03,467 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:09:03,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-05 10:09:03,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 9 equivalence classes. [2025-02-05 10:09:03,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 10:09:03,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-05 10:09:03,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:03,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-05 10:09:03,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:03,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-05 10:09:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:03,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:04,139 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-05 10:09:04,140 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-05 10:09:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:04,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134294987] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:04,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:04,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 43 [2025-02-05 10:09:04,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113189970] [2025-02-05 10:09:04,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:04,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-05 10:09:04,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:04,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-05 10:09:04,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1653, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 10:09:04,154 INFO L87 Difference]: Start difference. First operand 281 states and 313 transitions. Second operand has 43 states, 43 states have (on average 4.023255813953488) internal successors, (173), 43 states have internal predecessors, (173), 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-05 10:09:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:13,246 INFO L93 Difference]: Finished difference Result 911 states and 1022 transitions. [2025-02-05 10:09:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 284 states. [2025-02-05 10:09:13,246 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.023255813953488) internal successors, (173), 43 states have internal predecessors, (173), 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 67 [2025-02-05 10:09:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:13,248 INFO L225 Difference]: With dead ends: 911 [2025-02-05 10:09:13,248 INFO L226 Difference]: Without dead ends: 766 [2025-02-05 10:09:13,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42655 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=6969, Invalid=97037, Unknown=0, NotChecked=0, Total=104006 [2025-02-05 10:09:13,252 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 555 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 4852 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 5239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 4852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:13,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 848 Invalid, 5239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 4852 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 10:09:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-02-05 10:09:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 257. [2025-02-05 10:09:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.109375) internal successors, (284), 256 states have internal predecessors, (284), 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-05 10:09:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 284 transitions. [2025-02-05 10:09:13,302 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 284 transitions. Word has length 67 [2025-02-05 10:09:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:13,302 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 284 transitions. [2025-02-05 10:09:13,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.023255813953488) internal successors, (173), 43 states have internal predecessors, (173), 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-05 10:09:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 284 transitions. [2025-02-05 10:09:13,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 10:09:13,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:13,303 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:13,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-05 10:09:13,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:13,503 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:13,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1388243886, now seen corresponding path program 4 times [2025-02-05 10:09:13,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:13,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811347336] [2025-02-05 10:09:13,503 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:09:13,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:13,511 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-02-05 10:09:13,520 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 10:09:13,520 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:09:13,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 16 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:13,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:13,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811347336] [2025-02-05 10:09:13,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811347336] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:13,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405234073] [2025-02-05 10:09:13,955 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:09:13,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:13,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:13,957 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:09:13,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-05 10:09:14,031 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-02-05 10:09:14,054 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 10:09:14,055 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:09:14,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:14,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-05 10:09:14,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:14,185 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-05 10:09:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 16 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:14,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:15,102 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 37 treesize of output 33 [2025-02-05 10:09:15,104 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 43 treesize of output 35 [2025-02-05 10:09:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:15,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405234073] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:15,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:15,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 49 [2025-02-05 10:09:15,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114234491] [2025-02-05 10:09:15,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:15,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-05 10:09:15,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:15,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-05 10:09:15,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2186, Unknown=0, NotChecked=0, Total=2352 [2025-02-05 10:09:15,190 INFO L87 Difference]: Start difference. First operand 257 states and 284 transitions. Second operand has 49 states, 49 states have (on average 3.938775510204082) internal successors, (193), 49 states have internal predecessors, (193), 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-05 10:09:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:24,216 INFO L93 Difference]: Finished difference Result 1055 states and 1162 transitions. [2025-02-05 10:09:24,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2025-02-05 10:09:24,216 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.938775510204082) internal successors, (193), 49 states have internal predecessors, (193), 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 67 [2025-02-05 10:09:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:24,219 INFO L225 Difference]: With dead ends: 1055 [2025-02-05 10:09:24,219 INFO L226 Difference]: Without dead ends: 1046 [2025-02-05 10:09:24,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18328 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=4642, Invalid=49880, Unknown=0, NotChecked=0, Total=54522 [2025-02-05 10:09:24,220 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1132 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 4053 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 4609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 4053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:24,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 293 Invalid, 4609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 4053 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 10:09:24,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-02-05 10:09:24,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 331. [2025-02-05 10:09:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.1090909090909091) internal successors, (366), 330 states have internal predecessors, (366), 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-05 10:09:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 366 transitions. [2025-02-05 10:09:24,271 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 366 transitions. Word has length 67 [2025-02-05 10:09:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:24,271 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 366 transitions. [2025-02-05 10:09:24,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.938775510204082) internal successors, (193), 49 states have internal predecessors, (193), 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-05 10:09:24,271 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 366 transitions. [2025-02-05 10:09:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 10:09:24,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:24,272 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:24,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-05 10:09:24,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-05 10:09:24,472 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:24,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:24,472 INFO L85 PathProgramCache]: Analyzing trace with hash -425226148, now seen corresponding path program 5 times [2025-02-05 10:09:24,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:24,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549977748] [2025-02-05 10:09:24,472 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:09:24,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:24,480 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 72 statements into 10 equivalence classes. [2025-02-05 10:09:24,492 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 10:09:24,493 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-02-05 10:09:24,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 216 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:24,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:24,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549977748] [2025-02-05 10:09:24,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549977748] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:24,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368923482] [2025-02-05 10:09:24,872 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:09:24,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:24,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:24,879 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:09:24,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-05 10:09:24,966 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 72 statements into 10 equivalence classes. [2025-02-05 10:09:25,035 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 10:09:25,036 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-02-05 10:09:25,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:25,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 10:09:25,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 216 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:25,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 216 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368923482] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:25,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:25,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 48 [2025-02-05 10:09:25,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999068178] [2025-02-05 10:09:25,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:25,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-05 10:09:25,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:25,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-05 10:09:25,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=569, Invalid=1687, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 10:09:25,875 INFO L87 Difference]: Start difference. First operand 331 states and 366 transitions. Second operand has 48 states, 48 states have (on average 4.229166666666667) internal successors, (203), 48 states have internal predecessors, (203), 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-05 10:09:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:26,196 INFO L93 Difference]: Finished difference Result 494 states and 541 transitions. [2025-02-05 10:09:26,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 10:09:26,197 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.229166666666667) internal successors, (203), 48 states have internal predecessors, (203), 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 72 [2025-02-05 10:09:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:26,198 INFO L225 Difference]: With dead ends: 494 [2025-02-05 10:09:26,198 INFO L226 Difference]: Without dead ends: 370 [2025-02-05 10:09:26,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=708, Invalid=2154, Unknown=0, NotChecked=0, Total=2862 [2025-02-05 10:09:26,199 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 264 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:26,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 229 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:09:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-02-05 10:09:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 346. [2025-02-05 10:09:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.1043478260869566) internal successors, (381), 345 states have internal predecessors, (381), 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-05 10:09:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 381 transitions. [2025-02-05 10:09:26,252 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 381 transitions. Word has length 72 [2025-02-05 10:09:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:26,252 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 381 transitions. [2025-02-05 10:09:26,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.229166666666667) internal successors, (203), 48 states have internal predecessors, (203), 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-05 10:09:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 381 transitions. [2025-02-05 10:09:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 10:09:26,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:26,252 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:26,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-02-05 10:09:26,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-05 10:09:26,453 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:26,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash 568005939, now seen corresponding path program 10 times [2025-02-05 10:09:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:26,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061397802] [2025-02-05 10:09:26,454 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:09:26,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:26,463 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 77 statements into 2 equivalence classes. [2025-02-05 10:09:26,470 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 10:09:26,470 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:09:26,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:27,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061397802] [2025-02-05 10:09:27,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061397802] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724517078] [2025-02-05 10:09:27,089 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:09:27,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:27,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:27,093 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:09:27,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-05 10:09:27,176 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 77 statements into 2 equivalence classes. [2025-02-05 10:09:27,200 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 10:09:27,200 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:09:27,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:27,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-05 10:09:27,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:27,379 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-05 10:09:27,405 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-05 10:09:27,411 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-05 10:09:27,784 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-05 10:09:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:27,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:28,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:09:28,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-05 10:09:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:28,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724517078] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:28,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:28,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 19] total 55 [2025-02-05 10:09:28,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195926798] [2025-02-05 10:09:28,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:28,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-05 10:09:28,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:28,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-05 10:09:28,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2777, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 10:09:28,238 INFO L87 Difference]: Start difference. First operand 346 states and 381 transitions. Second operand has 55 states, 55 states have (on average 3.981818181818182) internal successors, (219), 55 states have internal predecessors, (219), 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-05 10:09:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:41,255 INFO L93 Difference]: Finished difference Result 1074 states and 1166 transitions. [2025-02-05 10:09:41,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 286 states. [2025-02-05 10:09:41,255 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.981818181818182) internal successors, (219), 55 states have internal predecessors, (219), 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 77 [2025-02-05 10:09:41,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:41,258 INFO L225 Difference]: With dead ends: 1074 [2025-02-05 10:09:41,258 INFO L226 Difference]: Without dead ends: 1065 [2025-02-05 10:09:41,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41798 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=6572, Invalid=108010, Unknown=0, NotChecked=0, Total=114582 [2025-02-05 10:09:41,261 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 571 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 6452 mSolverCounterSat, 662 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 7114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 662 IncrementalHoareTripleChecker+Valid, 6452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:41,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1502 Invalid, 7114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [662 Valid, 6452 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 10:09:41,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-02-05 10:09:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 329. [2025-02-05 10:09:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.100609756097561) internal successors, (361), 328 states have internal predecessors, (361), 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-05 10:09:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 361 transitions. [2025-02-05 10:09:41,310 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 361 transitions. Word has length 77 [2025-02-05 10:09:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:41,311 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 361 transitions. [2025-02-05 10:09:41,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.981818181818182) internal successors, (219), 55 states have internal predecessors, (219), 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-05 10:09:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 361 transitions. [2025-02-05 10:09:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 10:09:41,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:41,312 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 9, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:41,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-02-05 10:09:41,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:41,516 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:41,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1712777773, now seen corresponding path program 3 times [2025-02-05 10:09:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509965530] [2025-02-05 10:09:41,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:09:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:41,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 10 equivalence classes. [2025-02-05 10:09:41,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 10:09:41,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-05 10:09:41,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:41,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:41,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509965530] [2025-02-05 10:09:41,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509965530] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:41,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159104572] [2025-02-05 10:09:41,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:09:41,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:41,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:41,971 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:09:41,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-05 10:09:42,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 10 equivalence classes. [2025-02-05 10:09:42,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 10:09:42,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-05 10:09:42,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:42,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-05 10:09:42,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:42,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-05 10:09:42,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-05 10:09:42,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:09:42,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-02-05 10:09:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:42,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:42,833 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-05 10:09:42,836 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-05 10:09:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:42,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159104572] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:42,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:42,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 20] total 36 [2025-02-05 10:09:42,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915229281] [2025-02-05 10:09:42,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:42,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 10:09:42,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:42,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 10:09:42,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1114, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 10:09:42,849 INFO L87 Difference]: Start difference. First operand 329 states and 361 transitions. Second operand has 36 states, 36 states have (on average 3.9444444444444446) internal successors, (142), 36 states have internal predecessors, (142), 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-05 10:09:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:47,636 INFO L93 Difference]: Finished difference Result 784 states and 879 transitions. [2025-02-05 10:09:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2025-02-05 10:09:47,637 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.9444444444444446) internal successors, (142), 36 states have internal predecessors, (142), 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 77 [2025-02-05 10:09:47,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:47,638 INFO L225 Difference]: With dead ends: 784 [2025-02-05 10:09:47,639 INFO L226 Difference]: Without dead ends: 782 [2025-02-05 10:09:47,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24832 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3880, Invalid=56882, Unknown=0, NotChecked=0, Total=60762 [2025-02-05 10:09:47,641 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 352 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 3463 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 3801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 3463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:47,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 720 Invalid, 3801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 3463 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 10:09:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-02-05 10:09:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 386. [2025-02-05 10:09:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.1090909090909091) internal successors, (427), 385 states have internal predecessors, (427), 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-05 10:09:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 427 transitions. [2025-02-05 10:09:47,705 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 427 transitions. Word has length 77 [2025-02-05 10:09:47,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:47,705 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 427 transitions. [2025-02-05 10:09:47,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.9444444444444446) internal successors, (142), 36 states have internal predecessors, (142), 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-05 10:09:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 427 transitions. [2025-02-05 10:09:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 10:09:47,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:47,710 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:47,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-02-05 10:09:47,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:47,912 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:47,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1035996133, now seen corresponding path program 11 times [2025-02-05 10:09:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:47,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3987996] [2025-02-05 10:09:47,912 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:09:47,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:47,921 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 82 statements into 11 equivalence classes. [2025-02-05 10:09:47,946 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 10:09:47,946 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-05 10:09:47,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 20 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:48,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:48,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3987996] [2025-02-05 10:09:48,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3987996] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:48,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544053376] [2025-02-05 10:09:48,363 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:09:48,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:48,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:48,364 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:09:48,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-02-05 10:09:48,454 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 82 statements into 11 equivalence classes. [2025-02-05 10:09:48,653 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 10:09:48,653 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-05 10:09:48,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:48,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-05 10:09:48,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:48,820 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-05 10:09:48,845 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-05 10:09:49,295 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-05 10:09:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 20 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:49,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:49,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:09:49,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-05 10:09:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 20 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:09:49,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544053376] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:49,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:49,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 39 [2025-02-05 10:09:49,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950185175] [2025-02-05 10:09:49,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:49,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-05 10:09:49,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:49,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-05 10:09:49,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2025-02-05 10:09:49,554 INFO L87 Difference]: Start difference. First operand 386 states and 427 transitions. Second operand has 39 states, 39 states have (on average 4.128205128205129) internal successors, (161), 39 states have internal predecessors, (161), 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)