./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-19.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e838264e6ed88ede0832d807d635f75755550116c48539e38a7650cef86d5a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:37:08,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:37:08,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:37:08,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:37:08,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:37:08,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:37:08,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:37:08,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:37:08,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:37:08,852 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:37:08,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:37:08,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:37:08,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:37:08,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:37:08,854 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:37:08,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:37:08,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:37:08,854 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:37:08,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:37:08,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:37:08,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:37:08,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:37:08,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:37:08,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:37:08,855 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:37:08,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:37:08,855 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:37:08,856 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:37:08,856 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:37:08,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:37:08,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:37:08,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:37:08,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:37:08,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:37:08,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:37:08,857 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:37:08,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:37:08,857 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:37:08,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:37:08,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:37:08,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:37:08,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:37:08,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:37:08,858 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 -> 5e838264e6ed88ede0832d807d635f75755550116c48539e38a7650cef86d5a2 [2025-02-06 03:37:09,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:37:09,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:37:09,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:37:09,142 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:37:09,142 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:37:09,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-19.i [2025-02-06 03:37:10,421 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a853ceea/772fd058e05a4d73a3d2f103e00fa891/FLAG3d8479f21 [2025-02-06 03:37:10,700 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:37:10,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-19.i [2025-02-06 03:37:10,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a853ceea/772fd058e05a4d73a3d2f103e00fa891/FLAG3d8479f21 [2025-02-06 03:37:10,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a853ceea/772fd058e05a4d73a3d2f103e00fa891 [2025-02-06 03:37:10,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:37:10,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:37:10,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:37:10,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:37:10,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:37:10,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:37:10" (1/1) ... [2025-02-06 03:37:10,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a328d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:10, skipping insertion in model container [2025-02-06 03:37:10,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:37:10" (1/1) ... [2025-02-06 03:37:10,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:37:10,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-19.i[916,929] [2025-02-06 03:37:10,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:37:10,965 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:37:10,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-19.i[916,929] [2025-02-06 03:37:11,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:37:11,035 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:37:11,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:11 WrapperNode [2025-02-06 03:37:11,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:37:11,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:37:11,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:37:11,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:37:11,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:11" (1/1) ... [2025-02-06 03:37:11,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:11" (1/1) ... [2025-02-06 03:37:11,095 INFO L138 Inliner]: procedures = 26, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 491 [2025-02-06 03:37:11,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:37:11,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:37:11,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:37:11,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:37:11,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:11" (1/1) ... [2025-02-06 03:37:11,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:11" (1/1) ... [2025-02-06 03:37:11,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:11" (1/1) ... [2025-02-06 03:37:11,133 INFO L175 MemorySlicer]: Split 124 memory accesses to 13 slices as follows [2, 5, 16, 10, 10, 8, 14, 24, 8, 7, 8, 7, 5]. 19 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1]. [2025-02-06 03:37:11,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:11" (1/1) ... [2025-02-06 03:37:11,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:11" (1/1) ... [2025-02-06 03:37:11,155 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:11" (1/1) ... [2025-02-06 03:37:11,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:11" (1/1) ... [2025-02-06 03:37:11,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:11" (1/1) ... [2025-02-06 03:37:11,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:11" (1/1) ... [2025-02-06 03:37:11,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:37:11,167 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:37:11,167 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:37:11,167 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:37:11,168 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:11" (1/1) ... [2025-02-06 03:37:11,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:37:11,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:37:11,200 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-06 03:37:11,203 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-06 03:37:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:37:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:37:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:37:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:37:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:37:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:37:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:37:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:37:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:37:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:37:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:37:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:37:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 03:37:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 03:37:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:37:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:37:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:37:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:37:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:37:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:37:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:37:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:37:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:37:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:37:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:37:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 03:37:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 03:37:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:37:11,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:37:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:37:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:37:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:37:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:37:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:37:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:37:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:37:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:37:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:37:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:37:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:37:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 03:37:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 03:37:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:37:11,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:37:11,412 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:37:11,413 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:37:11,822 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~bitwise74#1;havoc property_#t~mem75#1;havoc property_#t~ite92#1;havoc property_#t~mem87#1;havoc property_#t~mem80#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite86#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite109#1;havoc property_#t~mem95#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem104#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite122#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-02-06 03:37:11,870 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-02-06 03:37:11,870 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:37:11,886 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:37:11,886 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:37:11,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:37:11 BoogieIcfgContainer [2025-02-06 03:37:11,888 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:37:11,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:37:11,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:37:11,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:37:11,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:37:10" (1/3) ... [2025-02-06 03:37:11,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bc0ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:37:11, skipping insertion in model container [2025-02-06 03:37:11,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:11" (2/3) ... [2025-02-06 03:37:11,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bc0ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:37:11, skipping insertion in model container [2025-02-06 03:37:11,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:37:11" (3/3) ... [2025-02-06 03:37:11,898 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-19.i [2025-02-06 03:37:11,912 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:37:11,914 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-19.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:37:11,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:37:11,986 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;@5acebcd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:37:11,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:37:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 81 states have (on average 1.382716049382716) internal successors, (112), 82 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:37:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:37:12,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:12,005 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:37:12,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:12,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:12,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1542436912, now seen corresponding path program 1 times [2025-02-06 03:37:12,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:12,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036957333] [2025-02-06 03:37:12,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:12,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:12,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:37:12,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:37:12,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:12,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 03:37:12,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:12,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036957333] [2025-02-06 03:37:12,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036957333] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:37:12,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376720565] [2025-02-06 03:37:12,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:12,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:37:12,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:37:12,362 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-06 03:37:12,363 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-06 03:37:12,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:37:12,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:37:12,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:12,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:12,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:37:12,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:37:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 03:37:12,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:37:12,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376720565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:12,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:37:12,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:37:12,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842376807] [2025-02-06 03:37:12,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:12,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:37:12,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:12,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:37:12,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:37:12,691 INFO L87 Difference]: Start difference. First operand has 101 states, 81 states have (on average 1.382716049382716) internal successors, (112), 82 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:37:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:12,731 INFO L93 Difference]: Finished difference Result 196 states and 304 transitions. [2025-02-06 03:37:12,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:37:12,733 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-02-06 03:37:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:12,739 INFO L225 Difference]: With dead ends: 196 [2025-02-06 03:37:12,739 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 03:37:12,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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-06 03:37:12,744 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:12,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:37:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 03:37:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 03:37:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:37:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2025-02-06 03:37:12,784 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 132 [2025-02-06 03:37:12,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:12,784 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2025-02-06 03:37:12,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:37:12,785 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2025-02-06 03:37:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:37:12,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:12,788 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:37:12,796 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-06 03:37:12,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:37:12,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:12,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:12,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1345416801, now seen corresponding path program 1 times [2025-02-06 03:37:12,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:12,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805571340] [2025-02-06 03:37:12,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:12,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:13,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:37:13,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:37:13,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:13,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:37:13,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:13,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805571340] [2025-02-06 03:37:13,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805571340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:13,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:13,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:37:13,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544715760] [2025-02-06 03:37:13,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:13,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:37:13,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:13,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:37:13,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:37:13,369 INFO L87 Difference]: Start difference. First operand 98 states and 139 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:37:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:13,422 INFO L93 Difference]: Finished difference Result 196 states and 279 transitions. [2025-02-06 03:37:13,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:37:13,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-02-06 03:37:13,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:13,426 INFO L225 Difference]: With dead ends: 196 [2025-02-06 03:37:13,426 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 03:37:13,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-06 03:37:13,427 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:13,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 393 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:37:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 03:37:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-02-06 03:37:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:37:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2025-02-06 03:37:13,439 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 132 [2025-02-06 03:37:13,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:13,440 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2025-02-06 03:37:13,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:37:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2025-02-06 03:37:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:37:13,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:13,442 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:37:13,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:37:13,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:13,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:13,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1346340322, now seen corresponding path program 1 times [2025-02-06 03:37:13,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:13,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640218455] [2025-02-06 03:37:13,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:13,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:13,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:37:13,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:37:13,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:13,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:37:20,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:20,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640218455] [2025-02-06 03:37:20,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640218455] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:37:20,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732812716] [2025-02-06 03:37:20,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:20,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:37:20,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:37:20,413 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-06 03:37:20,416 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-06 03:37:20,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:37:20,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:37:20,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:20,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:20,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:37:20,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:37:20,919 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-06 03:37:20,940 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 64 treesize of output 51 [2025-02-06 03:37:20,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2025-02-06 03:37:20,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2025-02-06 03:37:21,125 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 195 treesize of output 171 [2025-02-06 03:37:21,134 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 171 treesize of output 115 [2025-02-06 03:37:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 276 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-02-06 03:37:21,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:37:21,358 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 53 treesize of output 49 [2025-02-06 03:37:21,373 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2025-02-06 03:37:21,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 1 [2025-02-06 03:37:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:37:21,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732812716] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:37:21,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:37:21,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14, 9] total 20 [2025-02-06 03:37:21,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448292803] [2025-02-06 03:37:21,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:21,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:37:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:21,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:37:21,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:37:21,465 INFO L87 Difference]: Start difference. First operand 100 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:37:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:21,674 INFO L93 Difference]: Finished difference Result 258 states and 361 transitions. [2025-02-06 03:37:21,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:37:21,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-02-06 03:37:21,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:21,677 INFO L225 Difference]: With dead ends: 258 [2025-02-06 03:37:21,677 INFO L226 Difference]: Without dead ends: 161 [2025-02-06 03:37:21,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:37:21,679 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 70 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:21,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 797 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:37:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-06 03:37:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2025-02-06 03:37:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 132 states have (on average 1.3106060606060606) internal successors, (173), 133 states have internal predecessors, (173), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:37:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 219 transitions. [2025-02-06 03:37:21,704 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 219 transitions. Word has length 132 [2025-02-06 03:37:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:21,704 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 219 transitions. [2025-02-06 03:37:21,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:37:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 219 transitions. [2025-02-06 03:37:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:37:21,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:21,706 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:37:21,719 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-06 03:37:21,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:37:21,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:21,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1595317277, now seen corresponding path program 1 times [2025-02-06 03:37:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997648504] [2025-02-06 03:37:21,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:21,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:21,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:37:21,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:37:21,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:21,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:37:22,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:22,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997648504] [2025-02-06 03:37:22,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997648504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:22,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:22,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:37:22,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530574481] [2025-02-06 03:37:22,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:22,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:37:22,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:22,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:37:22,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:37:22,135 INFO L87 Difference]: Start difference. First operand 158 states and 219 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:37:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:22,293 INFO L93 Difference]: Finished difference Result 383 states and 530 transitions. [2025-02-06 03:37:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:37:22,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-02-06 03:37:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:22,298 INFO L225 Difference]: With dead ends: 383 [2025-02-06 03:37:22,298 INFO L226 Difference]: Without dead ends: 228 [2025-02-06 03:37:22,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:37:22,303 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 86 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:22,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 745 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:37:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-06 03:37:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2025-02-06 03:37:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 186 states have (on average 1.2956989247311828) internal successors, (241), 188 states have internal predecessors, (241), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 03:37:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2025-02-06 03:37:22,333 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 132 [2025-02-06 03:37:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:22,333 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2025-02-06 03:37:22,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:37:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2025-02-06 03:37:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:37:22,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:22,338 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:37:22,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:37:22,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:22,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash -294489052, now seen corresponding path program 1 times [2025-02-06 03:37:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:22,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167361230] [2025-02-06 03:37:22,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:22,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:22,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:37:22,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:37:22,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:22,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:37:23,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:23,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167361230] [2025-02-06 03:37:23,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167361230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:23,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:23,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:37:23,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861907606] [2025-02-06 03:37:23,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:23,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:37:23,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:23,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:37:23,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:37:23,409 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-02-06 03:37:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:24,201 INFO L93 Difference]: Finished difference Result 519 states and 713 transitions. [2025-02-06 03:37:24,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:37:24,202 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 133 [2025-02-06 03:37:24,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:24,204 INFO L225 Difference]: With dead ends: 519 [2025-02-06 03:37:24,204 INFO L226 Difference]: Without dead ends: 297 [2025-02-06 03:37:24,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:37:24,206 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 332 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:24,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 982 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:37:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-02-06 03:37:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 237. [2025-02-06 03:37:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 198 states have (on average 1.297979797979798) internal successors, (257), 200 states have internal predecessors, (257), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 03:37:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 327 transitions. [2025-02-06 03:37:24,231 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 327 transitions. Word has length 133 [2025-02-06 03:37:24,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:24,232 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 327 transitions. [2025-02-06 03:37:24,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-02-06 03:37:24,232 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 327 transitions. [2025-02-06 03:37:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:37:24,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:24,234 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:37:24,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:37:24,234 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:24,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:24,235 INFO L85 PathProgramCache]: Analyzing trace with hash 183011265, now seen corresponding path program 1 times [2025-02-06 03:37:24,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:24,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493820630] [2025-02-06 03:37:24,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:24,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:24,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:37:24,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:37:24,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:24,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:37:24,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:24,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493820630] [2025-02-06 03:37:24,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493820630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:24,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:24,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:37:24,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057243295] [2025-02-06 03:37:24,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:24,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:37:24,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:24,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:37:24,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:37:24,857 INFO L87 Difference]: Start difference. First operand 237 states and 327 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:37:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:25,592 INFO L93 Difference]: Finished difference Result 582 states and 800 transitions. [2025-02-06 03:37:25,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:37:25,596 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2025-02-06 03:37:25,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:25,599 INFO L225 Difference]: With dead ends: 582 [2025-02-06 03:37:25,599 INFO L226 Difference]: Without dead ends: 344 [2025-02-06 03:37:25,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:37:25,603 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 202 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:25,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1168 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:37:25,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-06 03:37:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 258. [2025-02-06 03:37:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 219 states have (on average 1.3013698630136987) internal successors, (285), 221 states have internal predecessors, (285), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 03:37:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 355 transitions. [2025-02-06 03:37:25,631 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 355 transitions. Word has length 134 [2025-02-06 03:37:25,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:25,632 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 355 transitions. [2025-02-06 03:37:25,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:37:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 355 transitions. [2025-02-06 03:37:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:37:25,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:25,634 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:37:25,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:37:25,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:25,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:25,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1393394272, now seen corresponding path program 1 times [2025-02-06 03:37:25,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:25,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031635214] [2025-02-06 03:37:25,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:25,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:25,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:37:25,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:37:25,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:25,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:37:27,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:27,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031635214] [2025-02-06 03:37:27,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031635214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:27,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:27,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:37:27,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007007314] [2025-02-06 03:37:27,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:27,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:37:27,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:27,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:37:27,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:37:27,127 INFO L87 Difference]: Start difference. First operand 258 states and 355 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:37:28,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:28,677 INFO L93 Difference]: Finished difference Result 989 states and 1340 transitions. [2025-02-06 03:37:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:37:28,678 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2025-02-06 03:37:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:28,684 INFO L225 Difference]: With dead ends: 989 [2025-02-06 03:37:28,684 INFO L226 Difference]: Without dead ends: 732 [2025-02-06 03:37:28,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2025-02-06 03:37:28,688 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 734 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:28,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1504 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:37:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-02-06 03:37:28,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 462. [2025-02-06 03:37:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 414 states have (on average 1.3309178743961352) internal successors, (551), 419 states have internal predecessors, (551), 41 states have call successors, (41), 6 states have call predecessors, (41), 6 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-06 03:37:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 633 transitions. [2025-02-06 03:37:28,736 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 633 transitions. Word has length 134 [2025-02-06 03:37:28,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:28,737 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 633 transitions. [2025-02-06 03:37:28,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:37:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 633 transitions. [2025-02-06 03:37:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:37:28,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:28,740 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:37:28,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:37:28,740 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:28,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:28,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1235231929, now seen corresponding path program 1 times [2025-02-06 03:37:28,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:28,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692116758] [2025-02-06 03:37:28,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:28,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:28,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:37:28,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:37:28,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:28,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:37:29,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:29,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692116758] [2025-02-06 03:37:29,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692116758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:29,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:29,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:37:29,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610469133] [2025-02-06 03:37:29,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:29,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:37:29,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:29,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:37:29,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:37:29,759 INFO L87 Difference]: Start difference. First operand 462 states and 633 transitions. Second operand has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-02-06 03:37:30,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:30,503 INFO L93 Difference]: Finished difference Result 1119 states and 1530 transitions. [2025-02-06 03:37:30,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:37:30,504 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 135 [2025-02-06 03:37:30,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:30,509 INFO L225 Difference]: With dead ends: 1119 [2025-02-06 03:37:30,509 INFO L226 Difference]: Without dead ends: 660 [2025-02-06 03:37:30,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:37:30,511 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 394 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:30,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 926 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:37:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-02-06 03:37:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 438. [2025-02-06 03:37:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 390 states have (on average 1.3153846153846154) internal successors, (513), 395 states have internal predecessors, (513), 41 states have call successors, (41), 6 states have call predecessors, (41), 6 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-06 03:37:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 595 transitions. [2025-02-06 03:37:30,553 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 595 transitions. Word has length 135 [2025-02-06 03:37:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:30,553 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 595 transitions. [2025-02-06 03:37:30,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-02-06 03:37:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 595 transitions. [2025-02-06 03:37:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:37:30,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:30,559 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:37:30,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:37:30,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:30,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1997951451, now seen corresponding path program 1 times [2025-02-06 03:37:30,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:30,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701868337] [2025-02-06 03:37:30,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:30,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:30,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:37:30,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:37:30,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:30,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:37:30,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:30,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701868337] [2025-02-06 03:37:30,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701868337] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:37:30,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130880070] [2025-02-06 03:37:30,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:30,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:37:30,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:37:30,987 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-06 03:37:30,991 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-06 03:37:31,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:37:31,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:37:31,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:31,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:31,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:37:31,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:37:31,407 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-06 03:37:31,499 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-06 03:37:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 298 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-02-06 03:37:31,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:37:31,655 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 32 treesize of output 28 [2025-02-06 03:37:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:37:31,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130880070] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:37:31,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:37:31,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2025-02-06 03:37:31,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419966461] [2025-02-06 03:37:31,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:37:31,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:37:31,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:31,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:37:31,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:37:31,765 INFO L87 Difference]: Start difference. First operand 438 states and 595 transitions. Second operand has 13 states, 10 states have (on average 6.9) internal successors, (69), 13 states have internal predecessors, (69), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) [2025-02-06 03:37:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:32,153 INFO L93 Difference]: Finished difference Result 893 states and 1205 transitions. [2025-02-06 03:37:32,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:37:32,154 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 6.9) internal successors, (69), 13 states have internal predecessors, (69), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) Word has length 135 [2025-02-06 03:37:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:32,156 INFO L225 Difference]: With dead ends: 893 [2025-02-06 03:37:32,156 INFO L226 Difference]: Without dead ends: 458 [2025-02-06 03:37:32,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:37:32,160 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 258 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:32,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 493 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:37:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-02-06 03:37:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 446. [2025-02-06 03:37:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 396 states have (on average 1.3005050505050506) internal successors, (515), 401 states have internal predecessors, (515), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-06 03:37:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 597 transitions. [2025-02-06 03:37:32,201 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 597 transitions. Word has length 135 [2025-02-06 03:37:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:32,203 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 597 transitions. [2025-02-06 03:37:32,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 6.9) internal successors, (69), 13 states have internal predecessors, (69), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) [2025-02-06 03:37:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 597 transitions. [2025-02-06 03:37:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:37:32,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:32,205 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:37:32,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:37:32,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:37:32,406 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:32,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:32,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1888191620, now seen corresponding path program 1 times [2025-02-06 03:37:32,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:32,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586831957] [2025-02-06 03:37:32,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:32,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:32,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:37:32,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:37:32,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:32,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:37:32,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:32,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586831957] [2025-02-06 03:37:32,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586831957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:32,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:32,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:37:32,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630362816] [2025-02-06 03:37:32,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:32,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:37:32,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:32,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:37:32,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:37:32,547 INFO L87 Difference]: Start difference. First operand 446 states and 597 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:37:32,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:32,716 INFO L93 Difference]: Finished difference Result 904 states and 1208 transitions. [2025-02-06 03:37:32,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:37:32,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-02-06 03:37:32,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:32,719 INFO L225 Difference]: With dead ends: 904 [2025-02-06 03:37:32,719 INFO L226 Difference]: Without dead ends: 461 [2025-02-06 03:37:32,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:37:32,721 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 86 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:32,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 597 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:37:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-02-06 03:37:32,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 458. [2025-02-06 03:37:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 403 states have (on average 1.2903225806451613) internal successors, (520), 408 states have internal predecessors, (520), 45 states have call successors, (45), 9 states have call predecessors, (45), 9 states have return successors, (45), 40 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 03:37:32,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 610 transitions. [2025-02-06 03:37:32,753 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 610 transitions. Word has length 135 [2025-02-06 03:37:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:32,754 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 610 transitions. [2025-02-06 03:37:32,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:37:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 610 transitions. [2025-02-06 03:37:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:37:32,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:32,756 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:37:32,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:37:32,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:32,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:32,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1594788613, now seen corresponding path program 1 times [2025-02-06 03:37:32,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:32,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542787312] [2025-02-06 03:37:32,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:32,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:32,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:37:32,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:37:32,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:32,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:37:33,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:33,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542787312] [2025-02-06 03:37:33,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542787312] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:37:33,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402106251] [2025-02-06 03:37:33,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:33,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:37:33,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:37:33,550 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-06 03:37:33,552 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-06 03:37:33,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:37:33,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:37:33,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:33,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:33,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 03:37:33,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:37:34,004 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 3 [2025-02-06 03:37:34,037 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-06 03:37:34,124 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 57 treesize of output 45 [2025-02-06 03:37:34,192 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 49 treesize of output 29 [2025-02-06 03:37:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-02-06 03:37:34,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:37:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:37:34,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402106251] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:37:34,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:37:34,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15, 9] total 22 [2025-02-06 03:37:34,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428285111] [2025-02-06 03:37:34,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:34,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:37:34,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:34,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:37:34,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:37:34,495 INFO L87 Difference]: Start difference. First operand 458 states and 610 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:37:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:34,816 INFO L93 Difference]: Finished difference Result 1034 states and 1371 transitions. [2025-02-06 03:37:34,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:37:34,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-02-06 03:37:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:34,821 INFO L225 Difference]: With dead ends: 1034 [2025-02-06 03:37:34,821 INFO L226 Difference]: Without dead ends: 579 [2025-02-06 03:37:34,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2025-02-06 03:37:34,823 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 70 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:34,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1061 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:37:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-02-06 03:37:34,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 572. [2025-02-06 03:37:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 509 states have (on average 1.2848722986247545) internal successors, (654), 516 states have internal predecessors, (654), 51 states have call successors, (51), 11 states have call predecessors, (51), 11 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 03:37:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 756 transitions. [2025-02-06 03:37:34,868 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 756 transitions. Word has length 135 [2025-02-06 03:37:34,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:34,868 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 756 transitions. [2025-02-06 03:37:34,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:37:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 756 transitions. [2025-02-06 03:37:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:37:34,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:34,871 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:37:34,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 03:37:35,071 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,SelfDestructingSolverStorable10 [2025-02-06 03:37:35,072 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:35,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:35,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1087059219, now seen corresponding path program 1 times [2025-02-06 03:37:35,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:35,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014305023] [2025-02-06 03:37:35,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:35,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:35,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:37:35,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:37:35,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:35,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:35,500 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:37:35,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:35,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014305023] [2025-02-06 03:37:35,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014305023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:35,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:35,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:37:35,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887458449] [2025-02-06 03:37:35,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:35,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:37:35,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:35,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:37:35,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:37:35,504 INFO L87 Difference]: Start difference. First operand 572 states and 756 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:37:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:35,697 INFO L93 Difference]: Finished difference Result 1381 states and 1826 transitions. [2025-02-06 03:37:35,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:37:35,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-02-06 03:37:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:35,703 INFO L225 Difference]: With dead ends: 1381 [2025-02-06 03:37:35,704 INFO L226 Difference]: Without dead ends: 802 [2025-02-06 03:37:35,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:37:35,705 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 55 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:35,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 626 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:37:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-02-06 03:37:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 558. [2025-02-06 03:37:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 495 states have (on average 1.2686868686868686) internal successors, (628), 502 states have internal predecessors, (628), 51 states have call successors, (51), 11 states have call predecessors, (51), 11 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 03:37:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 730 transitions. [2025-02-06 03:37:35,744 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 730 transitions. Word has length 135 [2025-02-06 03:37:35,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:35,744 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 730 transitions. [2025-02-06 03:37:35,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:37:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 730 transitions. [2025-02-06 03:37:35,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:37:35,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:35,746 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:37:35,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:37:35,747 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:35,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:35,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2098882743, now seen corresponding path program 1 times [2025-02-06 03:37:35,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:35,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953270117] [2025-02-06 03:37:35,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:35,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:35,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:37:35,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:37:35,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:35,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:37:36,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:36,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953270117] [2025-02-06 03:37:36,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953270117] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:37:36,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337748395] [2025-02-06 03:37:36,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:36,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:37:36,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:37:36,127 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-06 03:37:36,129 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-06 03:37:36,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:37:36,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:37:36,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:36,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:36,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:37:36,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:37:36,635 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-06 03:37:36,705 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-06 03:37:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 298 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-02-06 03:37:36,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:37:36,840 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 32 treesize of output 28 [2025-02-06 03:37:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:37:36,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337748395] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:37:36,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:37:36,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2025-02-06 03:37:36,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022375278] [2025-02-06 03:37:36,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:37:36,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:37:36,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:36,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:37:36,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:37:36,927 INFO L87 Difference]: Start difference. First operand 558 states and 730 transitions. Second operand has 12 states, 10 states have (on average 6.8) internal successors, (68), 12 states have internal predecessors, (68), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 2 states have call predecessors, (34), 4 states have call successors, (34) [2025-02-06 03:37:37,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:37,313 INFO L93 Difference]: Finished difference Result 1131 states and 1475 transitions. [2025-02-06 03:37:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:37:37,314 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.8) internal successors, (68), 12 states have internal predecessors, (68), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 2 states have call predecessors, (34), 4 states have call successors, (34) Word has length 135 [2025-02-06 03:37:37,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:37,317 INFO L225 Difference]: With dead ends: 1131 [2025-02-06 03:37:37,317 INFO L226 Difference]: Without dead ends: 576 [2025-02-06 03:37:37,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:37:37,319 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 241 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:37,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 492 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:37:37,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-02-06 03:37:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 558. [2025-02-06 03:37:37,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 495 states have (on average 1.2606060606060605) internal successors, (624), 502 states have internal predecessors, (624), 51 states have call successors, (51), 11 states have call predecessors, (51), 11 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 03:37:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 726 transitions. [2025-02-06 03:37:37,359 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 726 transitions. Word has length 135 [2025-02-06 03:37:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:37,359 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 726 transitions. [2025-02-06 03:37:37,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.8) internal successors, (68), 12 states have internal predecessors, (68), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 2 states have call predecessors, (34), 4 states have call successors, (34) [2025-02-06 03:37:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 726 transitions. [2025-02-06 03:37:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:37:37,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:37,362 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:37:37,372 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-06 03:37:37,566 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,SelfDestructingSolverStorable12 [2025-02-06 03:37:37,567 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:37,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:37,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1805479736, now seen corresponding path program 1 times [2025-02-06 03:37:37,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:37,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708861039] [2025-02-06 03:37:37,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:37,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:37,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:37:37,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:37:37,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:37,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:37:37,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1322997189] [2025-02-06 03:37:37,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:37,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:37:37,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:37:37,647 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-06 03:37:37,650 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-06 03:37:37,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:37:38,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:37:38,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:38,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:39,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 148 conjuncts are in the unsatisfiable core [2025-02-06 03:37:39,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:37:39,517 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 3 [2025-02-06 03:37:40,589 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 3 [2025-02-06 03:37:41,663 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-06 03:37:42,698 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-06 03:37:43,684 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 3 [2025-02-06 03:37:44,321 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 3 [2025-02-06 03:37:45,165 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 25 treesize of output 5 [2025-02-06 03:37:46,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2025-02-06 03:37:46,334 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 24 treesize of output 16 [2025-02-06 03:37:46,352 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 27 treesize of output 19 [2025-02-06 03:37:46,646 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 52 treesize of output 40 [2025-02-06 03:37:46,673 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-02-06 03:37:46,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2025-02-06 03:37:47,216 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 65 treesize of output 45 [2025-02-06 03:37:47,228 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 48 treesize of output 35 [2025-02-06 03:37:47,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 48 [2025-02-06 03:37:47,541 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 40 treesize of output 28 [2025-02-06 03:37:47,555 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 32 treesize of output 20 [2025-02-06 03:37:48,374 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 32 treesize of output 20 [2025-02-06 03:37:48,742 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 35 treesize of output 19 [2025-02-06 03:37:49,063 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 47 treesize of output 27 [2025-02-06 03:37:49,441 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 43 treesize of output 27 [2025-02-06 03:37:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 513 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 03:37:49,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:37:51,544 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 53 treesize of output 49 [2025-02-06 03:37:51,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:37:51,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 65 [2025-02-06 03:37:51,615 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 28 treesize of output 24 [2025-02-06 03:37:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708861039] [2025-02-06 03:37:54,052 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:37:54,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322997189] [2025-02-06 03:37:54,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322997189] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:37:54,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:37:54,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2025-02-06 03:37:54,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956362583] [2025-02-06 03:37:54,052 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 03:37:54,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-06 03:37:54,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:54,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-06 03:37:54,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=3316, Unknown=0, NotChecked=0, Total=3660 [2025-02-06 03:37:54,055 INFO L87 Difference]: Start difference. First operand 558 states and 726 transitions. Second operand has 45 states, 40 states have (on average 2.225) internal successors, (89), 38 states have internal predecessors, (89), 13 states have call successors, (17), 13 states have call predecessors, (17), 13 states have return successors, (17), 10 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-06 03:38:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:11,799 INFO L93 Difference]: Finished difference Result 2000 states and 2589 transitions. [2025-02-06 03:38:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-06 03:38:11,799 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 2.225) internal successors, (89), 38 states have internal predecessors, (89), 13 states have call successors, (17), 13 states have call predecessors, (17), 13 states have return successors, (17), 10 states have call predecessors, (17), 13 states have call successors, (17) Word has length 135 [2025-02-06 03:38:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:11,807 INFO L225 Difference]: With dead ends: 2000 [2025-02-06 03:38:11,808 INFO L226 Difference]: Without dead ends: 1445 [2025-02-06 03:38:11,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2471 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=965, Invalid=9337, Unknown=0, NotChecked=0, Total=10302 [2025-02-06 03:38:11,812 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 520 mSDsluCounter, 3059 mSDsCounter, 0 mSdLazyCounter, 4806 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 3178 SdHoareTripleChecker+Invalid, 4851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 4806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:11,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 3178 Invalid, 4851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 4806 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2025-02-06 03:38:11,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-02-06 03:38:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 647. [2025-02-06 03:38:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 558 states have (on average 1.2437275985663083) internal successors, (694), 565 states have internal predecessors, (694), 68 states have call successors, (68), 20 states have call predecessors, (68), 20 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-06 03:38:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 830 transitions. [2025-02-06 03:38:11,870 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 830 transitions. Word has length 135 [2025-02-06 03:38:11,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:11,870 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 830 transitions. [2025-02-06 03:38:11,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 2.225) internal successors, (89), 38 states have internal predecessors, (89), 13 states have call successors, (17), 13 states have call predecessors, (17), 13 states have return successors, (17), 10 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-06 03:38:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 830 transitions. [2025-02-06 03:38:11,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:38:11,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:11,873 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:38:11,882 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-06 03:38:12,077 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,SelfDestructingSolverStorable13 [2025-02-06 03:38:12,077 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:12,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash 961007865, now seen corresponding path program 1 times [2025-02-06 03:38:12,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:38:12,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244207232] [2025-02-06 03:38:12,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:12,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:38:12,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:38:12,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:38:12,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:12,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:38:12,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [51539660] [2025-02-06 03:38:12,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:12,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:38:12,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:38:12,156 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-06 03:38:12,158 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-06 03:38:12,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:38:12,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:38:12,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:12,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:12,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 120 conjuncts are in the unsatisfiable core [2025-02-06 03:38:12,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:38:13,006 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-06 03:38:13,738 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-06 03:38:14,496 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-06 03:38:15,627 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 3 [2025-02-06 03:38:16,127 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-06 03:38:16,726 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 25 treesize of output 5 [2025-02-06 03:38:17,405 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 25 treesize of output 19 [2025-02-06 03:38:17,492 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 24 treesize of output 16 [2025-02-06 03:38:17,506 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 27 treesize of output 19 [2025-02-06 03:38:17,650 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 52 treesize of output 40 [2025-02-06 03:38:17,674 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-02-06 03:38:17,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2025-02-06 03:38:18,224 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 56 treesize of output 40 [2025-02-06 03:38:18,242 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 44 treesize of output 28 [2025-02-06 03:38:18,681 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 32 treesize of output 20 [2025-02-06 03:38:19,241 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 47 treesize of output 27 [2025-02-06 03:38:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 505 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 03:38:19,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:38:25,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:38:25,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244207232] [2025-02-06 03:38:25,451 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:38:25,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51539660] [2025-02-06 03:38:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51539660] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:38:25,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:38:25,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2025-02-06 03:38:25,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419865855] [2025-02-06 03:38:25,452 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 03:38:25,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-06 03:38:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:38:25,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-06 03:38:25,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2481, Unknown=1, NotChecked=0, Total=2652 [2025-02-06 03:38:25,454 INFO L87 Difference]: Start difference. First operand 647 states and 830 transitions. Second operand has 39 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 34 states have internal predecessors, (83), 11 states have call successors, (17), 11 states have call predecessors, (17), 11 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17)