./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash b7b42d40a01333bd7cf600d1931e5c326b61c631d3a1040aaad3e0a3658ee3cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:17:29,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:17:29,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:17:29,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:17:29,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:17:29,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:17:29,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:17:29,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:17:29,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:17:29,148 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:17:29,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:17:29,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:17:29,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:17:29,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:17:29,150 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:17:29,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:17:29,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:17:29,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:17:29,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:17:29,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:17:29,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:17:29,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:17:29,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:17:29,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:17:29,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:17:29,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:17:29,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:17:29,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:17:29,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:17:29,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:17:29,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:17:29,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:17:29,152 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:17:29,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:17:29,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:17:29,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:17:29,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:17:29,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:17:29,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:17:29,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:17:29,153 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7b42d40a01333bd7cf600d1931e5c326b61c631d3a1040aaad3e0a3658ee3cf [2025-02-06 06:17:29,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:17:29,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:17:29,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:17:29,440 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:17:29,440 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:17:29,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-02-06 06:17:30,711 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6107b784e/9dc4eb0dfff042c58c399c738ca0db16/FLAG41d6eb291 [2025-02-06 06:17:31,234 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:17:31,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-02-06 06:17:31,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6107b784e/9dc4eb0dfff042c58c399c738ca0db16/FLAG41d6eb291 [2025-02-06 06:17:31,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6107b784e/9dc4eb0dfff042c58c399c738ca0db16 [2025-02-06 06:17:31,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:17:31,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:17:31,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:17:31,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:17:31,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:17:31,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:17:31" (1/1) ... [2025-02-06 06:17:31,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:31, skipping insertion in model container [2025-02-06 06:17:31,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:17:31" (1/1) ... [2025-02-06 06:17:31,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:17:32,341 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/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i[73128,73141] [2025-02-06 06:17:32,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:17:32,426 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:17:32,563 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/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i[73128,73141] [2025-02-06 06:17:32,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:17:32,632 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:17:32,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:32 WrapperNode [2025-02-06 06:17:32,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:17:32,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:17:32,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:17:32,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:17:32,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:32" (1/1) ... [2025-02-06 06:17:32,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:32" (1/1) ... [2025-02-06 06:17:32,730 INFO L138 Inliner]: procedures = 100, calls = 348, calls flagged for inlining = 40, calls inlined = 32, statements flattened = 802 [2025-02-06 06:17:32,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:17:32,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:17:32,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:17:32,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:17:32,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:32" (1/1) ... [2025-02-06 06:17:32,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:32" (1/1) ... [2025-02-06 06:17:32,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:32" (1/1) ... [2025-02-06 06:17:32,829 INFO L175 MemorySlicer]: Split 228 memory accesses to 6 slices as follows [2, 12, 14, 65, 103, 32]. 45 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 0, 0, 10, 0]. The 204 writes are split as follows [0, 12, 2, 65, 93, 32]. [2025-02-06 06:17:32,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:32" (1/1) ... [2025-02-06 06:17:32,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:32" (1/1) ... [2025-02-06 06:17:32,864 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:32" (1/1) ... [2025-02-06 06:17:32,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:32" (1/1) ... [2025-02-06 06:17:32,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:32" (1/1) ... [2025-02-06 06:17:32,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:32" (1/1) ... [2025-02-06 06:17:32,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:17:32,892 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:17:32,893 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:17:32,893 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:17:32,893 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:32" (1/1) ... [2025-02-06 06:17:32,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:17:32,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:17:32,924 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 06:17:32,927 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 06:17:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:17:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:17:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:17:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 06:17:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 06:17:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 06:17:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2025-02-06 06:17:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2025-02-06 06:17:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:17:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:17:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:17:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 06:17:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 06:17:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 06:17:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:17:32,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:17:32,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:17:32,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:17:32,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:17:32,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:17:32,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:17:32,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:17:32,953 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-02-06 06:17:32,953 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-02-06 06:17:32,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 06:17:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 06:17:32,954 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2025-02-06 06:17:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2025-02-06 06:17:32,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:17:32,954 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-02-06 06:17:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-02-06 06:17:32,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:17:32,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:17:32,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:17:32,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:17:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:17:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:17:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:17:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:17:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:17:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:17:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:17:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:17:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:17:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:17:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2025-02-06 06:17:32,956 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2025-02-06 06:17:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:17:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-02-06 06:17:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-02-06 06:17:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-02-06 06:17:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-02-06 06:17:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:17:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:17:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:17:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:17:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:17:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:17:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-02-06 06:17:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-02-06 06:17:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:17:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:17:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-02-06 06:17:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-02-06 06:17:33,219 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:17:33,221 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:17:33,248 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205: havoc #t~nondet118; [2025-02-06 06:17:33,278 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3201: havoc #t~ret117.base, #t~ret117.offset; [2025-02-06 06:17:33,292 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150: havoc #t~nondet105; [2025-02-06 06:17:38,519 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2249: havoc i2c_check_functionality_#t~bitwise40#1; [2025-02-06 06:17:38,520 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2300: call ULTIMATE.dealloc(isl6271a_probe_~#config~0#1.base, isl6271a_probe_~#config~0#1.offset);havoc isl6271a_probe_~#config~0#1.base, isl6271a_probe_~#config~0#1.offset;call ULTIMATE.dealloc(isl6271a_probe_~#__key~0#1.base, isl6271a_probe_~#__key~0#1.offset);havoc isl6271a_probe_~#__key~0#1.base, isl6271a_probe_~#__key~0#1.offset; [2025-02-06 06:17:38,520 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3209: havoc regulator_map_voltage_linear_#t~nondet119#1; [2025-02-06 06:17:38,520 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3212: havoc regulator_register_#t~ret120#1.base, regulator_register_#t~ret120#1.offset; [2025-02-06 06:17:38,520 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3180: havoc i2c_register_driver_#t~nondet113#1; [2025-02-06 06:17:38,520 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3166: havoc dev_get_drvdata_#t~ret110#1.base, dev_get_drvdata_#t~ret110#1.offset; [2025-02-06 06:17:38,521 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3184: havoc i2c_smbus_read_byte_#t~nondet114#1; [2025-02-06 06:17:38,521 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: havoc dev_set_drvdata_#t~nondet111#1; [2025-02-06 06:17:38,521 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3188: havoc i2c_smbus_write_byte_#t~nondet115#1; [2025-02-06 06:17:38,521 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: havoc devm_kzalloc_#t~ret112#1.base, devm_kzalloc_#t~ret112#1.offset; [2025-02-06 06:17:38,653 INFO L? ?]: Removed 261 outVars from TransFormulas that were not future-live. [2025-02-06 06:17:38,653 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:17:38,673 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:17:38,673 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 06:17:38,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:17:38 BoogieIcfgContainer [2025-02-06 06:17:38,674 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:17:38,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:17:38,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:17:38,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:17:38,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:17:31" (1/3) ... [2025-02-06 06:17:38,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737d9916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:17:38, skipping insertion in model container [2025-02-06 06:17:38,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:17:32" (2/3) ... [2025-02-06 06:17:38,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737d9916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:17:38, skipping insertion in model container [2025-02-06 06:17:38,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:17:38" (3/3) ... [2025-02-06 06:17:38,685 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-02-06 06:17:38,697 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:17:38,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i that has 12 procedures, 186 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-06 06:17:38,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:17:38,771 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;@7fe897f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:17:38,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:17:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 144 states have (on average 1.375) internal successors, (198), 156 states have internal predecessors, (198), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 06:17:38,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 06:17:38,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:17:38,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:17:38,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:17:38,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:17:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash -915725536, now seen corresponding path program 1 times [2025-02-06 06:17:38,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:17:38,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718141687] [2025-02-06 06:17:38,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:17:38,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:17:41,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 06:17:41,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 06:17:41,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:17:41,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:17:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:17:42,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:17:42,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718141687] [2025-02-06 06:17:42,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718141687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:17:42,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:17:42,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:17:42,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478532172] [2025-02-06 06:17:42,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:17:42,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:17:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:17:42,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:17:42,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:17:42,374 INFO L87 Difference]: Start difference. First operand has 190 states, 144 states have (on average 1.375) internal successors, (198), 156 states have internal predecessors, (198), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:17:46,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:17:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:17:47,056 INFO L93 Difference]: Finished difference Result 541 states and 754 transitions. [2025-02-06 06:17:47,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:17:47,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 06:17:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:17:47,072 INFO L225 Difference]: With dead ends: 541 [2025-02-06 06:17:47,072 INFO L226 Difference]: Without dead ends: 343 [2025-02-06 06:17:47,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:17:47,080 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 216 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-06 06:17:47,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 478 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-02-06 06:17:47,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-02-06 06:17:47,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 339. [2025-02-06 06:17:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 266 states have (on average 1.330827067669173) internal successors, (354), 273 states have internal predecessors, (354), 52 states have call successors, (52), 21 states have call predecessors, (52), 20 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 06:17:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 452 transitions. [2025-02-06 06:17:47,153 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 452 transitions. Word has length 15 [2025-02-06 06:17:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:17:47,153 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 452 transitions. [2025-02-06 06:17:47,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:17:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 452 transitions. [2025-02-06 06:17:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 06:17:47,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:17:47,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:17:47,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 06:17:47,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:17:47,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:17:47,157 INFO L85 PathProgramCache]: Analyzing trace with hash -645547843, now seen corresponding path program 1 times [2025-02-06 06:17:47,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:17:47,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439079499] [2025-02-06 06:17:47,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:17:47,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:17:49,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 06:17:49,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 06:17:49,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:17:49,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:17:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:17:49,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:17:49,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439079499] [2025-02-06 06:17:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439079499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:17:49,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:17:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:17:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723377106] [2025-02-06 06:17:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:17:49,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:17:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:17:49,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:17:49,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:17:49,736 INFO L87 Difference]: Start difference. First operand 339 states and 452 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:17:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:17:49,892 INFO L93 Difference]: Finished difference Result 361 states and 478 transitions. [2025-02-06 06:17:49,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:17:49,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 06:17:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:17:49,896 INFO L225 Difference]: With dead ends: 361 [2025-02-06 06:17:49,897 INFO L226 Difference]: Without dead ends: 350 [2025-02-06 06:17:49,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:17:49,899 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 234 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:17:49,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 263 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:17:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-06 06:17:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 339. [2025-02-06 06:17:49,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 266 states have (on average 1.3270676691729324) internal successors, (353), 273 states have internal predecessors, (353), 52 states have call successors, (52), 21 states have call predecessors, (52), 20 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 06:17:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 451 transitions. [2025-02-06 06:17:49,941 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 451 transitions. Word has length 18 [2025-02-06 06:17:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:17:49,941 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 451 transitions. [2025-02-06 06:17:49,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:17:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 451 transitions. [2025-02-06 06:17:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 06:17:49,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:17:49,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:17:49,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:17:49,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:17:49,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:17:49,944 INFO L85 PathProgramCache]: Analyzing trace with hash -616918692, now seen corresponding path program 1 times [2025-02-06 06:17:49,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:17:49,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307664059] [2025-02-06 06:17:49,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:17:49,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:17:51,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 06:17:51,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 06:17:51,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:17:51,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:17:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:17:52,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:17:52,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307664059] [2025-02-06 06:17:52,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307664059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:17:52,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:17:52,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:17:52,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263510803] [2025-02-06 06:17:52,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:17:52,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:17:52,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:17:52,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:17:52,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:17:52,031 INFO L87 Difference]: Start difference. First operand 339 states and 451 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:17:56,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:17:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:17:56,504 INFO L93 Difference]: Finished difference Result 341 states and 452 transitions. [2025-02-06 06:17:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:17:56,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 06:17:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:17:56,507 INFO L225 Difference]: With dead ends: 341 [2025-02-06 06:17:56,507 INFO L226 Difference]: Without dead ends: 338 [2025-02-06 06:17:56,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:17:56,509 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:17:56,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 235 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 06:17:56,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-06 06:17:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-02-06 06:17:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 266 states have (on average 1.3233082706766917) internal successors, (352), 272 states have internal predecessors, (352), 51 states have call successors, (51), 21 states have call predecessors, (51), 20 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 06:17:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 449 transitions. [2025-02-06 06:17:56,537 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 449 transitions. Word has length 18 [2025-02-06 06:17:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:17:56,537 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 449 transitions. [2025-02-06 06:17:56,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:17:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 449 transitions. [2025-02-06 06:17:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 06:17:56,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:17:56,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:17:56,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:17:56,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:17:56,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:17:56,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1944915556, now seen corresponding path program 1 times [2025-02-06 06:17:56,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:17:56,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047684825] [2025-02-06 06:17:56,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:17:56,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:17:58,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 06:17:58,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 06:17:58,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:17:58,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:17:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:17:58,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:17:58,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047684825] [2025-02-06 06:17:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047684825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:17:58,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:17:58,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:17:58,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118387503] [2025-02-06 06:17:58,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:17:58,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:17:58,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:17:58,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:17:58,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:17:58,709 INFO L87 Difference]: Start difference. First operand 338 states and 449 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:18:02,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:18:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:18:03,177 INFO L93 Difference]: Finished difference Result 340 states and 450 transitions. [2025-02-06 06:18:03,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:18:03,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 06:18:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:18:03,181 INFO L225 Difference]: With dead ends: 340 [2025-02-06 06:18:03,181 INFO L226 Difference]: Without dead ends: 337 [2025-02-06 06:18:03,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:18:03,182 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:18:03,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 233 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 06:18:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-02-06 06:18:03,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-02-06 06:18:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 266 states have (on average 1.3195488721804511) internal successors, (351), 271 states have internal predecessors, (351), 50 states have call successors, (50), 21 states have call predecessors, (50), 20 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 06:18:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 447 transitions. [2025-02-06 06:18:03,210 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 447 transitions. Word has length 19 [2025-02-06 06:18:03,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:18:03,213 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 447 transitions. [2025-02-06 06:18:03,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:18:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 447 transitions. [2025-02-06 06:18:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 06:18:03,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:18:03,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:18:03,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:18:03,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:18:03,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:18:03,216 INFO L85 PathProgramCache]: Analyzing trace with hash -163146403, now seen corresponding path program 1 times [2025-02-06 06:18:03,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:18:03,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459393643] [2025-02-06 06:18:03,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:18:03,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:18:04,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 06:18:04,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 06:18:04,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:18:04,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:18:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:18:05,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:18:05,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459393643] [2025-02-06 06:18:05,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459393643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:18:05,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:18:05,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:18:05,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122086334] [2025-02-06 06:18:05,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:18:05,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:18:05,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:18:05,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:18:05,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:18:05,244 INFO L87 Difference]: Start difference. First operand 337 states and 447 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:18:09,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:18:09,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:18:09,788 INFO L93 Difference]: Finished difference Result 347 states and 453 transitions. [2025-02-06 06:18:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:18:09,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 06:18:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:18:09,792 INFO L225 Difference]: With dead ends: 347 [2025-02-06 06:18:09,793 INFO L226 Difference]: Without dead ends: 343 [2025-02-06 06:18:09,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:18:09,796 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 181 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:18:09,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 262 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 06:18:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-02-06 06:18:09,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2025-02-06 06:18:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 270 states have (on average 1.3037037037037038) internal successors, (352), 273 states have internal predecessors, (352), 48 states have call successors, (48), 23 states have call predecessors, (48), 22 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 06:18:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 446 transitions. [2025-02-06 06:18:09,823 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 446 transitions. Word has length 20 [2025-02-06 06:18:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:18:09,824 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 446 transitions. [2025-02-06 06:18:09,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:18:09,824 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 446 transitions. [2025-02-06 06:18:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 06:18:09,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:18:09,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:18:09,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:18:09,826 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:18:09,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:18:09,827 INFO L85 PathProgramCache]: Analyzing trace with hash -762878531, now seen corresponding path program 1 times [2025-02-06 06:18:09,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:18:09,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334236708] [2025-02-06 06:18:09,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:18:09,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:18:11,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 06:18:11,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 06:18:11,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:18:11,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:18:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:18:11,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:18:11,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334236708] [2025-02-06 06:18:11,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334236708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:18:11,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:18:11,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:18:11,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222838829] [2025-02-06 06:18:11,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:18:11,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:18:11,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:18:11,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:18:11,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:18:11,940 INFO L87 Difference]: Start difference. First operand 341 states and 446 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:18:15,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:18:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:18:16,382 INFO L93 Difference]: Finished difference Result 343 states and 447 transitions. [2025-02-06 06:18:16,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:18:16,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 06:18:16,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:18:16,384 INFO L225 Difference]: With dead ends: 343 [2025-02-06 06:18:16,385 INFO L226 Difference]: Without dead ends: 333 [2025-02-06 06:18:16,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:18:16,386 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 211 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-06 06:18:16,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-02-06 06:18:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-06 06:18:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-02-06 06:18:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 263 states have (on average 1.3041825095057034) internal successors, (343), 265 states have internal predecessors, (343), 47 states have call successors, (47), 23 states have call predecessors, (47), 22 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 06:18:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 436 transitions. [2025-02-06 06:18:16,413 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 436 transitions. Word has length 21 [2025-02-06 06:18:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:18:16,413 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 436 transitions. [2025-02-06 06:18:16,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:18:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 436 transitions. [2025-02-06 06:18:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 06:18:16,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:18:16,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:18:16,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:18:16,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:18:16,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:18:16,418 INFO L85 PathProgramCache]: Analyzing trace with hash -492076627, now seen corresponding path program 1 times [2025-02-06 06:18:16,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:18:16,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824783150] [2025-02-06 06:18:16,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:18:16,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:18:18,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 06:18:18,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 06:18:18,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:18:18,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:18:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:18:18,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:18:18,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824783150] [2025-02-06 06:18:18,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824783150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:18:18,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:18:18,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:18:18,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416877211] [2025-02-06 06:18:18,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:18:18,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:18:18,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:18:18,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:18:18,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:18:18,395 INFO L87 Difference]: Start difference. First operand 333 states and 436 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 06:18:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:18:18,705 INFO L93 Difference]: Finished difference Result 763 states and 1001 transitions. [2025-02-06 06:18:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:18:18,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2025-02-06 06:18:18,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:18:18,708 INFO L225 Difference]: With dead ends: 763 [2025-02-06 06:18:18,708 INFO L226 Difference]: Without dead ends: 432 [2025-02-06 06:18:18,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:18:18,710 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 127 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:18:18,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 426 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 06:18:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-02-06 06:18:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2025-02-06 06:18:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 348 states have (on average 1.3074712643678161) internal successors, (455), 351 states have internal predecessors, (455), 56 states have call successors, (56), 28 states have call predecessors, (56), 27 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-06 06:18:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 566 transitions. [2025-02-06 06:18:18,733 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 566 transitions. Word has length 43 [2025-02-06 06:18:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:18:18,733 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 566 transitions. [2025-02-06 06:18:18,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 06:18:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 566 transitions. [2025-02-06 06:18:18,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 06:18:18,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:18:18,735 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:18,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 06:18:18,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:18:18,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:18:18,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1289867569, now seen corresponding path program 1 times [2025-02-06 06:18:18,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:18:18,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313189956] [2025-02-06 06:18:18,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:18:18,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:18:20,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 06:18:20,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 06:18:20,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:18:20,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:18:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 06:18:20,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:18:20,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313189956] [2025-02-06 06:18:20,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313189956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:18:20,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:18:20,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:18:20,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310305111] [2025-02-06 06:18:20,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:18:20,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:18:20,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:18:20,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:18:20,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:18:20,740 INFO L87 Difference]: Start difference. First operand 432 states and 566 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 06:18:24,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:18:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:18:25,274 INFO L93 Difference]: Finished difference Result 432 states and 566 transitions. [2025-02-06 06:18:25,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:18:25,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2025-02-06 06:18:25,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:18:25,277 INFO L225 Difference]: With dead ends: 432 [2025-02-06 06:18:25,277 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 06:18:25,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:18:25,280 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 22 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:18:25,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 399 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 06:18:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 06:18:25,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 06:18:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:18:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 06:18:25,283 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2025-02-06 06:18:25,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:18:25,283 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 06:18:25,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 06:18:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 06:18:25,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 06:18:25,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 06:18:25,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 06:18:25,289 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:18:25,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 06:18:56,100 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 06:18:56,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 06:18:56 BoogieIcfgContainer [2025-02-06 06:18:56,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 06:18:56,107 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 06:18:56,107 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 06:18:56,107 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 06:18:56,108 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:17:38" (3/4) ... [2025-02-06 06:18:56,110 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 06:18:56,116 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2025-02-06 06:18:56,116 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-02-06 06:18:56,116 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-02-06 06:18:56,116 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-02-06 06:18:56,116 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure regulator_unregister [2025-02-06 06:18:56,116 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2025-02-06 06:18:56,117 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-02-06 06:18:56,117 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure rdev_get_drvdata [2025-02-06 06:18:56,117 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure regulator_list_voltage_linear [2025-02-06 06:18:56,117 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure dev_err [2025-02-06 06:18:56,117 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2025-02-06 06:18:56,136 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 68 nodes and edges [2025-02-06 06:18:56,137 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-02-06 06:18:56,139 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 06:18:56,140 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 06:18:56,141 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 06:18:56,297 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 06:18:56,298 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 06:18:56,298 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 06:18:56,299 INFO L158 Benchmark]: Toolchain (without parser) took 84521.86ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 119.7MB in the beginning and 688.2MB in the end (delta: -568.5MB). Peak memory consumption was 750.6MB. Max. memory is 16.1GB. [2025-02-06 06:18:56,300 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 06:18:56,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 854.08ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 61.6MB in the end (delta: 57.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 06:18:56,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.14ms. Allocated memory is still 167.8MB. Free memory was 61.6MB in the beginning and 55.6MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 06:18:56,301 INFO L158 Benchmark]: Boogie Preprocessor took 158.49ms. Allocated memory is still 167.8MB. Free memory was 55.6MB in the beginning and 45.5MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 06:18:56,301 INFO L158 Benchmark]: IcfgBuilder took 5781.55ms. Allocated memory is still 167.8MB. Free memory was 45.5MB in the beginning and 68.5MB in the end (delta: -23.1MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2025-02-06 06:18:56,301 INFO L158 Benchmark]: TraceAbstraction took 77430.21ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 67.6MB in the beginning and 705.4MB in the end (delta: -637.8MB). Peak memory consumption was 680.4MB. Max. memory is 16.1GB. [2025-02-06 06:18:56,302 INFO L158 Benchmark]: Witness Printer took 191.55ms. Allocated memory is still 1.5GB. Free memory was 705.4MB in the beginning and 688.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 06:18:56,304 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 854.08ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 61.6MB in the end (delta: 57.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.14ms. Allocated memory is still 167.8MB. Free memory was 61.6MB in the beginning and 55.6MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 158.49ms. Allocated memory is still 167.8MB. Free memory was 55.6MB in the beginning and 45.5MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 5781.55ms. Allocated memory is still 167.8MB. Free memory was 45.5MB in the beginning and 68.5MB in the end (delta: -23.1MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * TraceAbstraction took 77430.21ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 67.6MB in the beginning and 705.4MB in the end (delta: -637.8MB). Peak memory consumption was 680.4MB. Max. memory is 16.1GB. * Witness Printer took 191.55ms. Allocated memory is still 1.5GB. Free memory was 705.4MB in the beginning and 688.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2687]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 186 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.5s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 1432 SdHoareTripleChecker+Valid, 27.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1432 mSDsluCounter, 2524 SdHoareTripleChecker+Invalid, 25.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 663 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1861 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=7, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 06:18:56,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE